Counter machines and verification problems

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 165-189

  Ibarra, Oscar H ^a   Su, Jianwen ^a   Dang, Zhe ^a   Bultan, Tevfik ^a   Kemmerer, Richard A ^a  

^a University of California   (United States)

Author keywords

Automated verification; Counter machines; Infinite state systems; Reachability

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER DEBUGGING; DECISION THEORY; FINITE AUTOMATA; REAL TIME SYSTEMS;

COUNTER MACHINES;

COMPUTER SCIENCE;

EID: 0037163974     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00268-7     Document Type: Article

References (23)

1. Abdulla P., Jonsson B. Verifying programs with unreliable channels. Inform. Comput. 127(2): 1996; 91-101.
2. Alur R., Dill D. A theory of timed automata. Theoret. Comput. Sci. 126(2): 1994; 183-235.
3. Baker B., Book R. Reversal-bounded multipushdown machines. J. Comput. System Sci. 8: 1974; 315-332.
4. A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model-checking, Proc. Internat. Conf. on Concurrency (CONCUR 1997), Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, 1997, pp. 135-150.
5. G. Cece, A. Finkel, Programs with quasi-stable channels are effectively recognizable, Proc. 9th Internat. Conf. on Computer Aided Verification (CAV 1997), Lecture Notes in Computer Science, Vol. 1254, Springer, Berlin, 1997, pp. 304-315.
6. H. Comon, Y. Jurski, Multiple counters automata, safety analysis and Presburger arithmetic, Proc. 10th Internat. Conf. on Computer Aided Verification (CAV 1998), Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 1998, pp. 268-279.
7. Z. Dang, Binary reachability analysis of timed pushdown automata with dense clocks, Proc. 13th Internat. Conf. on Computer Aided Verification (CAV 2001), Lecture Notes in Computer Science, Vol. 2102, Springer, Berlin, 2001, pp. 506-518.
8. Z. Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, J. Su, Binary reachability analysis of discrete pushdown timed automata, Proc. 12th Internat. Conf. on Computer Aided Verification (CAV 2000), Lecture Notes in Computer Science, Vol. 1427, Springer, Berlin, 2000, pp. 69-84.
9. Esparza J. Decidability of model checking for infinite-state concurrent systems. Acta Inform. 34(2): 1997; 85-107.
10. A. Finkel, G. Sutre, Decidability of reachability problems for classes of two counter automata, Proc. 17th Internat. Conf. on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 346-357.
11. Ginsburg S., Spanier E. Bounded Algol-like languages. Trans. Amer. Math. Soc. 113: 1964; 333-368.
12. Gurari E.M., Ibarra O.H. An NP-complete number-theoretic problem. J. ACM. 26: 1979; 567-581.
13. Gurari E.M., Ibarra O.H. Simple counter machines and number-theoretic problems. J. Comput. System Sci. 19: 1979; 145-162.
14. Ibarra O.H. Reversal-bounded multicounter machines and their decision problems. J. ACM. 25: 1978; 116-133.
15. Ibarra O.H., Jiang T., Tran N., Wang H. New decidability results concerning two-way counter machines. SIAM J. Comput. 24(1): 1995; 123-137.
16. O.H. Ibarra, J. Su, Z. Dang, T. Bultan, R.A. Kemmerer, Counter machines: decidable properties and applications to verification problems, Proc. 25th Internat. Conf. on Mathematical Foundations of Computer Science (MFCS 2000), Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, 1998, pp. 426-435.
17. Matijasevic Y. Enumerable sets are Diophantine. Soviet Math. Dokl. 11: 1970; 354-357.
18. K.L. McMillan, Symbolic model-checking - an approach to the state explosion problem, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, 1992.
19. Minsky M. Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines. Ann. Math. 74: 1961; 437-455.
20. Parikh R. On context-free languages. J. ACM. 13: 1966; 570-581.
21. Peng W., Purushothaman S. Analysis of a class of communicating finite state machines. Acta Inform. 29(6/7): 1992; 499-522.
22. Valiant L.G., Paterson M.S. Deterministic one-counter automata. J. Comput. System Sci. 10: 1975; 340-350.
23. P. Wolper, B. Boigelot, Verifying systems with infinite but regular state spaces, in: Proc. 10th Internat. Conf. on Computer Aided Verification (CAV 1998), Lecture Notes in Computer Science, Vol. 1427, Springer, Berlin, 1998, pp. 88-97.