Improving the Encoding of LTL Model Checking into SAT

Cimatti, Alessandro and Pistore, Marco and Roveri, Marco and Sebastiani, Roberto (2002) Improving the Encoding of LTL Model Checking into SAT. UNSPECIFIED. (In Press)

[img]
Preview
 PDF
Download (247Kb) | Preview

    Abstract

    Bounded Model Checking (BMC) is a technique for encoding an LTL model checking problem into a problem of propositional satisfiability. Since the seminal paper by [Biere et al.'99], the research on BMC has been primarily directed at achieving higher efficiency for solving reachability properties. In this paper, we tackle the problem of improving BMC encodings for the full class of LTL properties. We start noticing some properties of the encoding of [Biere et al.'99], and we exploit them to define improvements that make the resulting boolean formulas smaller or simpler to solve.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: model checking, formal verification, SAT
    Additional Information: In Proc: 3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI'02. Venice, Italy, 2002. LNCS , N.2294 © Springer Verlag.
    Report Number: DIT-02-046
    Repository staff approval on: 21 Jan 2003

    Actions (login required)

    		 View Item