108 search results - page 8 / 22 » User-Definable Resource Bounds Analysis for Logic Programs |
PPDP
2001
Springer
13 years 11 months ago
2001
Springer
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
PODS
1991
ACM
13 years 10 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...
VLSID
1994
IEEE
13 years 10 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
ENTCS
2008
13 years 6 months ago
2008
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
JUCS
2006
13 years 6 months ago
2006
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...