On removing the pushdown stack in reachability constructions

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

Volumn 2223 LNCS, Issue , 2001, Pages 244-256

  Ibarra, Oscar H ^a   Dang, Zhe ^b  

^a University of California   (United States)

^b Washington State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-STATE; MACHINE MODELS; PRESBURGER; REACHABILITY; REVERSAL-BOUNDED COUNTERS; SATISFIABILITY; TIMED AUTOMATA; FINITE STATE; REVERSAL-BOUNDED; SATISFIABILITY CHECKING;

TRANSLATION (LANGUAGES); ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPUTATION THEORY; BINS;

EID: 55349129698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_22     Document Type: Conference Paper

References (24)

1. R. Alur and D. Dill. "The theory of timed automata," TCS, 126(2):183-236, 1994 244, 245, 253
2. P. Abdulla and B. Jonsson. "Verifying programs with unreliable channels," Information and Computation, 127(2): 91-101, 1996 244
3. A. Bouajjani, J. Esparza, and O. Maler. "Reachability analysis of pushdown automata: application to model-Checking," CONCUR'97, LNCS 1243, pp. 135-150 244, 245, 247
4. G. Cece and A. Finkel. "Programs with Quasi-Stable Channels are Effectively Recognizable," CAV'97, LNCS 1254, pp. 304-315 244
5. H. Comon and V. Cortier. "Flatness is not a weakness," Proc. Computer Science Logic, 2000 254
6. H. Comon and Y. Jurski. "Multiple counters automata, safety analysis and Pres-burger arithmetic," CAV'98, LNCS 1427, pp. 268-279 244
7. H. Comon and Y. Jurski. "Timed automata and the theory of real numbers," CONCUR'99, LNCS 1664, pp. 242-257
8. Z. Dang. "Binary reachability analysis of timed pushdown automata with dense clocks," CAV'01, LNCS 2102, pp. 506-517 245
9. Z. Dang and O. H. Ibarra. "Liveness verification of reversal-bounded counter machines with a free counter," submitted, 2001 244
10. Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer and J. Su. "Binary Reachability Analysis of Discrete Pushdown Timed Automata," CAV'00, LNCS 1855, pp. 69-84 245, 246, 253, 255
11. Z. Dang, P. San Pietro, and R. A. Kemmerer. "On Presburger Liveness of Discrete Timed Automata," STACS'01, LNCS 2010, pp. 132-143 244
12. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. "Efficient Algorithms for Model Checking Pushdown Systems," CAV'00, LNCS 1855, pp. 232-247 244, 245, 247
13. A. Finkel and G. Sutre. "Decidability of Reachability Problems for Classes of Two Counter Automata," STACS'00, LNCS 1770, pp. 346-357 244
14. A. Finkel, B. Willems, and P. Wolper. "A direct symbolic approach to model checking pushdown systems," INFINITY'97 244, 245, 247
15. S. Ginsburg and E. Spanier. "Bounded Algol-like languages," Transactions of American Mathematical Society, 113, pp. 333-368, 1964. 248
16. O. H. Ibarra. "Reversal-bounded multicounter machines and their decision problems," J. ACM, 25 (1978) 116-133 245, 248, 254
17. O. H. Ibarra. "Reachability and safety in queue systems with counters and push-down stack," Proceedings of the International Conference on Implementation and Application of Automata, pp. 120-129, 2000. 245
18. O. H. Ibarra, T. Bultan, and J. Su. "Reachability analysis for some models of infinite-state transition systems," CONCUR'00, pp. 183-198, 2000. 245, 246
19. O. H. Ibarra. "Reachability and safety in queue systems with counters and push-down stack," Proceedings of the International Conference on Implementation and Application of Automata, pp. 120-129, 2000 244
20. O. H. Ibarra, Z. Dang, and P. San Pietro, "Verification in Loosely Synchronous Queue-Connected Discrete Timed Automata," submitted. 2001 244
21. O. H. Ibarra and J. Su. "Generalizing the discrete timed automaton," Proceedings of the International Conference on Implementation and Application of Automata, 206-215, 2000. 245, 246, 253
22. O. H. Ibarra, J. Su, T. Bultan, Z. Dang, and R. A. Kemmerer. "Counter Machines: Decidable Properties and Applications to Verification Problems,", MFCS'00, LNCS 1893, pp. 426-435 244, 245
23. K. L. McMillan. "Symbolic model-checking - an approach to the state explosion problem," PhD thesis, Department of Computer Science, Carnegie Mellon University, 1992 244
24. W. Peng and S. Purushothaman. "Analysis of a Class of Communicating Finite State Machines," Acta Informatica, 29(6/7): 499-522, 1992 244