The NCSU concurrency workbench
R Cleaveland, S Sims - … Verification: 8th International Conference, CAV'96 …, 1996 - Springer
Abstract The NCSU Concurrency Workbench is a tool for verifying finite-state systems. A key
feature is its flexibility; its modular design eases the task of adding new analyses and …
feature is its flexibility; its modular design eases the task of adding new analyses and …
The concurrency workbench
Abstract The Concurrency Workbench is an automated tool that caters for the analysis of
networks of finite-state processes expressed in Milner's Calculus of Communicating …
networks of finite-state processes expressed in Milner's Calculus of Communicating …
[PDF][PDF] A Semantics Based Verification Tool for Finite State Systems.
Abstract The Concurrency Workbench is an automated tool that caters for the analysis of
concurrent nite-state processes expressed in Milner's Calculus of Communicating Systems …
concurrent nite-state processes expressed in Milner's Calculus of Communicating Systems …
The concurrency workbench: A semantics-based tool for the verification of concurrent systems
The Concurrency Workbench is an automated tool for analyzing networks of finite-state
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …
A platform for combining deductive with algorithmic verification
A Pnueli, E Shahar - … Aided Verification: 8th International Conference, CAV' …, 1996 - Springer
We describe a computer-aided verification system which combines deductive with
algorithmic (model-checking) verification methods. The system, called tlv (for temporal …
algorithmic (model-checking) verification methods. The system, called tlv (for temporal …
Auto/autograph
V Roy, R Simone - … -Aided Verification: 2nd International Conference, CAV' …, 1991 - Springer
We describe the Auto and Autograph tools for verification and analysis of concurrent
systems in their more recent developments. Auto is dedicated to a philosophy of “verification …
systems in their more recent developments. Auto is dedicated to a philosophy of “verification …
An improvement in formal verification
GJ Holzmann, D Peled - … Description Techniques VII: Proceedings of the …, 1995 - Springer
Critical safety and liveness properties of a concurrent system can often be proven with the
help of a reachability analysis of a finite state model. This type of analysis is usually …
help of a reachability analysis of a finite state model. This type of analysis is usually …
Combining theorem proving and model checking through symbolic analysis
N Shankar - International Conference on Concurrency Theory, 2000 - Springer
Automated verification of concurrent systems is hindered by the fact that the state spaces are
either infinite or too large for model checking, and the case analysis usually defeats theorem …
either infinite or too large for model checking, and the case analysis usually defeats theorem …
Parallel state space construction for model-checking
H Garavel, R Mateescu, I Smarandache - … May 19–20, 2001 Proceedings 8, 2001 - Springer
The verification of concurrent finite-state systems by model-checking often requires to
generate (a large part of) the state space of the system under analysis. Because of the state …
generate (a large part of) the state space of the system under analysis. Because of the state …
Automatic datapath abstraction in hardware systems
R Hojati, RK Brayton - … Verification: 7th International Conference, CAV'95 …, 1995 - Springer
The biggest stumbling block to make formal verification widely acceptable is the state space
explosion problem. Abstraction is used to simplify a design so that the number of reachable …
explosion problem. Abstraction is used to simplify a design so that the number of reachable …