Proving ∀μ-Calculus Properties with SAT-Based Model Checking

Wang, Bow-Yaw

doi:10.1007/11562436_10

Cited by 13 publications

(26 citation statements)

References 24 publications

(56 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several bounded model-checking encodings have been suggested for universal branching-time temporal logic [18], [19], [22], [23]. [22] and [18] show accompanying dynamic completeness criteria for their respective encodings, and a dynamic completeness criterion for the encoding of [19] is presented in [24].…”

Section: Related Workmentioning

confidence: 99%

“…The effectiveness of dynamic completeness criteria has been shown in experimental results ( [10], [22], [24]). However, designing completeness criteria that are both sound and effective can be challenging.…”

Section: Introductionmentioning

confidence: 99%

“…However, designing completeness criteria that are both sound and effective can be challenging. For instance, the completeness criterion in [22] contains a subtle flaw: a constraint introduced to cause earlier termination and increase the effectiveness of the criterion causes the criterion to be unsound. For details, see [17].…”

Section: Introductionmentioning

confidence: 99%

“…In addition, existing completeness criteria are often custom-designed to fit one particular encoding. For example, the dynamic completeness criteria of [22], [18] and [24] are all based on ideas similar to the ones on which the current paper is based, but they each develop the completeness criterion anew to fit the particular encoding.…”

Section: Introductionmentioning

confidence: 99%

“…In addition to linear-time logic, several BMC encodings and accompanying completeness criteria have been suggested for universal branching-time logic ( [19], [23], [22], [18]). Our completeness criterion is based on automata on infinite words, which express linear-time properties.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

Oshman

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

Oshman

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Proving ∀μ-Calculus Properties with SAT-Based Model Checking

Wang

2005

Formal Techniques for Networked and Distributed Systems - FORTE 2005

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we present a complete bounded model checking algorithm for the universal fragment of µ-calculus. The new algorithm checks the completeness of bounded proof of each property on the fly and does not depend on prior knowledge of the completeness thresholds. The key is to combine both local and bounded model checking techniques and use SAT solvers to perform local model checking on finite Kripke structures. Our proof-theoretic approach works for any property in the specification logic and is more general than previous work on specific properties. We report experimental results to compare our algorithm with the conventional BDD-based algorithm.

show abstract

A New Approach to Bounded Model Checking for Branching Time Logics

Oshman

Grumberg

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

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.

show abstract

Proving ∀μ-Calculus Properties with SAT-Based Model Checking

Cited by 13 publications

References 24 publications

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

Proving ∀μ-Calculus Properties with SAT-Based Model Checking

A New Approach to Bounded Model Checking for Branching Time Logics

Contact Info

Product

Resources

About