26 search results - page 4 / 6 » Parameterizing a Groundness Analysis of Logic Programs |
ICLP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
EPIA
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
LPAR
2000
Springer
14 years 3 days ago
2000
Springer
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...