Algorithmic analysis of programs with well quasi-ordered domains

Information and Computation

Volumn 160, Issue 1-2, 2000, Pages 109-127

  Abdulla, Parosh Aziz ^a   Čerans, Karlis ^b   Jonsson, Bengt ^a   Tsay, Yih Kuen ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF LATVIA   (Latvia)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER SIMULATION; CONTROL THEORY; PROBLEM SOLVING;

INFINITE-STATE SYSTEMS;

COMPUTER PROGRAMMING;

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

References (29)

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," pp. 414-425, Philadelphia.
2. Alur, R., and Henzinger, T. (1989), A really temporal logic, in "Proc. 30th Annual Symp. Foundations of Computer Science," pp. 164-169.
3. Abdulla, P. A., and Jonsson, B. (1993), Verifying programs with unreliable channels, in "Proc. 8the IEEE Int. Symp. on Logic in Computer Science," pp. 160-170.
4. Abdulla, P. A., and Jonsson, B. (1996), Undecidable verification problems for programs with unreliable channels, Inform. and Comput. 130, 71-90.
5. Abdulla, P. A., and Kindahl, M. (1995), Decidability of simulation and bisimulation between lossy channel systems and finite state systems, in "Proc. CONCUR '95, 6th Int. Conf. on Concurrency Theory" (Lee and Smolka, Eds.), Lecture Notes in Computer Science, Vol. 962, pp. 333-347, Springer-Verlag, Berlin/New York.
6. Barzdin, J. M., Bicevskis, J. J., and Kalninsh, A. A. (1974), Construction of complete sample systems for program testing, Latv. Gosudarst. Univ. Uch. Zapiski 210. [In Russian]
7. Barzdin, J. M., Bicevskis, J. J., and Kalninsh, A. A. (1977), Automatic construction of complete systems for program testing, in "IFIP Congress 1977."
8. Bergstra, J., and Klop, J. (1985), Algebra of communicating process with abstraction, Theoret. Comput. Sci. 37, 77-121.
9. Bochman, G. V. (1978), Finite state description of communicating protocols, Comput. Networks 2, 361-371.
10. Brand, D., and Zafiropulo, P. (1983), On communicating finite-state machines, J. Assoc. Comput. Mech. 2(5), 323-342.
11. Cousot, P., and Cousot, R. (1977), Abstract interpretation: A unified model for static analysis of programs by construction or approximation of fixpoints, in "Proc. 4th ACM Symp. on Principles of Programming Languages," pp. 238-252.
12. Č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.
13. Čerāns, K. (1992), Feasibility of finite and infinite paths in data dependent programs, in "LFCS'92," Lecture Notes in Computer Science, Vol. 620, pp. 69-80.
14. Čerāns, K. (1994), Deciding properties of integral relational automata, in "Proc. ICALP '94" (Abiteboul and Shamir, Eds.), Lecture Notes in Computer Science, Vol. 820, pp. 35-46, Springer-Verlag, Berlin/New York.
15. 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, Canada," pp. 294-303.
16. Clarcke, E. M., Grumberg, O., and Long, D. E. (1992), Model checking and abstraction, in "Proc. 19th ACM Symp. on Principles of Programming Languages."
17. 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" (Q. R. Cleaveland, Ed.), pp. 138-147.
18. Dams, D., Grumber, O., and Gerth, R. (1994), Abstract interpretation of reactive systems: Abstractions preserving ∀CTL*, ∃CTL* and CTL*, in "Proc. IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET '94)."
19. Dickson, L. E. (1913), Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, Amer. J. Math. 35, 413-422.
20. Finkel, A. (1990), Reduction and covering of infinite reachability trees, Inform. and Comput. 89, 144-179.
21. Henzinger, T. A. (1995), Hybrid automata with finite bisimulations, in "Proc. ICALP '95," Lecture Notes in Computer Science, Vol. 944, pp. 324-335, Springer-Verlag, Berlin/New York.
22. Higman, G. (1952), Ordering by divisibility in abstract algebras, Proc. London Math. Soc. 2, 326-336.
23. Jančar, P. (1990), Decidability of a temporal logic problem for Petri nets, Theoret. Comput. Sci. 74, 71-93.
24. Jančar, P., and Moller, F. (1995), Checking regular properties of Petri nets, in "Proc. CONCUR '95, 6th Int. Conf. on Concurrency Theory," pp. 348-362.
25. Jones, N. D., and Flemming, N. (1994), Abstract interpretation: A semantics-based tool for program analysis, in "Handbook of Logic in Computer Science," Oxford Univ. Press, London.
26. Kindahl, M. (1993), "Implementation of a Reachability Algorithm for Systems with Unreliable Channels," Master's thesis, Department of Computer Systems, Uppsala University, Sweden. [Available as Report DoCS 93/44]
27. Karp, R. M., and Miller, R. E. (1969), Parallel program schemata, J. Comput. Systems Sci. 3, 147-195.
28. Loiseaux, C., Graf, S., Sifakis, J., Boujjani, A., and Bensalem, S. (1995), Property preserving abstractions for the verification of concurrent systems, Formal Methods in System Design 6, 11-44.
29. Peng, W., and Purushothaman, S. (1992), Analysis of a class of communicating finite state machines, Acta Inform. 29(6/7), 499-522.