Abstract—SPIN is an efficient verification system for models of distributed software systems. It has been used to detect design errors in applications ranging from high-level descriptions of distributed algorithms to detailed code for controlling telephone exchanges. This paper gives an overview

continuous change. HyTech is a symbolic model checker for linear hybrid automata, a subclass of hybrid automata that can be analyzed automatically by computing with polyhedral state sets. A key feature of HyTech is its ability to perform parametric analysis, i.e. to determine the values of design parameters

All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

In this paper a model checker for the Limola modelling language is presented, called the Limola Model Checker (LMC). In section 2 the model checker features that the LMC provides are enumerated. In section 3 the architecture and workings of the model checker are explained. In section 4 the design

Abstract. Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time prop-erties, a model checker produces a counterexample computation if the check fails. This computation acts as a \certicate " of failure, as it can be checked

Abstract. In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems. PRISM supports two probabilistic models: continuous-time Markov chains and Markov decision processes. Analysis is performed through model checking

The Maude LTL model checker supports on-the-y explicit-state model checking of concurrent systems expressed as rewrite theories with performance comparable to that of current tools of that kind, such as SPIN. This greatly expands the range of applications amenable to model checking analysis

We present the design, implementation and empirical evaluation of Bebop -- a symbolic model checker for boolean programs. Bebop represents control flow explicitly, and sets of states implicitly using BDDs. By harnessing the inherent modularity in procedural abstraction and exploiting the locality

The primary focus of formal methods is static analysis of specifications and code, but there is also a long tradition of exploiting formal methods for testing. This paper continues this tradition by exploring the role of model checkers in software testing. Model checkers were originally developed

Abstract. MCP is an explicit-state software model checker that supports the entire C++ programming language. In this paper, we describe its architecture and present some initial results. 1