We present a goal-independent abstract interpretation framework for constraint logic programs, and prove the su ciency of a set of conditions for abstract domains to ensure that the analysis will never lose precision. Along the way, we formally deΓΏne constraint logic programming systems, give a form
β¦ LIBER β¦
Precise Goal-Independent Abstract Interpretation of Constraint Logic Programs
β Scribed by Peter Schachte
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 183 KB
- Volume
- 42
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Precise goal-independent abstract interp
β
Peter Schachte
π
Article
π
2003
π
Elsevier Science
π
English
β 197 KB
Exploiting goal independence in the anal
β
Michael Codish; Maurice Bruynooghe; Maria GarcΓa De La Banda; Manuel Hermenegild
π
Article
π
1997
π
Elsevier Science
π
English
β 880 KB
This paper illustrates the use of a top-down framework to obtain goal independent analyses of logic programs, a task which is usually associated with the bottom-up approach. While it is well known that the bottom-up approach can be used, through the magic set transformation, for goal dependent analy
Abstract Interpretation based Verificati
β
Marco Comini; Roberta Gori; Giorgio Levi; Paolo Volpe
π
Article
π
1999
π
Elsevier Science
π
English
β 958 KB
Abstract Interpretation Based Verificati
β
Giorgio Levi
π
Article
π
2001
π
Elsevier Science
π
English
β 27 KB
Efficient bottom-up execution of logic p
β
Byeong-Mo Chang; Kwang-Moo Choe; Taisook Han
π
Article
π
1993
π
Elsevier Science
π
English
β 441 KB