Abstract
We show how recent results concerning quantitative forms of automata help providing refined understanding of the properties of a system (for instance, a program). In particular, combining the size-change abstraction together with results concerning the asymptotic behavior of tropical automata yields extremely fine complexity analysis of some pieces of code. This abstract gives an informal, yet precise, explanation of why termination and complexity analysis are related to automata theory.
Cite
CITATION STYLE
Colcombet, T., Daviaud, L., & Zuleger, F. (2017). Automata and program analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10472 LNCS, pp. 3–10). Springer Verlag. https://doi.org/10.1007/978-3-662-55751-8_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
