104 search results - page 4 / 21 » Proving Termination Properties with mu-term |
LISP
2002
13 years 7 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
We present a framework for defining abstract interpreters for liveness properties, in particular program termination. The framework makes use of the theory of metric spaces to defi...
TPHOL
2008
IEEE
14 years 1 months 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...