State space reduction based on live variables analysis

Science of Computer Programming

Volumn 47, Issue 2-3, 2003, Pages 203-220

  Fernandez, Jean Claude ^a   Bozga, Marius ^b   Ghirvu, Lucian ^b  

^a ZIRST   (France)

^b VERIMAG   (France)

Author keywords

Asynchronous communication; Bisimulation; Live variables analysis; Model checking; State space reduction

Indexed keywords

COMPUTER SIMULATION; NETWORK PROTOCOLS; STATE SPACE METHODS;

LIVE VARIABLE ANALYSIS;

COMPUTER PROGRAMMING;

EID: 0037400693     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(02)00133-8     Document Type: Conference Paper

References (21)

1. Abdulla P., Annichini A., Bouajjani A. Symbolic verification of lossy channel systems. application to the bounded retransmission protocol Cleaveland R. Proc. TACAS'99, Amsterdam, The Netherlands. Lecture Notes in Computer Science. Vol. 1579:1999;208-222 Springer, Berlin.
2. Aho A., Sethi R., Ullman J. Compilers. Principles, Techniques and Tools:1986;Addison-Wesley, Readings, MA.
3. Bensalem S., Lakhnech Y., Owre S. Computing abstractions of infinite state systems compositionally and automatically. Hu A., Vardi M. Proc. CAV'98, Vancouver, Canada. Lecture Notes in Computer Science. Vol. 1427:1998;319-331 Springer, Berlin.
4. Boigelot B., Godefroid P. Symbolic verification of communication protocols with infinite state spaces using QDDs. Alur R., Henzinger T. Proc. CAV'96, New Brunswick, USA. Lecture Notes in Computer Science. Vol. 1102:1996;1-12 Springer, Berlin.
5. Bozga M., Fernandez J.-C., Ghirvu L. Using static analysis to improve automatic test generation. Graf S., Schwartzbach M. 6th Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. Vol. 1785:2000;235-250 Springer, Berlin, DE.
6. Bozga M., Fernandez J., Ghirvu L., Graf S., Krimm J., Mounier L. IF: An intermediate representation and validation environment for timed asynchronous systems. Wing J., Woodcock J., Davies J. Proc. FM'99, Toulouse, France. Lecture Notes in Computer Science. Vol. 1708:1999;307-327 Springer, Berlin.
7. Bozga M., Fernandez J., Ghirvu L., Jard C., Jéron T., Kerbrat A., Morel P., Mounier L. Verification and test generation for the SSCOP protocol. J. Sci. Comput. Programming (Special Isssue on Formal Methods in Industry). 36(1):2000;27-52.
8. C. Colby, P. Godefroid, L. Jagadeesan, Automatically closing open reactive systems, in: Proc. ACM SIGPLAN on Programming Language Design and Implementation, Montreal, Canada, 1998, pp. 345-357.
9. Daws C., Yovine S. Reducing the number of clock variables of timed automata. Proc. RTSS'96, Washington, DC, USA. 1996;IEEE Computer Society Press, SilverSpring, MD.
10. Fernandez J., Garavel H., Kerbrat A., Mateescu R., Mounier L., Sighireanu M. CADP. A protocol validation and verification toolbox Alur R., Henzinger T. Proc. CAV'96, New Brunswick, USA. Lecture Notes in Computer Science. Vol. 1102:1996;437-440 Springer, Berlin.
11. Fernandez J., Jard C., Jéron T., Mounier L. "On the Fly" verification of finite transition systems. Formal Methods in System Design. 1(2/3):1992;251-273.
12. Fernandez J., Kerbrat A., Mounier L. Symbolic equivalence checking. Courcoubetis C. Proc. CAV'93, Heraklion, Greece. Lecture Notes in Computer Science. Vol. 697:1993;85-96 Springer, Berlin.
13. Godefroid P. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State Explosion Problem. Lecture Notes in Computer Science. Vol. 1032:1996;Springer, Berlin. ISBN 3-540-60761-7.
14. Graf S., Jia G. Verification experiments on the Mascara protocol. Proc. SPIN'01 Workshop (Toronto, Canada). Lecture Notes in Computer Science. Vol. 2057:2001;Springer, Berlin.
15. Holzmann G.J. Design and Validation of Computer Protocols, Software Series. 1991;Prentice-Hall, Englewood Cliffs, NJ.
16. Kurshan R., Levin V., Minea M., Peled D., Yenigün H. Static partial order reduction. Steffen B. Proc. TACAS'98, Lisbon, Portugal. Lecture Notes in Computer Science. Vol. 1384:1998;345-357 Springer, Berlin.
17. McMillan K. Symbolic Model Checking: an Approach to the State Explosion Problem. 1993;Kluwer Academic Publisher, Dordrecht.
18. Milner R. A Calculus of Communication Systems. Lecture Notes in Computer Science. Vol. 92:1980;Springer, Berlin.
19. Muchnick S. Advanced Compiler Design Implementation. 1997;Morgan Kaufmann Publishers, Los Altos, CA.
20. Park D. Concurrency and automata on infinite sequences. Theoretical Computer Science. 104:1981;167-183.
21. Weiser M. Program slicing. IEEE Trans. Software Eng. SE-10(4):1984;352-357.