Automata and Program Analysis

Colcombet, Thomas, Daviaud, Laure and Zuleger, Florian (2017) Automata and Program Analysis. In: FCT 2017: Fundamentals of Computation Theory. Lecture Notes in Computer Science . Springer-Verlag Berlin Heidelberg, FRA, pp. 3-10. ISBN 9783662557501

Full text not available from this repository.


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.

Item Type: Book Section
Additional Information: Publisher Copyright: © Springer-Verlag GmbH Germany 2017.
Uncontrolled Keywords: theoretical computer science,computer science(all) ,/dk/atira/pure/subjectarea/asjc/2600/2614
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 08 Jun 2023 14:30
Last Modified: 08 Jun 2023 14:30
DOI: 10.1007/978-3-662-55751-8_1

Actions (login required)

View Item View Item