Add to ORKGInternational audienceThis 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
AbstractFor logic programs with arithmetic predicates, showing termination is not easy, since the us...
Progress on automated termination detection for logic programs is reported. The prospects for handli...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
International audienceThis paper describes our generic framework for detecting termination of progra...
International audienceWe consider the termination problem of programs manipulating tree-like dynamic...
We describe a new program termination analysis designed to handle imperative programs whose termina...
Abstract. We describe a new program termination analysis designed to handle imperative programs whos...
One way to develop more robust software is to use formal program verification. Formal program verifi...
Abstract. Proving termination automatically for programs with ex-plicit pointer arithmetic is still ...
This paper describes a general framework for automatic termination analysis of logic programs, where...
International audienceThis paper presents two criteria for the termination of tree automata completi...
Program termination is central to the process of ensuring that reactive systems can always react. We...
International audienceWe address the verification problem of programs manipulating one-selector link...
This paper presents two criteria for the termination of tree automata completion. Tree automata comp...
Abstract. Proving termination automatically for programs with ex-plicit pointer arithmetic is still ...
AbstractFor logic programs with arithmetic predicates, showing termination is not easy, since the us...
Progress on automated termination detection for logic programs is reported. The prospects for handli...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
International audienceThis paper describes our generic framework for detecting termination of progra...
International audienceWe consider the termination problem of programs manipulating tree-like dynamic...
We describe a new program termination analysis designed to handle imperative programs whose termina...
Abstract. We describe a new program termination analysis designed to handle imperative programs whos...
One way to develop more robust software is to use formal program verification. Formal program verifi...
Abstract. Proving termination automatically for programs with ex-plicit pointer arithmetic is still ...
This paper describes a general framework for automatic termination analysis of logic programs, where...
International audienceThis paper presents two criteria for the termination of tree automata completi...
Program termination is central to the process of ensuring that reactive systems can always react. We...
International audienceWe address the verification problem of programs manipulating one-selector link...
This paper presents two criteria for the termination of tree automata completion. Tree automata comp...
Abstract. Proving termination automatically for programs with ex-plicit pointer arithmetic is still ...
AbstractFor logic programs with arithmetic predicates, showing termination is not easy, since the us...
Progress on automated termination detection for logic programs is reported. The prospects for handli...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...