Verifying Programs with Unreliable Channels

Information and Computation

Volumn 127, Issue 2, 1996, Pages 91-101

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002811218     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0053     Document Type: Article

References (36)

1. Alur, R., Courcoubetis C., and Dill D. (1990), Model-checking for real-time systems, in "Proc. 5th IEEE Int. Symp. on Logic in Computer Science, Philadelphia," pp. 414-425.
2. 20 states and beyond, in "Proc. 5th IEEE Int. Symp. on Logic in Computer Science."
3. Bochman, G. V. (1978), Finite state description of communicating protocols, Comput. Networks 2, 361-371.
4. Burkart, O., and Steffen, B. (1992), Model checking for context-free processes, in "Proc. CONCUR '92, Theories of Concurrency: Unification and Extension" (W. R. Cleaveland, Ed.), Lecture Notes in Computer Science, Vol. 630, pp. 123-137. Springer-Verlag, Berlin/New York.
5. Bartlett, K., Scantlebury, R., and Wilkinson, P. (1969), A note on reliable full-duplex transmissions over half duplex lines, Comm. ACM 2(5), 260-261.
6. Brand, D., and Zafiropulo, P. (1983), On communicating finite-state machines, J. Assoc. Comput. Mach. 2(5), 323-342.
7. Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1986), Automatic verification of finite-state concurrent systems using temporal logic specification, ACM Trans. Programming Languages Systems 8(2), 244-263.
8. Choquet, A., and Finkel, A. (1987), Simulation of linear FIFO nets having a structured set of terminal markings, in "Proc. 8th European Workshop on Applications and Theory of Petri Nets."
9. Clarke, E. M., and Grumberg, O. (1987), Avoiding the state explosion problem in temporal logic model checking algorithms, in "Proc. 6th ACM Symp. on Principles of Distributed Computing, Vancouver," pp. 294-303.
10. Christensen, S., Hirshfeld, Y., and Moller, F. (1993), Bisimulation equivalence is decidable for basic parallel processes, in "Proc. CONCUR '93, Theories of Concurrency: Unification and Extension," pp. 143-157.
11. Christensen, S., Hüttel, H., and Stirling, C. (1992), Bisimulation equivalence is decidable for all context-free processes, in "Proc. CONCUR '92, Theories of Concurrency: Unification and Extension" (W. R. Cleaveland, Ed.), pp. 138-147.
12. Courcelle, B. (1991), On constructing obstruction sets of words. Bull. EATCS (44), 178-185.
13. Finkel, A. (1988), A new class of analyzable CFSMs with unbounded FIFO channels, in "Protocol Specification, Testing, and Verification VIII, Atlantic City," pp. 1-12; IFIP WG 6.1, North-Holland, Amsterdam.
14. Finkel, A. (1994), Decidability of the termination problem for completely specified protocols, Distrib. Comput. 7(3).
15. Gouda, M. G., Gurari, E. M., Lai, T.-H., and Rosier, L. E. (1987), On deadlock detection in systems of communicating finite state machines, Comput. Artificial Intell. 6(3), 209-228.
16. German, S. M., and Sistla, A. P. (1992), Reasoning about systems with many processes, J. Assoc. Comput. Mach. 39(3), 675-735.
17. Godefroid, P., and Wolper, P. (1993), Using partial orders for the efficient verification of deadlock freedom and safety properties, Formal Methods System Design 2(2), 149-164.
18. Higman, G. (1952), Ordering by divisibility in abstract algebras, Proc. London Math. Soc. 2, 326-336.
19. Holzmann, G. J. (1991), "Design and Validation of Computer Protocols," Prentice-Hall, New York.
20. ISO (1979), Data Communications-HDLC Procedures-Elements of Procedures, Technical Report ISO 4335, International Standards Organization, Geneva.
21. Jančar, P. (1990), Decidability of a temporal logic problem for Petri nets, Theoret. Comput. Sci. 74, 71-93.
22. Jonsson, B., and Parrow, J. (1993), Deciding bisimulation equivalences for a class of non-finite-state programs, Inform. and Comput. 107, 272-302.
23. Kindahl, Mats (1993), "Implementation of a Reachability Algorithm for Systems with Unreliable Channels," Technical Report 44, Department of Computer Systems, Uppsala University.
24. Karp, R. M., and Miller, R. R. (1969), Parallel program schemata, J. Comput. System Sci. 3, 147-195.
25. Lothaire, M. (1983), "Combinatorics on Words," Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley, Reading, MA.
26. Manna, M., and Pnueli, P. (1992), "The Temporal Logic of Reactive and Concurrent Systems," Springer-Verlag, Berlin/ New York.
27. Pachl, J. K. (1987), Protocol description and analysis based on a state transition model with channel expressions, in "Protocol Specification, Testing, and Verification VII."
28. Peng, W., and Purushothaman, S. (1991), Data flow analysis of communicating finite state machines, ACM Trans. Programming Languages Systems 13(3), 399-442.
29. Rosier, L. E., and Yen, H.-C. (1986), Boundedness, empty channel detection and synchronization for communicating finite automata, Theoret. Comput. Sci. 44, 69-105.
30. Shtadler, Z., and Grumberg, O. (1990), Network grammars, communication behaviours and automatic verification, in "Proc. Workshop on Computer Aided Verification" (Sifakis, Ed.), Lecture Notes in Computer Science, Vol. 407, pp. 151-165, Springer-Verlag, Berlin/New York.
31. Sistla, A. P., and Zuck, L. D. (1991), Automatic temporal verification of buffer systems, in "Proc. Workshop on Computer Aided Verification" (Larsen and Skou, Eds.), Lecture Notes in Computer Science, Vol. 575, Springer-Verlag, Berlin/New York.
32. Tanenbaum, A. (1981), "Computer Networks," Prentice-Hall, New York.
33. Čerāns, K. (1992), Decidability of bisimulation equivalence for parallel timer processes, in "Proc. Workshop on Computer Aided Verification," Lecture Notes in Computer Science, Vol. 663, pp. 302-315, Springer-Verlag, Berlin/New York.
34. Vardi, M. Y., and Wolper, P. (1986), An automata-theoretic approach to automatic program verification, in "Proc. 1st IEEE Int. Symp. on Logic in Computer Science," pp. 332-344.
35. Wolper, Pierre (1986), Expressing interesting properties of programs in propositional temporal logic (extended abstract), in "Proc. 13th ACM Symp. on Principles of Programming Languages," pp. 184-193.
36. Yi, Wang (1991), CCS + Time = an interleaving model for real time systems, in "Proc. ICALP '91" (Leach Albert, Monien, and Rodriguez Artalejo, Eds.), Lecture Notes in Computer Science, Vol. 510, Springer-Verlag, Berlin/New York.