On-the-fly analysis of systems with unbounded, Lossy FIFO Channels

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

Volumn 1427 LNCS, Issue , 1998, Pages 305-318

  Abdulla, Parosh Aziz ^a   Bouajjani, Ahmed ^b   Jonsson, Bengt ^a  

^a Dept of Computer Systems ^*  (Sweden)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; COMPUTATIONAL LINGUISTICS; LOGIC CIRCUITS;

ARBITRARY NUMBER; FIFO CHANNELS; ON THE FLIES; ON-THE FLY VERIFICATION; POLYNOMIAL-TIME; REGULAR EXPRESSIONS; REPRESENTATION FORMALISMS; SAFETY PROPERTY;

COMPUTER AIDED ANALYSIS;

EID: 84863933189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028754     Document Type: Conference Paper

References (21)

1. Paxosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Inform, and Comput., 130(1):71-90, 1996. (Pubitemid 126411858)
2. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Inform, and Comput, 127(2):91-101, 1996. (Pubitemid 126411497)
3. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In CAV'96, LNCS 1102.
4. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. Available at http://www.montefiore.ulg.ac.be/~biogelot/research/BGWW97.ps.
5. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In SAS'97, LNCS. 1997.
6. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. http://www.imag.fr/VERIMAG/PEOPLE/Peter.Habermehl.
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. V. Bochman. Finite state description of communicating protocols. Computer Networks, 2:361-371, 1978.
9. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In CAV'94, LNCS 818. 1994.
10. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 2(5):323-342, April 1983.
11. th European Workshop on Applications and Theory of Petri Nets, 1987.
12. Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Inform, and Comput, 124(1):20-31, 10 January 1996. (Pubitemid 126411491)
13. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. In CAV'90.
14. A. Finkel and O. Marcé. Verification of infinite regular communicating automata. Technical report, LIFAC, ENS de Cachan, 1996. Tech. Rep.
15. M.G. Gouda, E.M. Gurari, T.-H. Lai, and L.E. Rosier. On deadlock detection in systems of communicating finite state machines. Computers and Artificial Intelligence, 6(3):209-228, 1987.
16. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc, 2:326-336, 1952.
17. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
18. 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.
19. 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.
20. A.P. Sistla and L.D. Zuck. Automatic temporal verification of buffer systems. In Larsen and Skou, editors, CAV'91, LNCS 575. 1991.
21. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS'86, IEEE, 1986.