Book Chapter10.1007/978-3-319-10575-8_10
SAT-Based Model Checking
Armin Biere,Daniel Kröning +1 more
- 01 Jan 2018
- pp 277-303
38
TL;DR: This chapter covers the application of bounded model checking to both hardware and software systems, and to hardware/software co-verification, and means to make BMC complete, including \(k\)-induction, Craig interpolation, abstraction refinement techniques, and inductive techniques with iterative strengthening.
read more
Abstract: Modern satisfiability (SAT) solvers have become the enabling technology of many model checkers. In this chapter, we will focus on those techniques most relevant to industrial practice. In bounded model checking (BMC), a transition system and a property are jointly unwound for a given number \(k\) of steps to obtain a formula that is satisfiable if there is a counterexample for the property up to length \(k\). The formula is then passed to an efficient SAT solver. The strength of BMC is refutation: BMC has been used to discover subtle flaws in digital systems. We cover the application of BMC to both hardware and software systems, and to hardware/software co-verification. We also discuss means to make BMC complete, including \(k\)-induction, Craig interpolation, abstraction refinement techniques, and inductive techniques with iterative strengthening.
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
•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
Handbook of Model Checking
Edmund M. Clarke,Thomas A. Henzinger,Helmut Veith,Roderick Bloem +3 more
- 07 May 2021
TL;DR: The editors classify the advances in this domain and the chapters of the handbook in terms of two recurrent themes that have driven much of the research agenda: the algorithmic challenge, that is, designing model-checking algorithms that scale to real-life problems; and the modeling challenge, which is, extending the formalism beyond Kripke structures and temporal logic.
720
Hyperproperties for Robotics: Planning via HyperLTL
Yu Wang,Siddhartha Nalluri,Miroslav Pajic +2 more
- 01 May 2020
TL;DR: In this paper, the authors extend the scope of existing synthesis methods to hyper-temporal logics, and propose HyperLTL, an extension of LTL to multiple paths.
31
On Combining Static, Dynamic and Interactive Analysis Security Testing Tools to Improve OWASP Top Ten Security Vulnerability Detection in Web Applications
Francesc Mateo Tudela,Juan Ramón Bermejo Higuera,Javier Bermejo Higuera,Juan-Antonio Sicilia Montalvo,Michael I. Argyros +4 more
TL;DR: This study analyzes and discusses the values of the selected metrics applied to the results for each n-tools combination, to investigate how to improve the effectiveness of security vulnerability detection while reducing the number of false positives.
25
Modular Verification of JML Contracts Using Bounded Model Checking
Bernhard Beckert,Michael Kirsten,Jonas Klamroth,Mattias Ulbrich +3 more
- 20 Oct 2020
TL;DR: This paper presents a transformation that takes Java programs annotated with contracts written in the Java Modeling Language and turns them into Java programs that can be read by the bounded model checker JBMC, introducing concepts from the world of contract-based deductive verification into the domain of software bounded model checking.
References
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Chaff: engineering an efficient SAT solver
Matthew W. Moskewicz,Conor F. Madigan,Ying Zhao,Lintao Zhang,Sharad Malik +4 more
- 22 Jun 2001
TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
An Extensible SAT-solver
Niklas Een,Niklas Sörensson +1 more
- 05 May 2003
TL;DR: This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.
Symbolic execution and program testing
TL;DR: A particular system called EFFIGY which provides symbolic execution for program testing and debugging is described, which interpretively executes programs written in a simple PL/I style programming language.
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.
Related Papers (5)
Yakir Vizel,Arie Gurfinkel,Sharad Malik +2 more
- 18 Jul 2015
Aarti Gupta,Malay K. Ganai,Pranav Ashar +2 more
- 03 Jan 2005