22 search results - page 3 / 5 » Invariants and Well-Foundedness in Program Algebra |
JLP
2007
13 years 5 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
APLAS
2010
ACM
13 years 6 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
POPL
2004
ACM
14 years 6 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
ECOOP
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...