Willem Visser, Howard Barringer  Home/Search
Context Related
| nasa.gov/visser/otfbdd.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nasa.gov/visser/ (more) Homepages: W.Visser |
Rate this article:      (best)Comment on this article |
Abstract: The use of an Ordered Binary Decision Diagram (OBDD) to store all visited states during on-the-fly model checking (or reachability analysis) is investigated. To improve the time and space efficiency a state compression technique is introduced. This compression technique is safe, in the sense that no two unique states will have the same compressed representation. A number of examples are used to evaluate an experimental implementation of the OBDD state store within the SPIN validation tool. In... (Update)
Context of citations to this paper: More
...in compacted form. Various state compaction techniques have been investigated, but all increase the execution time significantly [3, 5, 7]. In this paper we describe a state representation technique that is simple to implement. It does not only reduce the memory...
.... with verification of protocols in SPIN has strongly justified the usage of partial order methods although some experiments, e.g. [103] suggests that partial order methods may be further improved using a BDD representation. Nevertheless, there is something fascinating...
Cited by: More
Nested Emptiness Search for Generalized Büchi Automata - Tauriainen (2003) (Correct)
State Space Compression in SPIN with GETSs - Gregoire (1996) (Correct)
State Space Methods for Coloured Petri Nets - Kristensen (2000) (Correct)
Similar documents (at the sentence level):
67.3%: Memory Efficient State Storage in SPIN - Visser (1996) (Correct)
53.8%: Using OBDD encodings for Space Efficient State Storage during.. - Visser (1995) (Correct)
Active bibliography (related documents): More All
0.5: A Run-time Environment for a Validation Language - Visser (1993) (Correct)
0.3: Fast and Accurate Bitstate Verification for SPIN - Dillinger, Manolios (2004) (Correct)
0.2: Efficiency Issues in the Design of a Model Checker - Geldenhuys (1999) (Correct)
Similar documents based on text: More All
0.3: Practical CTL Model Checking - Should SPIN be Extended? - Visser, Barringer (2000) (Correct)
0.3: CTL* Model Checking for SPIN - Visser, Barringer (1999) (Correct)
0.2: Adding Active Objects to SPIN - First Steps Towards.. - Visser, Havelund, Penix (Correct)
Related documents from co-citation: More All
3: Prentice Hall Software Series (context) - Holzmann, Validation et al. - 1992
2: State Space Compression in SPIN with GETSs (context) - Gr'egoire - 1996
2: An improvement in formal verification - Holzmann, Peled - 1994
BibTeX entry: (Update)
Visser (W.). -- Memory efficient state storage in spin. In : Proceedings of the 1995 SPIN Workshop. -- URL: http://netlib.att.com/netlib/spin/ws95/spin95 abstracts.html. http://citeseer.ist.psu.edu/692675.html More
@inproceedings{ visser-95memory,
author = "W. Visser and H. Barringer",
title = "Memory efficient state storage in spin",
booktitle = "Proceedings of the 1995 SPIN Workshop",
year = "1995",
url = "citeseer.ist.psu.edu/692675.html" }
Citations (may not include all citations):1726 Graph-based Algorithms for Boolean Function Manipulation - Bryant - 1986
1097 Automatic Verification of Finite State Concurrent Systems Us.. (context) - Clarke, Emerson et al. - 1983
1097 Automatic Verification of Finite-State Concurrent Systems Us.. (context) - Clarke, Emerson et al. - 1986
510 Symbolic Boolean Manipulation with Ordered Binary-Decision D.. - Bryant - 1992
470 Design and Validation of Computer Protocols (context) - Holzmann - 1991
434 An Automata Theoretic Approach to Automatic Program Verifica.. (context) - Vardi, Wolper - 1986
297 Symbolic Model Checking (context) - McMillan - 1992
207 A Stubborn Attack on State Explosion (context) - Valmari - 1990
132 Using Partial Orders for the Efficient Verification of Deadl.. (context) - Godefroidand, Wolper - 1993
127 An Automata-Theoretic Approach to branching-TimeModel Checki.. - Bernholtz, Vardi et al. - 1994
108 Combining Partial Order Reductions with On-the-fly Model Che.. (context) - Peled - 1994
108 An Improvement in Formal Verification - Holzmann, Peled - 1994
50 State Space Caching Revisited - Godefroid, Holzmann et al. - 1995
45 Reliable Hashing without Collision Detection - Wolper, Leroy - 1993
39 An Improved Protocol Reachability Analysis Technique - Holzmann - 1988
20 An Analysis of Bitstate Hashing - Holzmann - 1995
19 Efficient On-the-fly Model Checking for CTL - Bhat, Cleaveland et al. - 1990
7 State Space Compression in SPIN with GETSs - Gregoire - 1996
5 A Run-Time Environment for a Validation Language - Visser - 1993
4 Improved Probilistic Verification by Hash Compaction (context) - Stern, Dill - 1995
2 A Reusable Kernel for the Development of Control Software (context) - Fouch'e, de Villiers - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://ase.arc.nasa.gov/visser/): More
Practical CTL Model Checking - Should SPIN be Extended? - Visser, Barringer (2000) (Correct)
A Run-time Environment for a Validation Language - Visser (1993) (Correct)
Efficient CTL* Model Checking for Analysis of Rainbow.. - Visser, Barringer.. (Correct)
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