Detail publikačního výsledku

Automata-Based Termination Proofs

ROGALEWICZ, A.; IOSIF, R.

Originální název

Automata-Based Termination Proofs

Anglický název

Automata-Based Termination Proofs

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

This paper proposes a framework for detecting termination of programs handling infinite and complex data domains, such as pointer structures. In this framework, the user has to specify a finite number of well-founded relations on the data domain manipulated by these programs. Our tool then builds an initial abstraction of the program, which is checked for existence of potential infinite runs, by testing emptiness of its intersection with a predefined Buchi automaton. If the intersection is non-empty, a lasso-shaped counterexample is found. This counterexample is checked for spuriousness by a domain-specific procedure, and in case it is found to be spurious, the abstraction is refined, again by intersection with the complement of the Buchi automaton representing the lasso. We have instantiated the framework for programs handling tree-like data structures, which allowed us to prove termination of programs such as the depth-first tree traversal, the Deutsch-Schorr-Waite tree traversal, or the linking leaves algorithm.

Anglický abstrakt

This paper proposes a framework for detecting termination of programs handling infinite and complex data domains, such as pointer structures. In this framework, the user has to specify a finite number of well-founded relations on the data domain manipulated by these programs. Our tool then builds an initial abstraction of the program, which is checked for existence of potential infinite runs, by testing emptiness of its intersection with a predefined Buchi automaton. If the intersection is non-empty, a lasso-shaped counterexample is found. This counterexample is checked for spuriousness by a domain-specific procedure, and in case it is found to be spurious, the abstraction is refined, again by intersection with the complement of the Buchi automaton representing the lasso. We have instantiated the framework for programs handling tree-like data structures, which allowed us to prove termination of programs such as the depth-first tree traversal, the Deutsch-Schorr-Waite tree traversal, or the linking leaves algorithm.

Klíčová slova

Formal verification, Termination, Buchi automata, Tree automata, Programs with pointers

Klíčová slova v angličtině

Formal verification, Termination, Buchi automata, Tree automata, Programs with pointers

Autoři

ROGALEWICZ, A.; IOSIF, R.

Rok RIV

2014

Vydáno

02.09.2013

ISSN

1335-9150

Periodikum

COMPUTING AND INFORMATICS

Svazek

2013

Číslo

4

Stát

Slovenská republika

Strany od

739

Strany do

775

Strany počet

37

URL

http://www.cai.sk/ojs/index.php/cai/article/view/1970

BibTex

@article{BUT103496,
  author="Adam {Rogalewicz} and Iosif {Radu}",
  title="Automata-Based Termination Proofs",
  journal="COMPUTING AND INFORMATICS",
  year="2013",
  volume="2013",
  number="4",
  pages="739--775",
  issn="1335-9150",
  url="http://www.cai.sk/ojs/index.php/cai/article/view/1970"
}