Interpolant-based transition relation approximation
Ranjit Jhala,Kenneth L. McMillan +1 more
- 06 Jul 2005
- pp 39-51
TL;DR: This approach guarantees convergence given an adequate set of predicates, without requiring an exact image computation, and shows empirically that the method converges more rapidly than an earlier method based on counterexample analysis.
read more
Abstract: In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of predicates. We present an interpolant-based method for strengthening the abstract transition relation in case of such failures. This approach guarantees convergence given an adequate set of predicates, without requiring an exact image computation. We show empirically that the method converges more rapidly than an earlier method based on counterexample analysis.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Satisfiability Modulo Theories
Clark Barrett,Cesare Tinelli +1 more
- 01 Jan 2018
TL;DR: The architecture of a lazy SMT solver is discussed, examples of theory solvers are given, how to combine such solvers modularly is shown, and several extensions of the lazy approach are mentioned.
1.1K
•Journal Article
Interpolation and SAT-based model checking
TL;DR: In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
775
Lazy abstraction with interpolants
Kenneth L. McMillan
- 17 Aug 2006
TL;DR: A model checker for infinite-state sequential programs, based on Craig interpolation and the lazy abstraction paradigm, which observes a speedup of up to two orders of magnitude relative to a similar tool using predicate abstraction.
•Journal Article
Lazy abstraction with interpolants
TL;DR: In this paper, a model checker for infinite-state sequential programs, based on Craig interpolation and the lazy abstraction paradigm, is described. But it is not a model checking tool for program analysis.
448
Software model checking
Ranjit Jhala,Rupak Majumdar +1 more
TL;DR: A survey of recent progress in software model checking finds that the current state of the art in model checking is improving, but the pace of improvement is still slow.
References
Symbolic Model Checking without BDDs
Armin Biere,Alessandro Cimatti,Edmund M. Clarke,Yunshan Zhu +3 more
- 22 Mar 1999
TL;DR: This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.
Counterexample-guided abstraction refinement
Edmund M. Clarke
- 08 Jul 2003
TL;DR: Counterexample-guided abstraction refinement is an automatic abstraction method where the key step is to extract information from false negatives ("spurious counterexamples") due to over-approximation.
Lazy abstraction
Thomas A. Henzinger,Ranjit Jhala,Rupak Majumdar,Grégoire Sutre +3 more
- 01 Jan 2002
TL;DR: This work presents an algorithm for model checking safety properties using lazy abstraction and describes an implementation of the algorithm applied to C programs and provides sufficient conditions for the termination of the method.
1.3K
The SLAM project: debugging system software via static analysis
Thomas Ball,Sriram K. Rajamani +1 more
- 01 Jan 2002
TL;DR: This work has successfully applied the SLAM toolkit to Windows XP device drivers, to both validate behavior and find defects in their usage of kernel APIs.
Interpolation and SAT-Based Model Checking
Kenneth L. McMillan
- 08 Jul 2003
TL;DR: In this article, a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants was proposed, which is greatly more efficient than BDD-based symbolic model-checking.
Related Papers (5)
Kenneth L. McMillan
- 08 Jul 2003
Thomas A. Henzinger,Ranjit Jhala,Rupak Majumdar,Kenneth L. McMillan +3 more
- 01 Jan 2004
Edmund M. Clarke
- 08 Jul 2003