Supporting SAT based BMC on finite path models

Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Rabinovitz, Ohad Shacham, Rachel Tzoref

Research output: Contribution to journalArticlepeer-review

Abstract

The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under verification contains finite paths. Models with finite paths might be produced unknowingly when using modern verification languages such as PSL-Sugar [Property Specification Language: Reference Manual. Version 1.1, Accellera, June 2004]. Specifically, the use of language constructs such as restrict, assume etc. might lead to such models. Thus the user may receive misleading results from SAT based tools. In this paper we describe in what circumstances the finite path problem occurs and present an improved translation of the BMC problem into a SAT instance. The new translation does not suffer from the discussed shortcoming. Our translation is only slightly longer then the usual one introducing one extra Boolean variable in the model. We also show that this translation may improve the SAT solver runtime even for models without finite paths.

Original languageEnglish
Pages (from-to)67-77
Number of pages11
JournalElectronic Notes in Theoretical Computer Science
Volume144
Issue number1 SPEC. ISS
DOIs
StatePublished - 11 Jan 2006
Externally publishedYes

Keywords

  • BMC
  • Finite paths
  • PSL

Fingerprint

Dive into the research topics of 'Supporting SAT based BMC on finite path models'. Together they form a unique fingerprint.

Cite this