Runtime efficient state compaction in SPIN

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1680, Issue , 1999, Pages 12-21

  Geldenhuys, J ^a   de Villiers, P J A ^a  

^a STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPACT REPRESENTATION; MEMORY REQUIREMENTS; NORMAL MODES; RUNTIMES; STATE REPRESENTATION;

MODEL CHECKING;

EID: 84948142102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48234-2_2     Document Type: Conference Paper

References (7)

1. E. M. Clarke and J. M. Wing. Formal methods: state of the art and future directions. ACM Computing Surveys, 28(4):626-643, December 1996.
2. P. J. A. de Villiers and W. C. Visser. ESML-a validation language for concurrent systems. South African Computer Journal, 7:59-64, July 1992.
3. J.-Ch. Grégoire. State space compression in SPIN with GETSs. In Proceedings of the 2nd SPIN Workshop, 1996.
4. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall Software Series, 1991.
5. G. J. Holzmann. State compression in SPIN: recursive indexing and compression training runs. In Proceedings of the 3rd SPIN Workshop, 1997.
6. J. Rushby. Mechanized formal methods: progress and prospects. In Proceedings of the 16th Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science #1180, pages 43-51. Springer-Verlag, December 1996.
7. W. C. Visser. Memory efficient state storage in SPIN. In Proceedings of the 2nd SPIN Workshop, 1996.