61 search results - page 2 / 13 » Invariant Checking for Programs with Procedure Calls |
ESOP
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
FAC
2008
13 years 5 months ago
2008
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
ECOOP
2004
Springer
13 years 10 months ago
2004
Springer
Today’s mainstream object-oriented compilers and tools do not support declaring and statically checking simple pre- and postconditions on methods and invariants on object represe...