Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol

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

Volumn 1579, Issue , 1999, Pages 208-222

  Abdulla, Parosh ^a   Annichini, Aurore ^b   Bouajjani, Ahmed ^b  

^a Dept of Computer Systems ^*  (Sweden)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ACCELERATION TECHNIQUE; ALGORITHMIC APPROACH; AUTOMATIC VERIFICATION; INFINITE STATE SYSTEMS; ITERATIVE COMPUTATION; LOSSY CHANNEL SYSTEMS; SYMBOLIC REPRESENTATION; SYMBOLIC VERIFICATION;

ITERATIVE METHODS;

EID: 84948950320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49059-0_15     Document Type: Conference Paper

References (20)

1. P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In CAV'98. LNCS 1427, 1998.
2. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property-preserving sim-ulations. In CAV'92. LNCS 663, 1992.
3. S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In CAV'98. LNCS 1427, 1998.
4. B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In CAV'96. LNCS 1102, 1996.
5. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In SAS'97. LNCS 1302, 1997.
6. B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV'94. LNCS 818, 1994.
7. A. Bouajjani and P. Habermehl. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. In ICALP'97. LNCS 1256, 1997.
8. Gérard Cécffe, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Inf. and Comp., 124(1): 20-31, 1996.
9. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In IFIP Conf. on Formal Desc. of Prog. Concepts. NH Pub., 1977.
10. P. D'Argenio, J-P. Katoen, T. Ruys, and G. J. Tretmans. The Bounded Retrans-mission Protocol must be on Time. In TACAS'97. LNCS 1217, 1997.
11. J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighire-anu. CADP: A Protocol Validation and Verification Toolbox. In CAV'96. LNCS 1102, 1996.
12. A. Finkel and O. Marcé. Verification of Infinite Regular Communicating Automata. Technical report, LIFAC, ENS de Cachan, 1996.
13. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In CAV'97, volume 1254 of LNCS, 1997.
14. J-F. Groote and J. Van de Pol. A Bounded Retransmission Protocol for Large Data Packets. In AMAST'96. LNCS 1101, 1996.
15. O. Grumberg and D. Long. Model Checking and Modular Verification. ACM TOPLAS, 16: 843-871, 1994.
16. K. Havelund and N. Shankar. Experiments in Theorem Proving and Model Check-ing for Protocol Verification. In FME'96. LNCS 1051, 1996.
17. L. Helmink, M. P. A. Sellink, and F. Vaandrager. Proof checking a Data Link Pro-tocol. In Types for Proofs and Programs. LNCS 806, 1994.
18. R. M. Karp and R. E. Miller. Parallel Program Schemata: A Mathematical Model for Parallel Computation. In 8th ann. Switch. and Aut. Theo. Symp. IEEE, 1967.
19. R. Mateescu. Formal Description and Analysis of a Bounded Retransmission Pro-tocol. Technical report no. 2965, INRIA, 1996.
20. J. K. Pachl. Protocol Description and Analysis Based on a State Transition Model with Channel Expressions. In Protocol Specification, Testing, and Verification VII, 1987.