34 search results - page 3 / 7 » Proof Pearl: The Termination Analysis of Terminator |
TPHOL
2008
IEEE
14 years 5 days ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
TACAS
2010
Springer
14 years 23 days ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
CORR
2000
Springer
13 years 5 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
LOPSTR
1994
Springer
13 years 10 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
AAECC
2005
Springer
13 years 5 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...