1204 search results - page 17 / 241 » Termination of Polynomial Programs |
ICLP
2004
Springer
14 years 4 months ago
2004
Springer
ICLP
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
PEPM
2004
ACM
14 years 4 months ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
ICLP
1997
Springer
14 years 3 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
POPL
2008
ACM
14 years 11 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...