Abstract
In this paper we propose an abstract version of the denotational semantics defined in [8]. This leads to a precise goal-independent abstract interpretation of Prolog programs. We deal with the control rules of Prolog and the cut operator. Moreover, we get a simple denotation for negation as finite failure. The abstract analysis is proposed both for computed answers analysis and for call patterns analysis. In both cases the abstract semantics is finitely computable.
Author supplied keywords
Cite
CITATION STYLE
Spoto, F., & Levi, G. (1998). Abstract interpretation of prolog programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1548, pp. 455–470). Springer Verlag. https://doi.org/10.1007/3-540-49253-4_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
