Tuning SAT Checkers for Bounded Model Checking

Shtrichman, Ofer

doi:10.1007/10722167_36

Cited by 115 publications

(80 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SIM is a SAT solver based on the Davis-Logemann-Loveland procedure. The features provided by SIM can produce dramatic speed-ups in the overall performances of the SAT checker, and thus of the whole system (see e.g., [19,10] for a discussion). It is currently under development a generic interface to SAT solvers to allow for the use of new state of the art SAT solvers like e.g.…”

Section: B F Ementioning

confidence: 99%

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Cimatti¹,

Clarke

Giunchiglia

et al. 2002

Lecture Notes in Computer Science

1,253

901

View full text Add to dashboard Cite

This paper describes version 2 of the NuSMV tool. NuSMV is a symbolic model\ud checker originated from the reengineering, reimplementation and extension of\ud SMV, the original BDD-based model checker developed at CMU. The Nu-\ud SMV project aims at the development of a state-of-the-art symbolic model\ud checker, designed to be applicable in technology transfer projects: it is a well\ud structured, open, flexible and documented platform for model checking, and is\ud robust and close to industrial systems standards

show abstract

Section: B F Ementioning

confidence: 99%

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Cimatti¹,

Clarke

Giunchiglia

et al. 2002

Lecture Notes in Computer Science

1,253

901

View full text Add to dashboard Cite

show abstract

“…In particular, we will investigate alternative representations of locations, events and transitions; we will look for new propagation axioms and invariants to prune search, in particular taking into account more powerful forms of symmetry reduction. Then, we will investigate the customization of MathSAT for encoded timed automata, by defining splitting heuristics that take into account the different semantics of the variables [GMS98,Sht00] and new mechanisms for propagating and exploiting equalities between real values. Finally, we want to perform an extensive experimental evaluation, also on synchronous domains, to identify the bottlenecks and the strengths of the approach.…”

Section: Discussionmentioning

confidence: 99%

Bounded Model Checking for Timed Systems

Audemard

Cimatti

Korniłowicz

et al. 2002

Formal Techniques for Networked and Distributed Sytems — FORTE 2002

View full text Add to dashboard Cite

Abstract. Enormous progress has been achieved in the last decade in the verification of timed systems, making it possible to analyze significant real-world protocols. An open challenge is the identification of fully symbolic verification techniques, able to deal effectively with the finite state component as well as with the timing aspects. In this paper we propose a new, symbolic verification technique that extends the Bounded Model Checking (BMC) approach for the verification of timed systems. The approach is based on the following ingredients. First, a BMC problem for timed systems is reduced to the satisfiability of a math-formula, i.e., a boolean combination of propositional variables and linear mathematical relations over real variables (used to represent clocks). Then, an appropriate solver, called MathSAT, is used to check the satisfiability of the math-formula. The solver is based on the integration of SAT techniques with some specialized decision procedures for linear mathematical constraints, and requires polynomial memory. Our methods allow for handling expressive properties in a fully-symbolic way. A preliminary experimental evaluation confirms the potential of the approach.

show abstract

“…The earliest works on SAT-BMC were based on SAT solvers such as GRASP and SATO, which used variable ordering heusristics such as the DLIS heuristic [70]. Strichman [95] proposed a static variable ordering scheme specifically targeted for BMC problems that improved upon the default DLIS ordering. The static order was generated from a BFS-like traversal of the unrolled circuit graph used for BMC.…”

Section: Decision Variable Ordering Of the Sat Solvermentioning

confidence: 99%

“…However, recent results [88] show that the conflictdriven variable ordering heuristics used in modern SAT solvers (e.g., the VSIDS heuristic in zchaff [77]) outperform any fully static BMC-specific variable ordering scheme, such as the one proposed in [95]. A slight tuning of these heuristics for the BMC problem [88] can fur-ther enhance the performance.…”

Section: Decision Variable Ordering Of the Sat Solvermentioning

confidence: 99%

A survey of recent advances in SAT-based formal verification

Prasad

Biere

Gupta³

2005

Int J Softw Tools Technol Transfer

205

120

View full text Add to dashboard Cite

Abstract. Dramatic improvements in SAT solver technology over the last decade and the growing need for more efficient and scalable verification solutions have fueled research in verification methods based on SAT solvers. This paper presents a survey of the latest developments in SAT-based formal verification, including incomplete methods such as bounded model checking and complete methods for model checking. We focus on how the surveyed techniques formulate the verification problem as a SAT problem and how they exploit crucial aspects of a SAT solver, such as application-specific heuristics and conflict-driven learning. Finally, we summarize the noteworthy achievements in this area so far and note the major challenges in making this technology more pervasive in industrial design verification flows.

show abstract

Tuning SAT Checkers for Bounded Model Checking

Cited by 115 publications

References 15 publications

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Bounded Model Checking for Timed Systems

A survey of recent advances in SAT-based formal verification

Contact Info

Product

Resources

About