147 search results - page 3 / 30 » A Transformation System for Definite Programs Based on Termi... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
ESORICS
2008
Springer
13 years 6 months ago
2008
Springer
Current tools for analysing information flow in programs build upon ideas going back to Denning's work from the 70's. These systems enforce an imperfect notion of informa...
CORR
2000
Springer
13 years 4 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...
ICLP
1997
Springer
13 years 9 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...
PODS
1991
ACM
13 years 8 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...