Add to ORKGThis 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
When disproving termination using known techniques (e.g. recurrence sets), abstractions that overapp...
Program termination is central to the process of ensuring that reactive systems can always react. We...
The search for reliable and scalable automated methods for finding counterexamples to termination or...
International audienceThis paper proposes a framework for detecting termination of programs handling...
International audienceWe consider the termination problem of programs manipulating tree-like dynamic...
One way to develop more robust software is to use formal program verification. Formal program verifi...
International audienceWe address the verification problem of programs manipulating one-selector link...
International audienceThis paper presents two criteria for the termination of tree automata completi...
© 2017 ACM.We describe a formal verification framework and tool implementation, based upon cyclic pr...
This paper describes a general framework for automatic termination analysis of logic programs, where...
We describe a new program termination analysis designed to handle imperative programs whose termina...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
Abstract. We describe a new program termination analysis designed to handle imperative programs whos...
While automated verification of imperative programs has been studied intensively, proving terminatio...
AbstractFor logic programs with arithmetic predicates, showing termination is not easy, since the us...
When disproving termination using known techniques (e.g. recurrence sets), abstractions that overapp...
Program termination is central to the process of ensuring that reactive systems can always react. We...
The search for reliable and scalable automated methods for finding counterexamples to termination or...
International audienceThis paper proposes a framework for detecting termination of programs handling...
International audienceWe consider the termination problem of programs manipulating tree-like dynamic...
One way to develop more robust software is to use formal program verification. Formal program verifi...
International audienceWe address the verification problem of programs manipulating one-selector link...
International audienceThis paper presents two criteria for the termination of tree automata completi...
© 2017 ACM.We describe a formal verification framework and tool implementation, based upon cyclic pr...
This paper describes a general framework for automatic termination analysis of logic programs, where...
We describe a new program termination analysis designed to handle imperative programs whose termina...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
Abstract. We describe a new program termination analysis designed to handle imperative programs whos...
While automated verification of imperative programs has been studied intensively, proving terminatio...
AbstractFor logic programs with arithmetic predicates, showing termination is not easy, since the us...
When disproving termination using known techniques (e.g. recurrence sets), abstractions that overapp...
Program termination is central to the process of ensuring that reactive systems can always react. We...
The search for reliable and scalable automated methods for finding counterexamples to termination or...