Book Chapter10.1007/978-3-540-30482-1_22
Software model checking using linear constraints
Alessandro Armando,Claudio Castellini,Jacopo Mantovani +2 more
- 08 Nov 2004
- pp 209-223
12
TL;DR: This paper proposes Linear Programs as a finer grained abstraction for sequential programs and proposes a model checking procedure for this family of programs and presents the eureka toolkit, which consists of a prototype implementation of the modelchecking procedure for Linear Programs and a library of Linear Programs to be used for benchmarking.
read more
Abstract: Iterative abstraction refinement has emerged in the last few years as the leading approach to software model checking. In this context Boolean programs are commonly employed as simple, yet useful abstractions from conventional programming languages. In this paper we propose Linear Programs as a finer grained abstraction for sequential programs and propose a model checking procedure for this family of programs. We also present the eureka toolkit, which consists of a prototype implementation of our model checking procedure for Linear Programs as well as of a library of Linear Programs to be used for benchmarking. Experimental results obtained by running our model checker against the library provide evidence of the effectiveness of the approach.
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
Counterexamples with loops for predicate abstraction
Daniel Kroening,Georg Weissenbacher +1 more
- 17 Aug 2006
TL;DR: In this article, the authors propose to extract looping counterexamples from the abstract model, and to parameterize the simulation instance in the number of loop iterations, which is similar to our approach.
•Journal Article
Counterexamples with loops for predicate abstraction
TL;DR: This work proposes to extract looping counterexamples from the abstract model, and to parameterize the simulation instance in the number of loop iterations.
26
Abstraction refinement of linear programs with arrays
Alessandro Armando,Massimo Benerecetti,Jacopo Mantovani +2 more
- 24 Mar 2007
TL;DR: This paper lifts the model checking procedure for linear programs to deal with arrays via iterative abstraction refinement and presents experimental results that confirm the effectiveness of the approach on a number of programs of interest.
Verification and falsification of programs with loops using predicate abstraction
TL;DR: This work proposes to extract looping counterexamples from the abstract model, and to parametrise the simulation instance in the number of loop iterations, a novel technique that speeds up the detection of long countereXamples as well as the verification of programs with loops.
Model Checking Linear Programs with Arrays
TL;DR: It is shown that the model checking procedure for linear programs can be extended in such a way to support the analysis of linear programs featuring a symbol for undefined values and conditional expressions.
17
References
The model checker SPIN
Gerard J. Holzmann
- 01 May 1997
TL;DR: An overview of the design and structure of the verifier, its theoretical foundation, and an overview of significant practical applications are given.
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.
A Tool for Checking ANSI-C Programs
Edmund M. Clarke,Daniel Kroening,Flavio Lerda +2 more
- 29 Mar 2004
TL;DR: The tool supports almost all ANSI-C language features, including pointer constructs, dynamic memory allocation, recursion, and the float and double data types, and is integrated into a graphical user interface.
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
Related Papers (5)
[...]
Thomas A. Henzinger,Ranjit Jhala,Rupak Majumdar,Grégoire Sutre +3 more
- 01 Jan 2002
Byron Cook,Daniel Kroening,Natasha Sharygina +2 more
- 22 Aug 2005
Patrice Godefroid,Mihalis Yannakakis +1 more
- 16 Mar 2013