Abstract Model checking is an automatic verification technique for hardware and software
systems that are finite state or have finite state abstractions. It has been used successfully to …

We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL).
We present several efficient encodings that have size linear in the bound. Furthermore, we …

NUSMV is a symbolic model checker originated from the reengineering, reimplementation
and extension of CMU SMV, the original BDD-based model checker developed at CMU …

In automata-theoretic model checking we compose the design under verification with a
Büchi automaton that accepts traces violating the specification. We then use graph …

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 …

Shorter counterexamples are typically easier to understand. The length of a
counterexample, as reported by a model checker, depends on both the algorithm used for …

LTL+ Past is the extension of Linear Temporal Logic (LTL) supporting past temporal
operators. The addition of the past does not add expressive power, but does increase the …

Linear Temporal Logic (LTL) has been used in computer science for decades to formally
specify programs, systems, desired properties, and relevant behaviors. This paper presents …

Model checking techniques have traditionally dealt with temporal logic languages and
automata interpreted over ω-words, ie, infinite in the future but finite in the past. However …

Counterexamples produced by model checkers can be hard to grasp. Often it is not even
evident why a trace violates a specification. We show how to provide easy-to-check …