Structural Information Analysis for CLP Languages

We present the rational construction of a generic domain for structural analysis anguages: 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( ), which is due to Cortesi et al. [6, 7]. Howe formalization of our CLP abstract domain is independent from specific implementation techniques: Pat( ) (suitably extended) is one of the possible imtions. 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 [6]) that gives some control over the precision and computational cost of the resulting generic structural domain.

• Type: Conference
• Year: 1997
• Where: AGP
• Authors: Roberto Bagnara
• Keywords: Abstract Domain, AGP 1997, Artificial Intelligence, CLP Abstract Domain, Generic Domain