Memory efficient state space storage in explicit software model checking

Lecture Notes in Computer Science

Volumn 3639, Issue , 2005, Pages 43-57

  Evangelista, Sami ^a   Pradat Peyre, Jean François ^a  

^a CEDRIC CNAM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SOFTWARE; MATHEMATICAL MODELS; SOFTWARE ENGINEERING; STORAGE ALLOCATION (COMPUTER);

COMPUTING TIME; MEMORY REDUCTION RATIO; MODEL CHECKING; STATES ENUMERATION;

STATE SPACE METHODS;

EID: 26944443447     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537328_7     Document Type: Conference Paper

References (24)

1. Visser W. Memory efficient state storage in spin. In SPIN'1996, pages 21-35.
2. Holzmann G.J. State compression in spin: Recursive indexing and compression training runs. In SPIN'1997.
3. Geldenhuys J. and Valmari A. A nearly memory-optimal data structure for sets and mappings. In Thomas Ball and Sriram K. Rajamani, editors, SPIN'2003, volume 2648 of LNCS, pages 136-150. Springer.
4. Grègoire J.C. State space compression in spin with getss. In SPIN'1996, pages 90-108.
5. Parreaux B. Difference compression in spin. In SPIN'1998.
6. Geldenhuys J. and de Villiers P.J.A. Runtime efficient state compaction in spin. In Dennis Dams, Rob Gerth, Stefan Leue, and Mieke Massink, editors, SPIN'1999, volume 1680 of LNCS, pages 12-21. Springer.
7. Pastor E. and Cortadella J. Efficient encoding schemes for symbolic analysis of petri nets. In Conference on Design, Automation and Test, pages 790-795. IEEE Computer Society, 1998.
8. Schmidt K. Using petri net invariants in state space construction. In Hubert Garavel and John Hatcliff, editors, TACAS'2003, volume 2619 of LNCS, pages 473-488. Springer.
9. Godefroid P., Holzmann G.J., and Pirottin D. State-space caching revisited. In Gregor von Bochmann and David K. Probst, editors, CAV'1992, volume 663 of LNCS, pages 178-191. Springer.
10. Geldenhuys J. State caching reconsidered. In Susanne Graf and Laurent Mounier, editors, SPIN'2004, volume 2989 of LNCS, pages 23-38. Springer.
11. Parashkevov A.N. and Yantchev J. Space efficient reachability analysis through use of pseudo-root states. In Ed Brinksma, editor, TACAS'1997, volume 1217 of LNCS, pages 50-64. Springer.
12. Christensen S., Kristensen L.M., and Mailund T. A sweep-line method for state space exploration. In Tiziana Margaria and Wang Yi, editors, TACAS'2001, volume 2031 of LNCS, pages 450-464. Springer.
13. Mailund T. and Westergaard M. Obtaining memory-efficient reachability graph representations using the sweep-line method. In Kurt Jensen and Andreas Podelski, editors, TACAS'2004, volume 2988 of LNCS, pages 177-191. Springer.
14. Schmidt K. Automated generation of a progress measure for the sweep-line method. In Kurt Jensen and Andreas Podelski, editors, TACAS'2004, volume 2988 of LNCS, pages 192-204. Springer.
15. Behrmann G., Larsen K.G., and Pelánek R. To store or not to store. In Warren A. Hunt Jr. and Fabio Somenzi, editors, CAV'2003, volume 2725 of LNCS, pages 433-445. Springer.
16. Godefroid P. Model checking for programming languages using verisoft. In POPL'1997, pages 174-186.
17. Holzmann G.J. Design and validation of computer protocols. Prentice Hall, 1991.
18. Leroy D. and Wolper P. Reliable hashing without collision detection. In Costas Courcoubetis, editor, CAV'1993, volume 697 of LNCS, pages 59-70. Springer.
19. Jensen K. Coloured petri nets: A high level language for system design and analysis. In Grzegorz Rozenberg, editor, ATPN'1989, volume 483 of LNCS, pages 342-416. Springer.
20. Dwyer M.B., Hatcliff J., Iosif R., and Robby. Space-reduction strategies for model checking dynamic software. Electronic Notes in Theoretical Computer Science, 89(3), 2003.
21. Lerda F. and Visser W. Addressing dynamic issues of program model checking. In Dragan Bosnacki and Stefan Leue, editors, SPIN'2001, volume 2057 of LNCS, pages 80-102. Springer.
22. Gerard J. Holzmann. The model checker spin. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
23. Evangelista S. High level petri nets analysis with helena. In Gianfranco Ciardo and Philippe Darondeau, editors, ATPN'2005, volume 3536 of LNCS, pages 455-464. Springer.
24. Evangelista S., Kaiser C., Pradat-Peyre J.F., and Rousseau P. Quasar: a new tool for analyzing concurrent programs. In Jean-Pierre Rosen and Alfred Strohmeier, editors, Ada-Europe'2003, volume 2655 of LNCS, pages 168-181. Springer.