279 search results - page 25 / 56 » Invariant Patterns for Program Reasoning |
POPL
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
FMCAD
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
LPAR
2012
Springer
12 years 3 months ago
2012
Springer
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
POPL
2005
ACM
14 years 7 months ago
2005
ACM
In 1996, Gil and Lorenz proposed programming language constructs for specifying environmental acquisition in addition to inheritance acquisition for objects. They noticed that in ...