Symbolic Model Checking without BDDs

  • Armin Biere
  • Alessandro Cimatti
  • Edmund Clarke
  • Yunshan Zhu
Conference paper

DOI: 10.1007/3-540-49059-0_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1579)
Cite this paper as:
Biere A., Cimatti A., Clarke E., Zhu Y. (1999) Symbolic Model Checking without BDDs. In: Cleaveland W.R. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1999. Lecture Notes in Computer Science, vol 1579. Springer, Berlin, Heidelberg

Abstract

Symbolic Model Checking [3], [14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stålmarck’s Method [16] or the Davis & Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. In addition, it produces counterexamples of minimal length. We introduce a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.We show that bounded LTL model checking can be done without a tableau construction. We have implemented a model checker BMC, based on bounded model checking, and preliminary results are presented.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Armin Biere
    • 1
  • Alessandro Cimatti
    • 2
  • Edmund Clarke
    • 1
  • Yunshan Zhu
    • 1
  1. 1.Computer Science DepartmentCarnegie Mellon UniversityPittsburghUSA
  2. 2.Istituto per la Ricerca Scientifica e Tecnologica (IRST)Povo (TN)Italy

Personalised recommendations