An optimized symbolic bounded model checking engine

Rachel Tzoref, Mark Matusevich, Eli Berger, Ilan Beer

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

It has been shown that bounded model checking using a SAT solver can solve many verification problems that would cause BDD based symbolic model checking engines to explode. However, no single algorithmic solution has proven to be totally superior in resolving all types of model checking problems. We present an optimized bounded model checker based on BDDs and describe the advantages and drawbacks of this model checker as compared to BDD-based symbolic model checking and SAT-based model checking. We show that, in some cases, this engine solves verification problems that could not be solved by other methods.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsDaniel Geist, Enrico Tronci
PublisherSpringer Verlag
Pages141-149
Number of pages9
ISBN (Print)354020363X
DOIs
StatePublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2860
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'An optimized symbolic bounded model checking engine'. Together they form a unique fingerprint.

Cite this