Modeling and verification of infinite systems with resources

Logical Methods in Computer Science

Volumn 9, Issue 4, 2013, Pages

  Lang, Martin ^a   Löding, Christof ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Pushdown systems; Quantitative automata and logics; Reachability with annotations

Indexed keywords

AUTOMATIC STRUCTURES; BOUNDED REACHABILITY PROBLEM; FORMAL VERIFICATIONS; MODELING AND VERIFICATIONS; PUSHDOWN SYSTEMS; QUANTITATIVE AUTOMATA AND LOGICS; REACHABILITY; RELATIONAL STRUCTURES;

INTEGER PROGRAMMING; SEMANTICS;

AUTOMATA THEORY;

EID: 84890501239     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-9(4:22)2013     Document Type: Article

References (19)

1. P. A. Abdulla, M. F. Atig, and J. Stenman. Dense-timed pushdown automata. In Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, LICS'12, pages 35-44. IEEE Computer Society, 2012.
2. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
3. M. Bojańczyk and T. Colcombet. Bounds in ω-regularity. In Logic in Computer Science, 2006 21st Annual IEEE Symposium on, pages 285-296, 2006.
4. P. Bouyer, U. Fahrenberg, K. Larsen, N. Markey, and J. Srba. Infinite runs in weighted timed automata with energy constraints. In F. Cassez and C. Jard, editors, Formal Modeling and Analysis of Timed Systems, volume 5215 of Lecture Notes in Computer Science, pages 33-47. Springer Berlin Heidelberg, 2008.
5. Mikolaj Bojańczyk. Weak MSO with the Unbounding Quantifier. Theory of Computing Systems, 48(3):554-576, 2011.
6. M. V. Boom. Weak cost monadic logic over infinite trees. In International Symposium on Mathematical Foundations of Computer Science, pages 580-591. Springer, 2011.
7. T. Colcombet. Regular cost functions over words. Manuscript available online, 2009. K. Hashiguchi. Limitedness theorem on finite automata with distance functions. Journal of computer and system sciences, 24(2):233-244, 1982.
8. G. Higman. Ordering by Divisibility in Abstract Algebras. Proceedings London Mathematical Society, s3-2(1):326-336, 1952.
9. B. Khoussainov and A. Nerode. Automatic presentations of structures. In D. Leivant, editor, Logic and Computational Complexity, volume 960 of Lecture Notes in Computer Science, pages 367-392. Springer, 1995.
10. B. Khoussainov and A. Nerode. Automata theory and its applications, volume 1. Birkhauser Boston, 2001.
11. M. Lang. Resource-bounded Reachability on Pushdown Systems. Master thesis, RWTH Aachen, 2011.
12. P. Lescanne, T. Heuillard, M. Dauchet, and S. Tison. Decidability of the confluence of ground term rewriting systems. Rapport de recherche RR-0675, INRIA, 1987.
13. A. Lal, T. Touili, N. Kidd, and T. Reps. Interprocedural analysis of concurrent programs under a context bound. In C. R. Ramakrishnan and J. Rehof, editors, International conference on Tools and algorithms for the construction and analysis of systems, pages 282-298. Springer, 2008.
14. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51-75, 1985.
15. T. Reps, S. Schwoon, and S. Jha. Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis. In R. Cousot, editor, Static Analysis, volume 2694 of Lecture Notes in Computer Science, pages 1075-1075. Springer, 2003.
16. J. Sakarovitch. Elements of Automata Theory. Cambridge University Press, 2009.
17. M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4(2-3):245-270, 1961.
18. D. Suwimonteerabuth, S. Schwoon, and J. Esparza. jMoped: A Java bytecode checker based on Moped. In N. Halbwachs and L. D. Zuck, editors, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of Lecture Notes in Computer Science, pages 541-545. Springer, 2005. Tool paper.
19. W. Thomas. Constructing Infinite Graphs with a Decidable MSO-Theory. In B. Rovan and P. Vojtas, editors, Mathematical Foundations of Computer Science 2003, volume 2747 of Lecture Notes in Computer Science, pages 113-124. Springer Berlin Heidelberg, 2003.