We survey principles of model checking techniques for the automatic analysis of reactive
systems. The use of model checking is exemplified by an analysis of the Needham …

We propose abstract regular model checking as a new generic technique for verification of
parametric and infinite-state systems. The technique combines the two approaches of …

It has been known since 1960 that the class of regular languages1 is linked to decidability
questions in formal logics. In particular, WS1S (Weak monadic Second-order theory of 1 …

We describe formal verification of some of the key algorithms in the Time-Triggered
Architecture (TTA) for real-time safety-critical control applications. Some of these algorithms …

Many aspects of computer systems are naturally modeled as parameterized systems which
renders their automatic verification difficult. In well-known examples such as cache …

The MONA tool provides an implementation of automaton-based decision procedures for the
logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably …

The linear temporal logic (LTL) was introduced by Pnueli as a logic to express properties
over the computations of reactive systems. Since this seminal work, there have been a large …

Structural Invariants for the Verification of Systems with Parameterized Architectures Page 1
Structural Invariants for the Verification of Systems with Parameterized Architectures Marius …

The Mona tool provides an implementation of the decision procedures for the logics WS1S
and WS2S. It has been used for numerous applications, and it is remarkably efficient in …

We present a methodology for constructing abstractions and refining them by analyzing
counter-examples. We also present a uniform verification method that combines abstraction …