Add to ORKGAbstract. Two directions of recent work on program termination use the concepts of size-change termination resp. transition invariants. The difference in the setting has as consequence the inherent incomparabil-ity of the analysis and verification methods that result from this work. Yet, in order to facilitate the crossover of ideas and techniques in further developments, it seems interesting to identify which aspects in the respec-tive formal foundation are related. This paper presents initial results in this direction.
Modern termination provers rely on a safety checker to construct disjunctively well-founded transiti...
We present a method to automatically detect termination in a strict, first order functional language...
The unfold/fold framework constitutes the spine of many program transformation strategies. However,...
In an earlier work with Neil D. Jones, we proposed the “size-change principle ” for program terminat...
We can prove termination of C programs by computing 'strong enough' transition invariants by abastra...
In [13], a new size-change principle was proposed to verify termination of functional programs autom...
International audienceThe Size-Change Termination principle was first introduced to study the termin...
domains of monotonicity constraints or of size change graphs. First, the transition relation for a g...
Abstract. We study the proof of a recent and relevant result about termination of programs, the Term...
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relativel...
Termination is an important property for programs and is necessary for formal proofs to make sense. ...
Proofs of termination typically proceed by mapping program states to a well founded domain and showi...
One way to develop more robust software is to use formal program verification. Formal program verifi...
In 2001 Lee, Jones and Ben-Amram introduced the notion of size-change termination (SCT) for first or...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
Modern termination provers rely on a safety checker to construct disjunctively well-founded transiti...
We present a method to automatically detect termination in a strict, first order functional language...
The unfold/fold framework constitutes the spine of many program transformation strategies. However,...
In an earlier work with Neil D. Jones, we proposed the “size-change principle ” for program terminat...
We can prove termination of C programs by computing 'strong enough' transition invariants by abastra...
In [13], a new size-change principle was proposed to verify termination of functional programs autom...
International audienceThe Size-Change Termination principle was first introduced to study the termin...
domains of monotonicity constraints or of size change graphs. First, the transition relation for a g...
Abstract. We study the proof of a recent and relevant result about termination of programs, the Term...
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relativel...
Termination is an important property for programs and is necessary for formal proofs to make sense. ...
Proofs of termination typically proceed by mapping program states to a well founded domain and showi...
One way to develop more robust software is to use formal program verification. Formal program verifi...
In 2001 Lee, Jones and Ben-Amram introduced the notion of size-change termination (SCT) for first or...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
Modern termination provers rely on a safety checker to construct disjunctively well-founded transiti...
We present a method to automatically detect termination in a strict, first order functional language...
The unfold/fold framework constitutes the spine of many program transformation strategies. However,...