Sciweavers

37 search results - page 1 / 8
» Automatic Termination Proofs for Programs with Shape-Shiftin...
Sort
View
CAV
2006
Springer
143views Hardware» more  CAV 2006»
13 years 11 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
POPL
2012
ACM
12 years 3 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
CAV
2012
Springer
270views Hardware» more  CAV 2012»
11 years 9 months ago
Automated Termination Proofs for Java Programs with Cyclic Data
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...
RTA
2011
Springer
12 years 10 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
APLAS
2005
ACM
14 years 1 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn