State Compression in SPIN: Recursive Indexing And Compression Training Runs (1997)
| Venue: | IN PROCEEDINGS OF THIRD INTERNATIONAL SPIN WORKSHOP |
| Citations: | 36 - 1 self |
BibTeX
@INPROCEEDINGS{Holzmann97statecompression,
author = {Gerard J. Holzmann},
title = {State Compression in SPIN: Recursive Indexing And Compression Training Runs},
booktitle = {IN PROCEEDINGS OF THIRD INTERNATIONAL SPIN WORKSHOP},
year = {1997},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable state-space of a system that is obtained through the formalization of a correctness requirement as an -automaton. This -automaton restricts the state-space to precisely the subset that may contain the counter-examples to the original correctness requirement, if they exist. This method of verification conforms to the method for automata-theoretic verification outlined in [VW86]. SPIN derives
Citations
| 1207 | Symbolic Model Checking - McMillan - 1993 |
| 1130 | The model checker SPIN - Holzmann - 1997 |
| 510 | P.: An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986 |
| 104 | An Improvement in Formal Verification - Holzmann, Peled - 1994 |
| 59 | On nested depth-first search - Holzmann, Peled, et al. - 1996 |
| 54 | Coverage Preserving Reduction Strategies for Reachabily Analysis - Holzmann, Godefroid, et al. - 1992 |
| 21 | A family of perfect hashing methods - Majewski, Wormald, et al. - 1996 |
| 15 | The art of computer programming. vol 1 - Knuth - 1997 |
| 3 | Memory efficient storage in SPIN - Visser - 1996 |
| 1 | egoire, ยด State space compression with GETSs - Gr - 1996 |
