26 search results - page 3 / 6 » Parameterizing a Groundness Analysis of Logic Programs |
SAS
1992
Springer
13 years 11 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
AGP
1998
IEEE
13 years 11 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
PPDP
2000
Springer
13 years 11 months ago
2000
Springer
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...