Incremental and Complete Bounded Model Checking for Full PLTL

Heljanko, Keijo; Junttila, Tommi; Latvala, Timo

doi:10.1007/11513988_10

Cited by 54 publications

(58 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Now if for any such k the resulting CNF is unsatisfiable, then so is the original LTL formula. The resulting method is very similar to BMC in [29] when checking for termination by using the completeness formula only rather than completeness and simplepath formula together (only presence of the latter can ensure termination).…”

Section: Unsatisfiable Cores Via Bounded Model Checkingmentioning

confidence: 99%

Towards a Notion of Unsatisfiable Cores for LTL

Schuppan¹

2010

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Abstract. Unsatisfiable cores, i.e., parts of an unsatisfiable formula that are themselves unsatisfiable, have important uses in debugging specifications, speeding up search in model checking or SMT, and generating certificates of unsatisfiability. While unsatisfiable cores have been well investigated for Boolean SAT and constraint programming, the notion of unsatisfiable cores for temporal logics such as LTL has not received much attention. In this paper we investigate notions of unsatisfiable cores for LTL that arise from the syntax tree of an LTL formula, from converting it into a conjunctive normal form, and from proofs of its unsatisfiability. The resulting notions are more fine-granular than existing ones.

show abstract

Section: Unsatisfiable Cores Via Bounded Model Checkingmentioning

confidence: 99%

Towards a Notion of Unsatisfiable Cores for LTL

Schuppan¹

2010

Fundamentals of Software Engineering

View full text Add to dashboard Cite

show abstract

“…If a property does not hold, a counterexample trace can be generated to show an execution trace of the model that violates the property. To cope with the state explosion problem, advanced techniques can be applied, in particular symbolic techniques based on Binary Decision Diagrams (BDD) [9] and SAT-based Bounded Model Checking [4,5,22,18] (BMC). Verification can also benefit from advanced techniques for compiling temporal properties into a symbolic LTS [12].…”

Section: Verification Of Functional Propertiesmentioning

confidence: 99%

The COMPASS Approach: Correctness, Modelling and Performability of Aerospace Systems

Bozzano

Cimatti

Katoen

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.We report on a model-based approach to system-software coengineering which is tailored to the specific characteristics of critical onboard systems for the aerospace domain. The approach is supported by a System-Level Integrated Modeling (SLIM) Language by which engineers are provided with convenient ways to describe nominal hardware and software operation, (probabilistic) faults and their propagation, error recovery, and degraded modes of operation.Correctness properties, safety guarantees, and performance and dependability requirements are given using property patterns which act as parameterized "templates" to the engineers and thus offer a comprehensible and easy-to-use framework for requirement specification. Instantiated properties are checked on the SLIM specification using state-of-the-art formal analysis techniques such as bounded SAT-based and symbolic model checking, and probabilistic variants thereof. The precise nature of these techniques together with the formal SLIM semantics yield a trustworthy modeling and analysis framework for system and software engineers supporting, among others, automated derivation of dynamic (i.e., randomly timed) fault trees, FMEA tables, assessment of FDIR, and automated derivation of observability requirements.

show abstract

“…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%

“…There are many BMC encodings for various fragments of linear-time logic and automata on words; e.g., [4] for LTL, [10] for PLTL, [11] for weak alternating Büchi automata. Many are based, directly or indirectly, on the idea of constructing a product automaton M × A for the model M in question and an automaton A which describes all the undesirable behaviors.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Incremental and Complete Bounded Model Checking for Full PLTL

Cited by 54 publications

References 29 publications

Towards a Notion of Unsatisfiable Cores for LTL

Towards a Notion of Unsatisfiable Cores for LTL

The COMPASS Approach: Correctness, Modelling and Performability of Aerospace Systems

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

Contact Info

Product

Resources

About