Proceedings Article10.1145/1403375.1403578
Completeness in SMT-based BMC for software programs
Malay K. Ganai,Aarti Gupta +1 more
- 10 Mar 2008
- pp 831-836
TL;DR: This work augments previous methods for BMC simplifications using model transformation and control flow information, with context-sensitive analysis, and proposes an efficient method for obtaining CT that requires solving a formula of size O(k) at some depths only, as compared to previous methods that require solving a formulas of O(K2) (or O( klogk) size at every depth.
read more
Abstract: Bounded Model Checking (BMC) is incomplete without a completeness threshold (CT) bound. Previous methods, using recurrence diameter for obtaining CT, check for existence of a longest loop-free path at every depth k. For terminating software programs, we propose an efficient method for obtaining CT that requires solving a formula of size O(k) at some depths only, as compared to previous methods that require solving a formula of O(k2) (or O(klogk)) size at every depth. We augment previous methods for BMC simplifications using model transformation and control flow information, with context-sensitive analysis. This results in more BMC simplifications and further reduction in the number of CT checks. We have implemented our techniques in a Satisfiability Modulo Theory (SMT)-based BMC framework. Our controlled experiments on real-world software programs show that our proposed formulation provides significant improvements over previous approaches.
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
Generalized rewrite theories, coherence completion, and symbolic methods
TL;DR: A new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing the standard notion in [19] is motivated and defined, and several symbolic reasoning methods using generalized rewrite theories are studied.
44
Efficient Modeling of Concurrent Systems in BMC
Malay K. Ganai,Aarti Gupta +1 more
- 10 Aug 2008
TL;DR: An efficient method for modeling multi-threaded concurrent systems with shared variables and locks in Bounded Model Checking is presented, and it is used to improve the detection of safety properties such as data races.
SMT-based bounded model checking for multi-threaded software in embedded systems
Lucas C. Cordeiro
- 01 May 2010
TL;DR: A new algorithmic method and corresponding tools based on SMT to verify embedded software in multi-core systems to reduce the number of state variables and interleavings from the proof of unsatisfiability generated by the SMT solvers.
Structure-aware computation of predicate abstraction
Alessandro Cimatti,Jori Dubrovin,Tommi Junttila,Marco Roveri +3 more
- 11 Dec 2009
TL;DR: This paper provides a structure-aware abstraction algorithm, based on two complementary steps, that partitions the abstraction problem into the combination of several smaller abstraction problems, represented as a formula with quantifiers.
16
Verified over-approximation of the diameter of propositionally factored transition systems
Mohammad Abdulaziz,Mohammad Abdulaziz,Charles Gretton,Charles Gretton,Michael Norrish +4 more
- 24 Aug 2015
TL;DR: A novel overapproximation of the diameter of the Kripke model of the transition system is provided, called the sublist diameter, that is tighter than the recurrence diameter, and it is proved that compositional approaches are valid using it to bound atomic subsystems.
References
•Book
Compilers: Principles, Techniques, and Tools
Alfred V. Aho,Ravi Sethi,Jeffrey D. Ullman +2 more
- 01 Jan 1986
TL;DR: This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
9.7K
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
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.
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.
Checking Safety Properties Using Induction and a SAT-Solver
Mary Sheeran,Satnam Singh,Gunnar Stålmarck +2 more
- 01 Nov 2000
TL;DR: Some novel induction-based methods are described, and it is shown how they are related to more standard fixpoint algorithms for invariance checking and preliminary experimental results in the verification of FPGA cores are presented.
848
Related Papers (5)
Armin Biere,Alessandro Cimatti,Edmund M. Clarke,Yunshan Zhu +3 more
- 22 Mar 1999
Martin Davis,Hilary Putnam +1 more