W. Visser. Memory efficient storage in SPIN. In 2nd International SPIN Workshop on Software Model Checking, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Model Checker SPIN - Holzmann (1997) (190 citations) (Correct)
.... requirements (10 to 20 percent) Static Huffman encoding was found to add a smaller, but still substantial run time overhead ( 300 percent) in return for a somewhat larger reduction of the memory requirements (60 to 70 percent) Greater compression typically implies greater run time penalties, cf. [79], 29] A different state compression technique was added to the standard distribution of the SPIN software in late 1995. It delivers comparable reductions of the memory requirements, but for a relatively small run time penalty (10 to 20 percent) The method works on the premise that every process ....
.... SPIN software, for instance, include extensions for real time verification [74] reactive systems modeling [54] bisimulation equivalence proofs [21] different types of partial order reduction [27] 76] process algebras [24] alternate state machine models [69] alternate compression techniques [79], 29] 28] 45] and implementation generation [5] 51] Applications of SPIN to real life problems also span a broad range of problems. The obvious applications are to prove correctness of generic distributed algorithms, such as the leader election algorithm illustrated in Fig. 1, nonstan3. ....
W. Visser, "Memory Efficient Storage in SPIN," Proc. Second SPIN Workshop, Rutgers Univ., New Brunswick, N.J., DIMACS/32, Am. Math. Soc., Aug. 1996.
A Minimized Automaton Representation of Reachable States - Holzmann, Puri (1997) (12 citations) (Correct)
....algorithm produces a new minimized DFA which accepts exactly the new set obtained from the deletion or the insertion operation. The expected cost of the insertion and deletion operations in our algorithm is O(kj Sigmaj) We will study the effect of using this method in Spin. Earlier, in Visser [10] an attempt was made to apply a standard BDD package 1 unmodified, to solve this problem. Similarly, Gregoire [3] experimented with a different data structure, called a sharing tree, or graph encoded set, to achieve a similar result. We will compare our results with theirs in Section 5. Storing ....
....k . In Section 3, we present our algorithms for insertion and deletion. In Section 4, we discuss the relationship of our work with the previous work on OBDDs. In Section 5, we discuss the application our work to the problem of state space exploration, and compare our results to those of [3] and [10]. 1 Available from Carnegie Mellon at emc.cs.cmu.edu (pub bdd bddlib.tar.Z) 2 k Layer Deterministic Finite Automata In this section we discuss the k layer deterministic finite automaton (DFA) which accepts a set S ae Sigma k of k tuples. Each layer in the automaton corresponds to a bit or ....
[Article contains additional citation context not shown here]
W. Visser. Memory efficient storage in Spin, Proc. Second Spin Workshop, Rutgers University, New Brunswick, New Jersey, August 1996, American Mathematical Society, DIMACS/32.
Directed Search for the Verification of Communication Protocols - Lafuente (2003) (Correct)
No context found.
W. Visser. Memory efficient storage in SPIN. In 2nd International SPIN Workshop on Software Model Checking, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC