Symbolic Model Checking without BDDs

DMCA

Symbolic Model Checking without BDDs (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Armin Biere , Alessandro Cimatti , Edmund Clarke , Yunshan Zhu

Citations:

914 - 75 self

BibTeX

@MISC{Biere99symbolicmodel,
    author = {Armin Biere and Alessandro Cimatti and Edmund Clarke and Yunshan Zhu},
    title = {Symbolic Model Checking without BDDs},
    year = {1999}
}

OpenURL

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 Stalmarck'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.

Keyphrases

symbolic model checking new technique ltl model checking symbolic representation preliminary result model checker bmc tableau construction reactive system davis putnam procedure bounded model propositional satisfiability powerful technique minimal length bounded model checking boolean decision procedure

DMCA