Exploiting transition locality in automatic verification of finite-state concurrent systems

International Journal on Software Tools for Technology Transfer

Volumn 6, Issue 4, 2004, Pages 320-341

  Della Penna, Giuseppe ^a   Intrigila, Benedetto ^a   Melatti, Igor ^a   Tronci, Enrico ^b   Venturini Zilli, Marisa ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Automatic verification; Explicit state space exploration; Model checking

Indexed keywords

AUTOMATIC VERIFICATION; EXPLICIT STATE SPACE EXPLORATIONS; FINITE-STATE CONCURRENT SYSTEM; STATE SPACE EXPLORATION; STATE TRANSITIONS; STATISTICAL PROPERTIES; TRANSITION GRAPHS; VERIFICATION ALGORITHMS;

ALGORITHMS; COMPACTION; MODEL CHECKING; RANDOM ACCESS STORAGE; SPACE RESEARCH;

CACHE MEMORY;

EID: 84896694205     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s10009-004-0149-6     Document Type: Article

References (43)

1. A user guide to hytech: http://www. eecs. berkeley. edu/~tah/HyTech.
2. Alur R, Henzinger TA, Ho PH (1996) Automatic symbolic verification of embedded systems. IEEE Trans Softw Eng 22: 2-11.
3. Bryant R (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans Comput C-35(8): 677-691.
4. 20 states and beyond. Inf Comput 98(2): 142-170.
5. Cached murphi Web page: http://www. dsi. uniroma1. it/~tronci/cached. murphi. html.
6. Chernikova NV (1968) Algorithm for discovering the set of all solutions of a linear programming problem. USSR Comput Math Math Phys 8(6): 282-293.
7. Dill DL, Drexler AJ, Hu AJ, Yang CH (1992) Protocol verification as a hardware design aid. In: Proceedings of the IEEE international conference on computer design: VLSI in computers and processors, pp 522-525.
8. Godefroid P, Holzmann GJ, Pirottin D (1992) State space caching revisited. In: Bochmann GV, Probst D (eds) Proceedings of the 4th international workshop on computer aided verification (CAV), Montreal. Lecture notes in computer science, vol 663. Springer, Berlin Heidelberg New York, pp 178-191.
9. Halbwachs N (1993) Delay analysis in synchronous programs. In: Courcoubetis C (ed) Proceedings of Computer Aided Verification (CAV). Lecture notes in computer science, vol 697. Springer, Berlin Heidelberg New York, pp 333-346.
10. Halbwachs N, Raymond P, Proy Y-E (1994) Verification of linear hybrid systems by means of convex approximation. In: LeCharlier B (ed) Proceedings of the symposium on static analysis (SAS). Lecture notes in computer science, vol 864. Springer, Berlin Heidelberg New York, pp 223-237.
11. Henzinger TA, Ho P-H, Wong-Toi H (1995) Hytech: the next generation. In: Proceedings of the 16th annual IEEE real-time systems symposium (RTSS). IEEE, New York, pp 56-65.
12. Henzinger TA, Ho P-H, Wong-Toi H (1997) Hytech: a model checker for hybrid systems. Int J Softw Tools Technol Transfer 1: 110-122.
13. Holzmann GJ (1985) Tracing protocols. AT&T Tech J 64(10): 2413-2433.
14. Holzmann GJ (1987) Automated protocol validation in argos, assertion proving and scatter searching. IEEE Trans Softw Eng 13(6): 683-697.
15. Holzmann GJ (1997) The spin model checker. IEEE Trans Softw Eng 23(5): 279-295.
16. Holzmann GJ (1998) An analysis of bitstate hashing. Formal Methods Sys Des 13(3): 289-307.
17. Holzmann GJ, Peled D (1995) An improvement in formal verification. In: Proceedings of the FORTE conference, Proceedings of IFIP. Chapman & Hall, London, 6: 197-211.
18. Hu AJ, York G, Dill DL (1994) New techniques for efficient verification with implicitily conjoined bdds. In: Proceedings of the 31st IEEE conference on design automation, pp 276-282.
19. Ip CN, Dill DL (1993) Better verification through symmetry. In: Agnew D, Claesen L, Camposano R (eds) Proceedings of the 11th international conference on: computer hardware description languages and their applications. Elsevier, Amsterdam, pp 97-111.
20. Ip CN, Dill DL (1993) Efficient verification of symmetric concurrent systems. In: Proceedings of the IEEE international conference on computer design: VLSI in computers and processors, pp 230-234.
21. Larsen KG, Pettersson P, Yi W (1997) Uppaal: Status and developments. In: Grumberg O (ed) Proceedings of CAV97, June 1997. Lecture notes in computer science, vol 1254. Springer, Berlin Heidelberg New York, pp 456-459.
22. Liaw H-T, Lin C-S (1992) On the obdd-representation of general boolean functions. IEEE Trans Comput C-41(6): 661-664.
23. Murphi Web page: http://sprout. stanford. edu/dill/murphi. html.
24. Papoulis A (1965) Probability, random variables and stochastic processes. McGraw-Hill Series in System Sciences.
25. Patterson DA, Hennessy JL (1996) Computer architecture: a quantitative approach. Morgan Kaufmann, San Francisco.
26. Della Penna G, Intrigila B, Melatti I, Minichino M, Ciancamerla E, Parisse A, Tronci E, Zilli MV (2003) Automatic verification of a turbogas control system with the murφ{symbol} verifier. In: Pnueli A, Maler O (eds) Proceedings of the 6th international workshop Hybrid Systems: Computation and Control (HSCC), Prague, Czech Republic, April 2003. Lecture notes in computer science, vol 2623. Springer, Berlin Heidelberg New York, pp 141-155.
27. Della Penna G, Intrigila B, Tronci E, Venturini Zilli M (2002) Exploiting transition locality in the disk based murφ{symbol} verifier. In: Aagaard MD, O'Leary JW (eds) Proceedings of the 4th international conference on formal methods in computer aided design (FMCAD), Portland, OR, November 2002. Lecture notes in computer science, vol 2517. Springer, Berlin Heidelberg New York, pp 202-219.
28. Puri A, Holzmann GJ (2000) A minimized automaton representation of reachable states. Int J Softw Tools Technol Transfer 2(3): 270-278.
29. Ranjan RK, Sanghavi JV, Brayton RK, Sangiovanni-Vincentelli A (1996) Binary decision diagrams on network of workstations. In: Proceedings of the IEEE international conference on computer design, pp 358-364.
30. Sanghavi JV, Ranjan RK, Brayton RK, Sangiovanni-Vincentelli A (1996) High performance bdd package by exploiting memory hierarchy. In: Proceedings of the 33rd IEEE conference on design automation, pp 635-640.
31. Smv Web page: http://www. cs. cmu. edu/~modelcheck/.
32. Spin Web page: http://spinroot. com.
33. Stern U, Dill D (1997) Parallelizing the murφ{symbol} verifier. In: Grumberg O (ed) Proceedings of the 9th international conference on computer aided verification, Haifa, Israel. Lecture notes in computer science, vol 1254. Springer, Berlin Heidelberg New York, pp 256-267.
34. Stern U, Dill D (1998) Using magnetic disk instead of main memory in the murφ{symbol} verifier. In: Hu AJ, Vardi MY (eds) Proceedings of the 10th international conference on computer aided verification, Vancouver, BC, Canada. Lecture notes in computer science, vol 1427. Springer, Berlin Heidelberg New York, pp 172-183.
35. Stern U, Dill DL (1995) Improved probabilistic verification by hash compaction. In: Camurati P, Eveking H (eds) Proceedings of the IFIP WG 10. 5 advanced research working conference on correct hardware design and verification methods (CHARME). Lecture notes in computer science, vol 987. Springer, Berlin Heidelberg New York, pp 206-224.
36. Stern U, Dill DL (1996) A new scheme for memory-efficient probabilistic verification. In: Gotzhein R, Bredereke J (eds) Proceedings of the IFIP TC6/WG6. 1 joint international conference on formal description techniques for distributed systems and communication protocols, and Protocol specification, testing, and verification, Proceedings of IFIP, vol 69. Kluwer, Dordrecht, pp 333-348.
37. Steven Ulrich web page: http://verify. stanford. edu/uli/research. html.
38. Stornetta T, Brewer F (1996) Implementation of an efficient parallel bdd package. In: Proceedings of the 33rd annual conference on design automation. ACM Press, New York, pp 641-644.
39. Tronci E, Della Penna G, Intrigila B, Venturini Zilli M (2001) Exploiting transition locality in automatic verification. In: Margaria T, Melham T (eds) Proceedings of the IFIP WG 10. 5 advanced research working conference on correct hardware design and verification methods (CHARME), September 2001. Lecture notes in computer science, vol 2144. Springer, Berlin Heidelberg New York, pp 259-274.
40. Tronci E, Della Penna G, Intrigila B, Venturini Zilli M (2001) A probabilistic approach to space-time trading in automatic verification of concurrent systems. In: Proceedings of the 8th IEEE Asia-Pacific conference on software engineering (APSEC), Macau SAR, China, December 2001. IEEE Press, New York, pp 317-324.
41. Uppaal web page: http://www. docs. uu. se/docs/rtmv/uppaal/.
42. Wolper P, Leroy D (1993) Reliable hashing without collision detection. In: Courcoubetis C (ed) Proceedings of the 5th international conference on computer aided verification, Elounda, Greece. Lecture notes in computer science, vol 697. Springer, Berlin Heidelberg New York, pp 59-70.
43. German S, private communication.