Incremental and Complete Bounded Model Checking for Full PLTL

@inproceedings{Heljanko2005IncrementalAC,
  title={Incremental and Complete Bounded Model Checking for Full PLTL},
  author={Keijo Heljanko and Tommi A. Junttila and Timo Latvala},
  booktitle={CAV},
  year={2005}
}
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. Recently, some progress has been made towards proving properties of LTL. We present an incremental and complete bounded model checking method for the full linear temporal logic with past (PLTL). Compared to previous works, our method both improves and extends current results in many ways: (i) our encoding is incremental… 
A New Approach to Bounded Model Checking for Branching Time Logics
TLDR
A new approach is suggested to bounded model checking for universal branching-time logic, in which an arbitrary graph is encoded and allowed to choose both the states and edges of the graph and this significantly reduces the size of the counter-example produced by BMC.
SAT-Based Model Checking
TLDR
This chapter covers the application of bounded model checking to both hardware and software systems, and to hardware/software co-verification, and means to make BMC complete, including \(k\)-induction, Craig interpolation, abstraction refinement techniques, and inductive techniques with iterative strengthening.
Incremental bounded software model checking
TLDR
This work presents an incremental approach to Bounded Software Model Checking, which enables increasing the bound without incurring the overhead of a restart, and provides an LLVM-based open-source implementation which supports a wide range of incremental SMT solvers.
Incremental Semantic LTL Bounded Model Checking
TLDR
An incremental semantic translation for Bounded model checking is presented and an incremental algorithm is given to implement this method in NuSMV model checker and report encouraging results.
Bounded semantics based correctness checking for extended ECTL∗ properties
  • Fei Pu
  • Computer Science
    2017 2nd International Conference on Robotics and Automation Engineering (ICRAE)
  • 2017
TLDR
A bounded correctness checking algorithm for eECTL∗ formulas is proposed and aQBF encoding of this logic is developed from the definition of the bounded semantics to derive a QBF-based characterization of eECTl∗ properties.
Temporal logic encodings for SAT-based bounded model checking
TLDR
The normal form conversion early on in the encoding process is introduced and the simplifications that it brings to the generation of propositional logic are examined and compared to the popular automata-based methods for model checking and BMC.
Efficient Bounded Model Checking for LTL
TLDR
This paper presents an linearization encoding for LTL bounded model checking, and uses the incremental SAT technology to solve the BMC problem and implements the new encoding in NuSMV model checker.
Linear Encodings of Bounded LTL Model Checking
TLDR
Experiments clearly show that the new encodings in this paper improve performance of BMC con- siderably, particularly in the case of the incremental encoding, and that they are very competitive for finding bugs.
Bounded Correctness Checking for Extended CTL Properties with Past Operators
  • Fei Pu
  • Computer Science
    GSKI
  • 2017
TLDR
This paper studies bounded semantics of extended CTL formulas with past operators (PeCTL) and develops a QBF encoding of PeCTL from the proposed bounded semantics, which allows some sort of fairness but also could reason about the past behaviors of the systems being verified.
Multi-level Bounded Model Checking to detect bugs beyond the bound
TLDR
This paper presents a method connecting multiple BMCs by sophisticated uses of inductive approach and symbolic simulation, which can check unbounded properties by analyzing loop behaviors in the design with decision procedures.
...
...

References

SHOWING 1-10 OF 63 REFERENCES
Simple Is Better: Efficient Bounded Model Checking for Past LTL
TLDR
This work proposes a new more efficient encoding of the bounded model checking problem for PLTL based on the previously presented encoding for LTL, which is linear in the bound.
Bounded Model Checking for Past LTL
TLDR
It is shown how SAT-based Bounded Model Checking techniques can be extended to deal with Linear Temporal Logics with Past Operators (PLTL), and an encoding scheme able to cope with PLTL formulas is proposed.
Proving More Properties with Bounded Model Checking
TLDR
This paper proposes a termination criterion for all of LTL, based on converting the LTL formula to a Buchi automaton so as to reduce model checking to the verification of a fairness constraint.
Symbolic Model Checking without BDDs
TLDR
This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.
Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A)
TLDR
A general k-induction scheme is defined and strengthened invariant strengthening is demonstrated using infinite-state systems ranging from communication protocols to timed automata and (linear) hybrid automata.
Another Look at LTL Model Checking
TLDR
The SMV model checking system developed by McMillan can be extended to permit LTL specifications and the results that are obtained are quite surprising.
Testing LTL formula translation into Büchi automata
TLDR
A randomized testing approach based on the cross-comparison of independent translator implementations, and methods for test failure analysis are presented, which has helped to detect errors in model checking tools such as Spin.
Bounded model checking and induction: From refutation to verification
TLDR
A general k-induction scheme is defined and strengthened invariant strengthening is demonstrated using infinite-state systems ranging from communication protocols to timed automata and (linear) hybrid automata.
Efficient Computation of Recurrence Diameters
TLDR
It is shown that the longest initialized loop-free path in the state graph, also known as the recurrence diameter, is sufficient for Fp properties and is a known over-approximation for the threshold of simple safety properties (Gp).
Efficient reduction of finite state model checking to reachability analysis
TLDR
This article extends the translation scheme to typical combinations of temporal operators and uses the notions of predicated diameter and radius to obtain revised bounds for its translation scheme, giving a tight bound on the minimal completeness bound for simple liveness properties.
...
...