Shape Analysis by Predicate Abstraction

Balaban, Ittai; Pnueli, Amir; Zuck, Lenore D.

doi:10.1007/978-3-540-30579-8_12

Cited by 71 publications

(66 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of SAT for software model checking has also been explored in the context of both sequential ANSI-C programs [14] and asynchronous concurrent Boolean programs [15]. Proving program termination via ranking functions is also a rich, and developing, research area [16,3].…”

Section: Related Workmentioning

confidence: 99%

SAT-Based Software Certification

Chaki

2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We formalize a notion of witnesses for satisfaction of linear temporal logic specifications by infinite state programs. We show how such witnesses may be constructed via predicate abstraction, and validated by generating verification conditions and proving them. We propose the use of SAT-based theorem provers and resolution proofs in proving these verification conditions. In addition to yielding extremely compact proofs, a SAT-based approach overcomes several limitations of conventional theorem provers when applied to the verification of programs written in real-life programming languages. We also formalize a notion of witnesses of simulation conformance between infinite state programs and finite state machine specifications. We present algorithms to construct simulation witnesses of minimal size by solving pseudo-Boolean constraints. We present experimental results on several non-trivial benchmarks which suggest that a SAT-based approach can yield extremely compact proofs, in some cases by a factor of over 10 5 , when compared to existing non-SAT-based theorem provers.

show abstract

Section: Related Workmentioning

confidence: 99%

SAT-Based Software Certification

Chaki

2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…The transitive closure of the transition relation is harder to compute or approximate than the set of reachable states. Extensions of predicate abstraction techniques for synthesizing ranking functions have also been developed by Balaban, Pnueli, and Zuck [8].…”

Section: Introductionmentioning

confidence: 99%

Proving Liveness by Backwards Reachability

Abdulla

Jönsson

Rezine

et al. 2006

CONCUR 2006 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing the transitive closure of the transition relation. The set of states from which termination or some liveness property is guaranteed is computed by a backwards reachability analysis. A central technique for handling concurrency is a check for certain commutativity properties. The method is not complete. However, it can be seen as a complement to other methods for proving termination, in that it transforms a termination problem into a simpler one with a larger set of terminated states. We show the usefulness of our method by applying it to existing programs from the literature. We have also implemented it in the framework of Regular Model Checking, and used it to automatically verify non-starvation for parameterized algorithms.

show abstract

“…Programs manipulating singly-linked lists have gained a lot of attention within the past two years, as shown by the fairly large number of recent publications on the subject [4,6,18,3,8]. Interestingly, the idea of abstracting away all the list segments with no incoming edges is common to many of these works, even though they are independent and use different approaches and frameworks (e.g., static analysis [18], predicate abstraction [3] symbolic reachability analysis [4] and proof search [6]). The fact that the number of sharing points in abstract heap structures is bounded by the number of variables in the program is also behind the techniques proposed in [18,8].…”

Section: Introductionmentioning

confidence: 99%

Programs with Lists Are Counter Automata

Bouajjani

Bozga

Habermehl

et al. 2006

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abstract heap graphs where list segments without sharing are collapsed, and counters are used to keep track of the number of elements in these segments. This allows to apply automatic analysis techniques and tools for counter automata in order to verify list programs. We show the effectiveness of our approach, in particular by verifying automatically termination of some sorting programs.

show abstract

Shape Analysis by Predicate Abstraction

Cited by 71 publications

References 15 publications

SAT-Based Software Certification

SAT-Based Software Certification

Proving Liveness by Backwards Reachability

Programs with Lists Are Counter Automata

Contact Info

Product

Resources

About