Channel representations in protocol verification: (Preliminary version)

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

Volumn 2154, Issue , 2001, Pages

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a  

^a Dept of Computer Systems ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

AUTOMATED VERIFICATION; CHANNEL REPRESENTATION; FINITE ALPHABET; LEADER ELECTION PROTOCOLS; PROTOCOL VERIFICATION; SYMBOLIC TECHNIQUES; UNBOUNDED CHANNEL; UNBOUNDED DOMAIN;

LOGIC CIRCUITS;

EID: 84944040632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (38)

1. Parosh Aziz Abdulla, Aurore Annichini, and Ahmed Bouajjani. Algorithmic verification of lossy channel systems: An application to the bounded retransmission protocol. In Proc. TACAS’99, volume 1579 of LNCS, 1999.
2. Parosh Aziz Abdulla, Luc Boasson, and Ahmed Bouajjani: Effective lossy queue languages, 2001. To appear in Proc. ICALP’2001: 28th International Colloquium on Automata, Lnaguages, and Programming.
3. Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-fly analysis of systems with unbounded, lossy fifo channels. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of LNCS, pages 305–318, 1998.
4. Parosh Aziz Abdulla, Karlis Čerāns, Bengt Jonsson, and Tsay Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. LICS’ 96 11th IEEE Int. Symp. on Logic in Computer Science, pages 313–321, 1996.
5. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91–101, 1996.
6. Parosh Aziz Abdulla and Bengt Jonsson. Verifying networks of timed processes. In Bernhard Steffen, editor, Proc. TACAS’98, volume 1384 of LNCS, pages 298–312, 1998.
7. Parosh Aziz Abdulla and Aletta Nylén: Timed Petri nets and BQOs, 2001. To appear in Proc. ICATPN’2001: 22nd Int. Conf. onapplicationan d theory of Petri nets.
8. T.P. Blumer and D.P. Sidhu: Mechanical verification of communication protocols. IEEE Trans. on Software Engineering, SE-12(8):827–843, Aug. 1986.
9. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Alur and Henzinger, editors, Proc. 8th Int. Conf. on Computer Aided Verification, volume 1102 of Lecture Notesin Computer Science, pages 1–12. Springer Verlag, 1996.
10. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. of the Fourth International Static Analysis Symposium, LNCS. Springer Verlag, 1997.
11. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In Proc. ICALP’97, volume 1256 of Lecture Notesin Computer Science, 1997.
12. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 2(5):323–342, April 1983.
13. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Proc. LICS’ 90, 5th IEEE Int. Symp. on Logic in Computer Science, 1990.
14. Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20–31, 10 January 1996.
15. A. Choquet and A. Finkel. Simulation of linear FIFO nets having a structured set of terminal markings. In Proc. 8th European Workshop on Applications and Theory of Petri Nets, 1987.
16. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specification. ACM Trans. on Programming Languagesand Systems, 8(2):244–263, April 1986.
17. G. Delzanno, J. Esparza, and A. Podelski. Constraint-based analysis of broadcast protocols. In Proc. CSL’99, 1999.
18. E.A. Emerson and K.S. Namjoshi. On model checking for non-deterministic infinite-state systems. In Proc. LICS’ 98 13th IEEE Int. Symp. on Logic in Computer Science, pages 70–80, 1998.
19. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proc. LICS’ 99 14th IEEE Int. Symp. on Logic in Computer Science, 1999.
20. A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89:144–179, 1990.
21. A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7(3), 1994.
22. A. Finkel and Ph Schnoebelen: Well-structured transition systems everywhere. Technical Report LSV-98-4, Ecole Normale Supérieure de Cachan, April 1998.
23. M. Gouda. Closed covers: to verify progress for communicating finite state machines. IEEE Trans. on Software Engineering, SE-10(6):846–855, Nov. 1984.
24. M.G. Gouda, E.M. Gurari, T.-H. Lai, and L.E. Rosier. Ondeadlo ck detectionin systems of communicating finite state machines. Computersand Artificial Intelligence, 6(3):209–228, 1987.
25. G.J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, SE-23(5):279–295, May 1997.
26. R.M. Karp and R.E. Miller. Parallel program schemata. Journal of Computer and Systems Sciences, 3(2):147–195, May 1969.
27. K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Software Toolsfor Technology Transfer, 1(1-2), 1997.
28. G. LeLann. Distributed systems – towards a formal approach. In B. Gilchrist, editor, IFIP77, pages 155–160. North-Holland, 1977.
29. R. Mayr. Undecidable problems in unreliable computations. In Theoretical Informatics(LA TIN’2000), number 1776 in Lecture Notes inComputer Science, 2000.
30. J.K. Pachl. Protocol description and analysis based on a state transition model with channel expressions. In Protocol Specification, Testing, and Verification VII, May 1987.
31. W. Peng and S. Purushothaman. Data flow analysis of communicating finite state machines. ACM Trans. on Programming Languages and Systems, 13(3):399–442, July 1991.
32. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems incesar. In 5th International Symposium on Programming, Turin, volume 137 of LNCS, pages 337–352. Springer Verlag, 1982.
33. H. Rudin, C. West, and P. Zafiropulo. Automated protocol validation - one chain of development. In Proc. Computer Network ProtocolsSymp osium Liege, 1978.
34. A.P. Sistla and L.D. Zuck. Automatic temporal verification of buffer systems. In Larsenan d Skou, editors, Proc. Workshop on Computer Aided Verification, volume 575 of LNCS. Springer Verlag, 1991.
35. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. LICS’86, 1st IEEE Int. Symp. on Logic in Computer Science, pages 332–344, June 1986.
36. C.H. West. Automated validation of a communications protocol: the ccitt x.21 recommendation. IBM Journal on Research and Development, 22(1), Jan. 1978.
37. Pierre Wolper. Expressing interesting properties of programs in propositional temporal logic (extended abstract). In Proc. 13th ACM Symp. on Principlesof Programming Languages, pages 184–193, Jan. 1986.
38. Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of LNCS, pages 88–97, Vancouver, July 1998. Springer Verlag.