Results 1 
4 of
4
State Compression in SPIN: Recursive Indexing And Compression Training Runs
 IN PROCEEDINGS OF THIRD INTERNATIONAL SPIN WORKSHOP
, 1997
"... The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable statespace of a system that is obtained through the formalization of a correctness requirement as an automaton. This automaton restricts the statespace to precisely the subset that may contain ..."
Abstract

Cited by 42 (1 self)
 Add to MetaCart
The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable statespace of a system that is obtained through the formalization of a correctness requirement as an automaton. This automaton restricts the statespace to precisely the subset that may contain the counterexamples to the original correctness requirement, if they exist. This method of verification conforms to the method for automatatheoretic verification outlined in [VW86]. SPIN derives
A Minimized Automaton Representation of Reachable States
 Software Tools for Technology Transfer
, 1999
"... We consider the problem of storing a set S ae \Sigma as a deterministic finite automaton (DFA). Weshow that inserting a new string oe 2 \Sigma or deleting a string from the set S represented as a minimized DFA can be done in expected time O(kj\Sigmaj), while preserving the minimality of ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
We consider the problem of storing a set S ae \Sigma as a deterministic finite automaton (DFA). Weshow that inserting a new string oe 2 \Sigma or deleting a string from the set S represented as a minimized DFA can be done in expected time O(kj\Sigmaj), while preserving the minimality of the DFA. We then discuss an application of this work to reduce the memory requirements of a model checker based on explicit state enumeration.
Directed Search for the Verification of Communication Protocols
, 2003
"... There is a need for formal methods to verify correctness of software and hardware systems. Automated verification techniques basically explore the state space of a system in order to establish whether or not it behaves correctly. The main drawback of such methods is the state explosion problem. The ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
There is a need for formal methods to verify correctness of software and hardware systems. Automated verification techniques basically explore the state space of a system in order to establish whether or not it behaves correctly. The main drawback of such methods is the state explosion problem. The size of the state space can grow exponentially in the number of components of the system, especially in asynchronous concurrent systems. In early stages of system development, errors are likely to appear. As a matter of fact, in practice, automated verification has been shown to be more successful in finding errors in systems than in proving correctness. Usually, one applies reachability algorithms like depthfirst, and breadthfirst search for this purpose. Breadthfirst search is, in general, not memoryefficient, but offers shortest counterexamples. On the other hand, depthfirst search is more memoryefficient, but delivers suboptimal counterexamples. We propose and analyze the use of...
State Compression in SPIN:
 In Proceedings of Third International SPIN Workshop
, 1997
"... The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable statespace of a system that is obtained through the formalization of a correctness requirement as an automaton. This automaton restricts the statespace to precisely the subset that may contain ..."
Abstract
 Add to MetaCart
The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable statespace of a system that is obtained through the formalization of a correctness requirement as an automaton. This automaton restricts the statespace to precisely the subset that may contain the counterexamples to the original correctness requirement, if they exist. This method of verification conforms to the method for automatatheoretic verification outlined in [VW86].