Precise goal-independent abstract interpretation of constraint logic programs
β Scribed by Peter Schachte
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 197 KB
- Volume
- 293
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
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 formal semantics that is independent of the actual constraint domain and the details of the proof algorithm, and formally deΓΏne the maximally precise abstraction of a constraint logic program.
π SIMILAR VOLUMES
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