Automata-Based Termination Proofs

Radu Iosif (1) , Adam Rogalewicz (2)

1 VERIMAG - IMAG - VERIMAG
2 FIT / BUT - Faculty of Information Technology [Brno]

This paper describes our generic framework for detecting termination of programs handling infinite and complex data domains, such as pointer structures. The framework is based on a counterexample-driven abstraction refinement loop. We have instantiated the framework for programs handling tree-like data structures, which allowed us to prove automatically termination of programs such as the depth-first tree traversal, the Deutsch-Schorr-Waite tree traversal, or the linking leaves algorithm.

Mots clés: Formal verification; Termination analysis; Büchi automata; Tree automata; Programs with pointers

Domaines: Théorie et langage formel [cs.FL]

Radu Iosif, Adam Rogalewicz. Automata-Based Termination Proofs. Computing and Informatics, 2013, 22, pp.739-775. ⟨hal-01418867⟩