Automata-Based Termination ProofsReport as inadecuate

Automata-Based Termination Proofs - Download this document for free, or read online. Document in PDF available to download.

1 VERIMAG - IMAG - VERIMAG 2 FIT - Faculty of Information Technology Brno

Abstract : 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.

Keywords : Programs with pointers Formal verification Termination analysis Büchi automata Tree automata

Author: Radu Iosif - Adam Rogalewicz -



Related documents