632 search results - page 6 / 127 » Proving Invariants of Functional Programs |
90
Voted
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
68
Voted
COCO
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
SAS
2005
Springer
15 years 3 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
92
Voted
APSEC
2005
IEEE
15 years 3 months ago
2005
IEEE
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...