A new approach to bounded model checking for branching time logics

Rotem Oshman, Orna Grumberg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically applied only for linear-time properties, with a few exceptions, which search for a counter-example in the form of a tree-like structure with a pre-determined shape. We suggest a new approach to bounded model checking for universal branching-time logic, in which we encode an arbitrary graph and allow the SAT solver to choose both the states and edges of the graph. This significantly reduces the size of the counter-example produced by BMC. A dynamic completeness criterion is presented which can be used to halt the bounded model checking when it becomes clear that no counterexample can exist. Thus, verification of the checked property can also be achieved. Experiments show that our approach outperforms another recent encoding for μ-calculus on complex ACTL properties.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 5th International Symposium, ATVA 2007, Proceedings
PublisherSpringer Verlag
Pages410-424
Number of pages15
ISBN (Print)9783540755951
DOIs
StatePublished - 2007
Externally publishedYes
Event5th International Symposium on Automated Technology for Verification and Analysis, ATVA 2007 - Tokyo, Japan
Duration: 22 Oct 200725 Oct 2007

Publication series

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

Conference

Conference5th International Symposium on Automated Technology for Verification and Analysis, ATVA 2007
Country/TerritoryJapan
CityTokyo
Period22/10/0725/10/07

Fingerprint

Dive into the research topics of 'A new approach to bounded model checking for branching time logics'. Together they form a unique fingerprint.

Cite this