292 search results - page 16 / 59 » A Generic Framework for the Analysis and Specialization of L... |
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...
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object-oriented programming features (like dynamic di...
ICLP
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
AAAI
2006
13 years 9 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
AGP
1998
IEEE
13 years 11 months ago
1998
IEEE
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...