An optimized symbolic bounded model checking engine

Rachel Tzoref; Mark Matusevich; Eli Berger; Ilan Beer

doi:10.1007/978-3-540-39724-3_13

An optimized symbolic bounded model checking engine

Rachel Tzoref^*, Mark Matusevich, Eli Berger, Ilan Beer

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Daniel Geist, Enrico Tronci
Publisher	Springer Verlag
Pages	141-149
Number of pages	9
ISBN (Print)	354020363X
DOIs	https://doi.org/10.1007/978-3-540-39724-3_13
State	Published - 2003
Externally published	Yes

Publication series

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

Access to Document

10.1007/978-3-540-39724-3_13

Cite this

Tzoref, R., Matusevich, M., Berger, E., & Beer, I. (2003). An optimized symbolic bounded model checking engine. In D. Geist, & E. Tronci (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 141-149). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2860). Springer Verlag. https://doi.org/10.1007/978-3-540-39724-3_13

Tzoref, Rachel ; Matusevich, Mark ; Berger, Eli et al. / An optimized symbolic bounded model checking engine. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Daniel Geist ; Enrico Tronci. Springer Verlag, 2003. pp. 141-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{4f65bb5d2bc6445e931480820c26f5de,

title = "An optimized symbolic bounded model checking engine",

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.",

author = "Rachel Tzoref and Mark Matusevich and Eli Berger and Ilan Beer",

year = "2003",

doi = "10.1007/978-3-540-39724-3_13",

language = "אנגלית",

isbn = "354020363X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "141--149",

editor = "Daniel Geist and Enrico Tronci",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Tzoref, R, Matusevich, M, Berger, E & Beer, I 2003, An optimized symbolic bounded model checking engine. in D Geist & E Tronci (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2860, Springer Verlag, pp. 141-149. https://doi.org/10.1007/978-3-540-39724-3_13

An optimized symbolic bounded model checking engine. / Tzoref, Rachel; Matusevich, Mark; Berger, Eli et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Daniel Geist; Enrico Tronci. Springer Verlag, 2003. p. 141-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2860).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - An optimized symbolic bounded model checking engine

AU - Tzoref, Rachel

AU - Matusevich, Mark

AU - Berger, Eli

AU - Beer, Ilan

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0142152301&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-39724-3_13

DO - 10.1007/978-3-540-39724-3_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:0142152301

SN - 354020363X

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 141

EP - 149

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Geist, Daniel

A2 - Tronci, Enrico

PB - Springer Verlag

ER -

Tzoref R, Matusevich M, Berger E, Beer I. An optimized symbolic bounded model checking engine. In Geist D, Tronci E, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 141-149. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-39724-3_13

An optimized symbolic bounded model checking engine

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this