A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages

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 progresses. Our basic claim is that most, if not all, of these analyses can be described within a unified notion of cons...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Science of computer programming Ročník 30; číslo 1; s. 119 - 155
Hlavný autor: Bagnara, Roberto
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 1998
Predmet:
ISSN:0167-6423, 1872-7964
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 progresses. Our basic claim is that most, if not all, of these analyses can be described within a unified notion of constraint domains. We present a class of constraint systems that allows for a smooth integration within an appropriate framework for the definition of non-standard semantics of constraint logic-based languages. Such a framework is also presented and motivated. We then show how such domains can be built, as well as construction techniques that induce a hierarchy of domains with interesting properties. In particular, we propose a general methodology for domain combination with asynchronous interaction (i.e., the interaction is not necessarily synchronized with the domains' operations). By following this methodology, interesting combinations of domains can be expressed with all the semantic elegance of concurrent constraint programming languages.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-6423
1872-7964
DOI:10.1016/S0167-6423(97)00009-9