Undecidable verification problems for programs with unreliable channels

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

Volumn 820 LNCS, Issue , 1994, Pages 316-327

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MODEL CHECKING;

COMPUTATION TREE LOGIC; CORRESPONDENCE PROBLEMS; FINITE STATE PROCESS; INFINITE STATE SYSTEMS; LINEAR TIME LOGIC; MODEL CHECKING PROBLEM; UNRELIABLE CHANNELS; VERIFICATION PROBLEMS;

TEMPORAL LOGIC;

EID: 85027402534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58201-0_78     Document Type: Conference Paper

References (27)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th IEEE Int. Symp. on Logic in Computer Science, pages 414-425, Philadelphia, 1990.
2. th IEEE Int. Symp. on Logic in Computer Science, 1993.
3. Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Technical Report 94/47, Dept. of Computer Systems, Uppsala University, Sweden, 1994.
4. 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. 5th IEEE Int. Symp. on Logic in Computer Science, 1990.
5. K. Bartlett, R. Scantlebury, and P. Wilkinson. A note on reliable full-duplex transmissions over half duplex lines. Communications of the ACM, 2(5):260-261, 1969.
6. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 2(5):323-342, April 1983.
7. K. Cerans. Decidability of bisimulation equivalence for parallel timer processes. InProc. Workshop on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 302-315, 1992.
8. 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 Languages and Systems, 8(2):244-263, April 1986.
9. 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.
10. E. M. Clarke and O. Grumberg. Avoiding the state explosion problem in temporal logic model checking algorithms. In Proc. 6th ACM Symp. on Principles of Distributed Computing, Vancouver, Canada, pages 294-303, 1987.
11. A. Finkel. A new class of analyzable CFSMs with unbounded FIFO channels. In Protocol Specification, Testing, and Verification VIII, pages 1-12, Atlantic City, USA, 1988. IFIP WG 6.1, North-Holland.
12. A. Finkel. Decidability of the termination problem for completely specified protocols. Technical Report 463, LRI, University Paris-Sud, 1989. Also accepted for publication in the Distributed Computing Journal.
13. 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.
14. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992.
15. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
16. ISO. Data communications - HDLC procedures - elements of procedures. Technical Report ISO 4335, International Standards Organization, Geneva, Switzerland, 1979.
17. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. In Monien and Cori, editors, Proc. 6th Symposium on Theoretical Aspects of Computer Science, volume 349 of Lecture Notes in Computer Science, pages 421-433. Springer Verlag, 1989. Revised version to appear in Information and Computation.
18. R.M. Karp and R.E. Miller. Parallel program schemata. Journal of Computer and Systems Sciences, 3(2):147-195, May 1969.
19. 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.
20. 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.
21. K. Ruohonen. On some variants of Post's correspondence problem. Acta Informatica, (19):357-367, 1983.
22. L.E. Rosier and H-C. Yen. Boundedness, empty channel detection and synchronization for communicating finite automata. Theoretical Computer Science, 44:69-105, 1986.
23. Z. Shtadler and O. Grumberg. Network grammars, communication behaviours and automatic verification. In Sifakis, editor, Proc. Workshop on Computer Aided Verification, volume 407 of Lecture Notes in Computer Science, pages 151-165. Springer Verlag, 1990.
24. A.P. Sistla and L.D. Zuck. Automatic temporal verification of buffer systems. In Larsen and Skou, editors, Proc. Workshop on Computer Aided Verification, volume 575 of Lecture Notes in Computer Science. Springer Verlag, 1991.
25. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st IEEE Int. Symp. on Logic in Computer Science, pages 332-344, June 1986.
26. Pierre Wolper. Expressing interesting properties of programs in propositional temporal logic (extended abstract). In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 184-193, Jan 1986.
27. Wang Yi. CCS + Time = an interleaving model for real time systems. In Leach Albert, Monien, and Rodriguez Artalejo, editors, Proc. ICALP ‘91, volume 510 of Lecture Notes in Computer Science. Springer Verlag, 1991.