Automata and Program Analysis

Thomas Colcombet, Laure Daviaud, Florian Zuleger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationFCT 2017: Fundamentals of Computation Theory
EditorsRalf Klasing, Marc Zeitoun
PublisherSpringer-Verlag Berlin Heidelberg
Number of pages8
ISBN (Print)9783662557501
Publication statusPublished - 2017
Externally publishedYes
Event21st International Symposium on Fundamentals of Computation Theory, FCT 2017 - Bordeaux, France
Duration: 11 Sep 201713 Sep 2017

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference21st International Symposium on Fundamentals of Computation Theory, FCT 2017

Cite this