444 search results - page 9 / 89 » Termination by Abstraction |
ICLP
2004
Springer
14 years 1 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...
ICLP
1997
Springer
13 years 12 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...
RTA
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving...
MST
2008
13 years 7 months ago
2008
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs...
CAV
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...