Roberto, Margherita and Beatrice

Home

Personal Info

Papers

Teaching

Links

Structural Information Analysis for CLP Languages

Roberto Bagnara
School of Computer Studies
University of Leeds
Leeds, LS2 9JT
United Kingdom

Abstract:

We present the rational construction of a generic domain for structural analysis of CLP languages: Pattern(D#), where the parameter D# is an abstract domain satisfying certain properties. Our domain builds on the parameterized domain for the analysis of Prolog programs Pat(R), which is due to Cortesi et al. [1, 2]. However, the formalization of our CLP abstract domain is independent from specific implementation techniques: Pat(R) (suitably extended) is one of the possible implementations. Reasoning at a higher level of abstraction we are able to appeal to familiar notions of unification theory. One advantage is that we can identify an important parameter (a common anti-instance function, missing in [1]) that gives some control over the precision and computational cost of the resulting generic structural domain.

References

1
A. Cortesi, B. Le Charlier, and P. Van Hentenryck.
Conceptual and software support for abstract domain design: Generic structural domain and open product.
Technical Report CS-93-13, Brown University, Providence, RI, 1993.

2
A. Cortesi, B. Le Charlier, and P. Van Hentenryck.
Combinations of abstract domains for logic programming.
In Conference Record of POPL '94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 227-239, Portland, Oregon, 1994.


Available: PDF, 300 DPI, 600 DPI, and 1200 DPI PostScript, DVI, BibTeX entry.

[Page last updated on June 09, 2000, 18:36:24.]

© Roberto Bagnara
bagnara@cs.unipr.it

Home | Personal | Papers | Teaching | Links