5 search results - page 1 / 1 » Finite-Tree Analysis for Constraint Logic-Based Languages |
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
SCP
1998
13 years 5 months ago
1998
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
AGP
1995
IEEE
13 years 9 months ago
1995
IEEE
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
CP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...