Bounded Model Checking for All Regular Properties

Jehle, Markus; Johannsen, Jan; Lange, Martin; Rachinsky, Nicolas

doi:10.1016/j.entcs.2005.07.016

Cited by 7 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have presented a BDD-based model checking algorithm for ETL in [15] and an algorithm for BDD-based model checking of an invariant of PSL in [16]. Jehle et al present a bounded model checking algorithm for linearcalculus in [17]. And in [18], a tester based symbolic model checking approach is proposed by Pnueli and Zacks to deal with PSL properties.…”

Section: Introductionmentioning

confidence: 99%

Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives

Wang

Liu

et al. 2013

Journal of Applied Mathematics

View full text Add to dashboard Cite

As a complementary technique of the BDD-based approach, bounded model checking (BMC) has been successfully applied to LTL symbolic model checking. However, the expressiveness of LTL is rather limited, and some important properties cannot be captured by such logic. In this paper, we present a semantic BMC encoding approach to deal with the mixture ofETLfandETLl. Since such kind of temporal logic involves both finite and looping automata as connectives, all regular properties can be succinctly specified with it. The presented algorithm is integrated into the model checker ENuSMV, and the approach is evaluated via conducting a series of imperial experiments.

show abstract

Section: Introductionmentioning

confidence: 99%

Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives

Wang

Liu

et al. 2013

Journal of Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…Using automata as specification mechanisms can lead to simple and generic encodings. Even encodings based on temporal logic (e.g., [10] and [12]) can often be viewed as simulating the run of the product automaton, although they do not construct it directly.…”

Section: Introductionmentioning

confidence: 99%

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

“…The second encoding we present is similar to the first, but using ideas from [10] and [8], we eliminate the use of ranks. The idea is that instead of directly encoding the rank ρ q (s) for states s ∈ I q , we will store a subset I σ q for each rank σ, containing states s ∈ I q that have ρ q (s) ≤ σ.…”

Section: Eliminating the Use Of Ranksmentioning

confidence: 99%

“…In particular, [10] and [8] apply ideas from the world of symbolic model-checking for branching-time logic to BMC for lineartime. Here we apply similar ideas in their original context of model-checking for branching-time logic.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Bounded Model Checking for All Regular Properties

Cited by 7 publications

References 18 publications

Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives

Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives

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

A New Approach to Bounded Model Checking for Branching Time Logics

Contact Info

Product

Resources

About