Linear Encodings of Bounded LTL Model Checking

@article{Biere2006LinearEO,
  title={Linear Encodings of Bounded LTL Model Checking},
  author={Armin Biere and Keijo Heljanko and Tommi A. Junttila and Timo Latvala and Viktor Schuppan},
  journal={ArXiv},
  year={2006},
  volume={abs/cs/0611029}
}
We consider the problem of bounded model checking (BMC) for linear tempo- ral logic (LTL). We present several efficient encodings that have size linear in the bound. Furthermore, we show how the encodings can be extended to LTL with past operators (PLTL). The generalised encoding is still of linear size, but cannot detect minimal length counterexamples. By using the virtual unrolling technique minimal length counterexam- ples can be captured, however, the size of the encoding is quadratic in… 

Figures and Tables from this paper

Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
TLDR
An encoding of LTL bounded model checking problems within the Bernays-Schonfinkel fragment of first-order logic allows a natural and succinct representation of both a software/hardware system and the property that one wants to verify.
Counterexample-Preserving Reduction for Symbolic Model Checking
TLDR
This paper observes that, under some specific conditions, the input LTL formula can be reduced to an easier-to-handle one before model checking, and tentatively name such technique “Counterexample-Preserving Reduction” (CePRe, for short), and the proposed technique is experimentally evaluated by adapting NuSMV.
Model Checking LTL Properties over C Programs with Bounded Traces
TLDR
This paper describes and experiment with an approach to extend context-bounded software model checking to safety and liveness properties expressed in linear-time temporal logic (LTL), and uses an extended, four-valued LTL semantics to handle the finite traces that bounded model checking explores.
Tarmo: A Framework for Parallelized Bounded Model Checking
TLDR
This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations with a generic framework for parallelized BMC named Tarmo, which allows for both safety and liveness properties to be checked.
Combining Syntactic and Semantic Encoding for LTL Bounded Model Checking
TLDR
A new BMC encoding approach specially tailored for LTL model checking is presented, finding that syntactic encoding and semantic encoding respectively have the superiority in dealing with "next" operator and "until" operator in the specification.
How bit-vector logic can help improve the verification of LTL specifications over infinite domains
TLDR
A previously-introduced bounded decision procedure for LTL based on Bit-Vector Logic is adapted to deal with the infinite domains that are typical of CLTL and CLTLoc, and it is shown how the latter outperforms the former in the vast majority of cases.
Model checking LTL properties over ANSI-C programs with bounded traces
TLDR
This paper describes and experiment with an approach to extend context-bounded software model checking to safety and liveness properties expressed in linear-time temporal logic (LTL), and uses an extended, four-valued LTL semantics to handle the finite traces that bounded model checking explores.
Context-Bounded Model Checking of LTL Properties for ANSI-C Software
TLDR
An approach to extend context-bounded model checking to liveness properties expressed in linear-time temporal logic (LTL), which converts the LTL formulae into Buchi-automata and then further into C monitor threads, which are interleaved with the execution of the program under test.
Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic ( Extended Version )
TLDR
This paper presents the first study on bounded model checking RLTL specifications by providing two semantic translations from RLTL into SAT: one based on non-deterministic Büchi automata, and a more efficient onebased on alternating hesitant automaton, in both cases with a symbolic transition representation.
Bounded Model Checking of an MITL Fragment for Timed Automata
TLDR
This paper extends the semantics of a fragment of MITL to super-dense time traces and devise a bounded model checking encoding for the fragment and proves correctness and completeness in the sense that using a sufficiently large bound a counter-example to any given non-holding property can be found.
...
...

References

SHOWING 1-10 OF 99 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.
Termination Criteria for Bounded Model Checking: Extensions and Comparison
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.
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
TLDR
It is proved that Buchi automata constructed using the approach of Clarke, Grumberg, and Hamaguchi accept shortest counterexamples of future time LTL formulae, while an automaton generated with the algorithm of Gerth et al. (GPVW) may lead to unnecessary long countereXamples.
Improving the Encoding of LTL Model Checking into SAT
TLDR
This paper tackles the problem of improving BMC encodings for the full class of LTL properties by noticing some properties of the encoding of [2], and exploiting them to define improvements that make the resulting boolean formulas smaller or simpler to solve.
Incremental and Complete Bounded Model Checking for Full PLTL
TLDR
This work presents an incremental and complete bounded model checking method for the full linear temporal logic with past (PLTL), which both improves and extends current results in many ways.
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.
From PSL to NBA: a Modular Symbolic Encoding
TLDR
A modular encoding of PSL into symbolically represented NBA is proposed, which drastically reduces the construction time of the symbolic NBA, and positively affects the overall verification time.
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
TLDR
The general conditions for reusability of constraints, and a simple procedure for evaluating them are defined, and it is shown how a similar procedure can be used for restricting the search space of individual SAT instances corresponding to BMC invariant formulas.
...
...