In logic programming, "dixit" Bruygnooghe, the purpose of abstract interpretation is the construction of a finite AND/OR tree and the "computation" of a correct abstract substitution at each node of that tree. The authors consider an abstract substitution as an attribute attached to the nodes of a tree, and then the propagation process of abstract substitutions through the tree can be expressed in terms of attribute evaluation. In this way, the authors implement abstract interpretation algorithms by attribute evaluation algorithms.
展开▼
