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 …

In this paper we discuss efficient symbolic representations for infinite-state systems specified
using linear arithmetic constraints. We give algorithms for constructing finite automata which …

We show how the second-order monadic theory of strings can be used to specify hardware
components and their behavior. This logic admits a decision procedure and counter-model …

This dissertation is concerned with techniques for formally checking properties of systems
that are described by operational semantics. Roughly speaking, this means systems speci …

Recently there has been much interest in the automatic and semi-automatic verification of
parameterized networks, ie, verification of a family of systems, where each is a network …

This paper investigates implementations of process algebras which are suitable for
modeling concurrent real-time systems. It suggests an approach for efficiently implementing …

Abstract In [14], we proposed a framework for the automatic verification of reactive systems.
Our main tool is a decision procedure, Mona, for Monadic Second-order Logic (M2L) on …

We propose a practical framework for integrating the behavioral reasoning about distributed
systems with model-checking methods. Our proof methods are based on trace abstractions …

In general, the verification of parameterized networks is undecidable. In recent years there
has been a lot of research to identify subclasses of parameterized systems for which certain …

PVS is a state-of-the-art theorem-proving tool developed by SRI International. It is used in a
variety of academic and real-world applications by NASA and ICASE researchers, for whom …