TY - GEN
T1 - Automata and Program Analysis
AU - Colcombet, Thomas
AU - Daviaud, Laure
AU - Zuleger, Florian
N1 - Publisher Copyright:
© Springer-Verlag GmbH Germany 2017.
PY - 2017
Y1 - 2017
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85029437053&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-55751-8_1
DO - 10.1007/978-3-662-55751-8_1
M3 - Conference contribution
AN - SCOPUS:85029437053
SN - 9783662557501
T3 - Lecture Notes in Computer Science
SP - 3
EP - 10
BT - FCT 2017: Fundamentals of Computation Theory
A2 - Klasing, Ralf
A2 - Zeitoun, Marc
PB - Springer-Verlag Berlin Heidelberg
T2 - 21st International Symposium on Fundamentals of Computation Theory, FCT 2017
Y2 - 11 September 2017 through 13 September 2017
ER -