143 search results - page 7 / 29 » Termination of Well-Typed Logic Programs |
LOPSTR
1997
Springer
13 years 11 months ago
1997
Springer
CORR
2008
Springer
13 years 7 months ago
2008
Springer
CORR
2004
Springer
13 years 7 months ago
2004
Springer
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
ALP
1994
Springer
13 years 11 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...