Efficient SAT-based unbounded symbolic model checking using circuit cofactoring

Ganai, Malay K.; Gupta, Aarti; Ashar, Pranav

doi:10.1109/iccad.2004.1382631

Cited by 64 publications

(75 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that SAT-based enlargement of cubes also appears in the work of McMillan [26], who uses SAT-based enumeration for existential quantification. The idea of instantiating (multiple) instances of Boolean formulae with models can be seen as a form of circuit co-factoring as described by Ganai et al [15]. A recent contribution to reasoning about quantified bit-vector formulae was made by Wintersteiger et al [36], who most notably used word-level simplifications and template instantiations.…”

Section: Related Workmentioning

confidence: 99%

Approximate Quantifier Elimination for Propositional Boolean Formulae

Brauer

King²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining overapproximations of a given formula. This construction naturally leads to an anytime algorithm, that is, it can be interrupted at anytime without compromising soundness. This contrasts with classical monolithic (all or nothing) approaches based on resolution or model enumeration.

show abstract

Section: Related Workmentioning

confidence: 99%

Approximate Quantifier Elimination for Propositional Boolean Formulae

Brauer

King²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…More recently, a SAT-based quantification technique using circuit cofactoring has been proposed by Ganai et al [40]. They too use a SAT solver to enumerate solutions, but they use circuit cofactoring after each enumeration to capture a larger set of new state cubes per enumeration, in comparison with cubewise enumeration techniques.…”

Section: Purely Sat-based Techniquesmentioning

confidence: 99%

A survey of recent advances in SAT-based formal verification

Prasad

Biere

Gupta³

2005

Int J Softw Tools Technol Transfer

202

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

“…Other techniques for making BMC complete are cube enlargement [17], circuit co-factoring [13], and Craig interpolants [18].…”

Section: Determining the Boundmentioning

confidence: 99%

Model Checking and the State Explosion Problem

Clarke¹,

Klieber²,

Nováček³

et al. 2012

Lecture Notes in Computer Science

179

112

View full text Add to dashboard Cite

Abstract. Model checking is an automatic verification technique for concurrent systems that are finite state or have finite state abstractions. It has been used successfully to verify computer hardware, and it is beginning to be used to verify computer software as well. As the number of state variables in the system increases, the size of the system state space grows exponentially. This is called the "state explosion problem". Much of the research in model checking over the past 30 years has involved developing techniques for dealing with this problem. In these lecture notes, we will explain how the basic model checking algorithms work and describe some recent approaches to the state explosion problem, with an emphasis on Bounded Model Checking.

show abstract

Efficient SAT-based unbounded symbolic model checking using circuit cofactoring

Cited by 64 publications

References 18 publications

Approximate Quantifier Elimination for Propositional Boolean Formulae

Approximate Quantifier Elimination for Propositional Boolean Formulae

A survey of recent advances in SAT-based formal verification

Model Checking and the State Explosion Problem

Contact Info

Product

Resources

About