An automata-theoretic dynamic completeness criterion for bounded model-checking

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

Abstract

Bounded model-checking is a technique for finding bugs in very large designs. Bounded model-checking by itself is incomplete: it can find bugs, but it cannot prove that a system satisfies a specification. A dynamic completeness criterion can allow bounded model-checking to prove properties. A dynamic completeness criterion typically searches for a "beginning" of a bug or bad behavior; if no such "beginning" can be found, we can conclude that no bug exists, and bounded model-checking can terminate. Dynamic completeness criteria have been suggested for several temporal logics, but most are tied to a specific bounded model-checking encoding, and the ones that are not are based on nondeterministic Büchi automata. In this paper we develop a theoretic framework for dynamic completeness criteria based on alternating Büchi automata. Our criterion generalizes and explains several existing dynamic completeness criteria, and is suitable for both linear-time and universal branching-time logic. We show that using alternating automata rather than nondeterministic automata can lead to much smaller completeness thresholds.

Original languageEnglish
Title of host publicationVerification, Model Checking, and Abstract Interpretation - 10th International Conference, VMCAI 2009, Proceedings
Pages275-289
Number of pages15
DOIs
StatePublished - 2009
Externally publishedYes
Event10th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2009 - Savannah, GA, United States
Duration: 18 Jan 200920 Jan 2009

Publication series

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

Conference

Conference10th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2009
Country/TerritoryUnited States
CitySavannah, GA
Period18/01/0920/01/09

Fingerprint

Dive into the research topics of 'An automata-theoretic dynamic completeness criterion for bounded model-checking'. Together they form a unique fingerprint.

Cite this