Verification of communication protocols using abstract interpretation of FIFO queues

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

Volumn 4019 LNCS, Issue , 2006, Pages 204-219

  Le Gall, Tristan ^a   Jeannet, Bertrand ^a   Jéron, Thierry ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; FORMAL LANGUAGES; SEQUENTIAL MACHINES;

ABSTRACT INTERPRETATION; ATTRIBUTE-DEPENDENT ANALYSIS; COMMUNICATING FINITE STATE MACHINES (CFSM);

NETWORK PROTOCOLS;

EID: 33746037222     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11784180_17     Document Type: Conference Paper

References (34)

1. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30 (1983) 323-342
2. Bochmann, G.V.: Finite state description of communication protocols. IEEE Computer Society Press, Los Alamitos, CA, USA (1995)
3. Turner, K.J.: Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL. John Wiley & Sons, Inc., New York, NY, USA (1993)
4. Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part 1. Theoretical Computer Science 18 (1981)
5. ITU-TS: ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). (1999)
6. th SDL Forum. (1997)
7. Cécé, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Information and Computation 124 (1996) 20-31
8. Abdulla, P., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy FIFO channels. In: Computer Aided Verification (CAV '98). Volume 1427 of LNCS. (1998)
9. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast Acceleration of Symbolic Transition systems. In: Computer Aided Verification (CAV'03). Volume 2725 of LNCS. (2003)
10. Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The power of QDDs. In: Static Analysis Symposium (SAS'97). Volume 1302 of LNCS. (1997)
11. Finkel, A., Iyer, S.P., Sutre, G.: Well-abstracted transition systems: application to FIFO automata. Information and Computation 181 (2003) 1-31
12. Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. FMSD 14 (1997) 237-255
13. Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theor. Comp. Science 221 (1999)
14. Abdulla, P., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: CONCUR'04. Volume 3170 of LNCS. (2004)
15. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Computer Aided Verification (CAV'00). Volume 1855 of LNCS. (2000)
16. Boigelot, B., Legay, A., Wolper, P.: Iterating transducers in the large. In: Computer Aided Verification (CAV'03). Volume 2725 of LNCS. (2003)
17. Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: Computer Aided Verification (CAV'04). Volume 3114 of LNCS. (2004)
18. Memmi, G., Finkel, A.: An introduction to FIFO nets-monogeneous nets: a subclass of FIFO nets. Theoretical Computer Science 31 (1985)
19. Finkel, A., Rosier, L.: A survey on the decidability questions for classes of FIFO nets. In: Eur. Workshop on Applications and Theory of Petri Nets. Volume 340 of LNCS. (1987)
20. Cécé, G., Finkel, A.: Verification of programs with half-duplex communication. Information and Computation 202 (2005)
21. Abdulla, P., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127 (1996)
22. Abdulla, P., Bertrand, N., Rabinovich, A., Schnoebelen, P.: Verification of probabilistic systems with faulty communication. Inf. and Comp. 202 (2005)
23. Peng, W., Puroshothaman, S.: Data flow analysis of communicating finite state machines. ACM Trans. Program. Lang. Syst. 13 (1991) 399-442
24. Lesens, D., Halbwachs, N., Raymond, P.: Automatic verification of parameterized linear networks of processes. In: Principles of Programming Languages (POPL'97), ACM Press (1997)
25. Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Journal of Logic Programming 13 (1992)
26. Brzozowski, J.A.: Derivatives of regular expressions. Journal of the ACM 1 (1964)
27. Feret, J.: Abstract interpretation-based static analysis of mobile ambients. In: Static Analysis Symposium (SAS'01). Volume 2126 of LNCS. (2001)
28. Jeannet, B., Jeron, T., Le Gall, T.: Abstracting interpretation of FIFO channels. Technical Report 5784, INRIA (2005)
29. Jones, N., Muchnick, S.: Complexity of flow analysis, inductive assertion synthesis, and a language due to Dijkstra. In Jones, N., Muchnick, S., eds.: Program Flow Analysis: Theory and Applications. Prentice-Hall (1981)
30. Wolper, P., Boigelot, B.: An automata-theoretic approach to Presburger arithmetic constraints. In: Static Analysis Symposium (SAS'95). Volume 983 of LNCS. (1995)
31. Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Int. Conf. on Formal Methods in Progr. and their Applications. Volume 735 of LNCS. (1993)
32. Abdulla, P.A., Annichini, A., Bouajjani, A.: Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In: Tools and Algorithms for Construction and Analysis of Systems (TACAS'99). (1999)
33. Su, Z., Wagner, D.: A class of polynomially solvable range constraints for interval analysis without widenings and narrowings. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04). Volume 2988. (2004)
34. Jeannet, B., Halbwachs, N., Raymond, P.: Dynamic partitioning in analyses of numerical properties. In: Static Analysis Symposium, SAS'99. Volume 1694 of LNCS. (1999)