12 search results - page 2 / 3 » Finding Loop Invariants for Programs over Arrays Using a The... |
KBSE
2005
IEEE
13 years 10 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
APSEC
2005
IEEE
13 years 10 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 ...
FASE
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
JLP
2007
13 years 4 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
NFM
2011
12 years 11 months ago
2011
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...