Decision problems for the verification of real-time software

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

Volumn 3927 LNCS, Issue , 2006, Pages 200-211

  Emmi, Michael ^a   Majumdar, Rupak ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PUSHDOWN AUTOMATON; REAL-TIME PROGRAMS; REAL-TIME SOFTWARE;

ALGORITHMS; AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; DECISION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

REAL TIME SYSTEMS;

EID: 33745770236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730637_17     Document Type: Conference Paper

References (14)

1. P. A. Abdulla, K. Čerāns, B. Jonsson, and Yih-Kuan Tsay. General decidability theorems for infinite-state systems. In LICS 96: Logic in Computer Science, pages 313-321. IEEE Press, 1996.
2. P. A. Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In ICALP 05: International Conference on Automata, Languages, and Programming, LNCS 3580, pages 1089-1101. Springer-Verlag, 2005.
3. P. A. Abdulla, K. Čerāns, B. Jonsson, and Yih-Kuan Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160:109-127, 2000.
4. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
5. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In TACAS 04: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2988, pages 467-481. Springer-Verlag, 2004.
6. R. Alur and P. Madhusudan. Visibly pushdown automata. In STOC 04: Symposium on Theory of Computing, pages 202-211. ACM Press, 2004.
7. T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for Boolean programs. In SPIN 00: SPIN Workshop, LNCS 1885, pages 113-130. Springer-Verlag, 2000.
8. A. Bouajjani, R. Echahed, and R. Robbana. On the automatic verification of systems with continuous variables and unbounded discrete data structures. In Hybrid Systems II, LNCS 999, pages 64-85. Springer-Verlag, 1994.
9. Z. Dang. Pushdown timed automata: a binary reachability characterization and safety verification. Theoretical Computer Science, 302:93-121, 2003.
10. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere. Theoretical Computer Science, 256:63-92, 2001.
11. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979.
12. V.K. Nandivada and J. Palsberg. Timing analysis of TCP servers for surviving denial-of-service attacks. In RTAS 05: IEEE Real-Time and Embedded Technology and Applications Symposium, pages 541-549. IEEE Press, 2005.
13. J. Ouaknine and J. Worrell. On the language inclusion problem for timed automata: Closing a decidability gap. In LICS 2004: Logic in Computer Science, pages 54-63. IEEE Press, 2004.
14. T. Reps, S. Horwitz, and M. Sagiv, Precise interprocedural dataflow analysis via graph reachability. In POPL 95: Principles of Programming Languages, pages 49-61. ACM, 1995.