In this paper we introduce the notion of Heyting completion in abstract interpretation, and we prove that it supplies a logical basis to specify relational program analyses by means of intuitionistic implication. This provides a uniform algebraic setting where abstract domains can be specified by simple logic formulas, or as solutions of recursive abstract domain equations, involving few basic operations for domain construction. We apply our framework to study directionality in type inference and groundness analysis in logic programming.
CITATION STYLE
Giacobazzi, R., & Scozzari, F. (1997). Intuitionistic implication in abstract interpretation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1292, pp. 175–189). Springer Verlag. https://doi.org/10.1007/bfb0033844
Mendeley helps you to discover research relevant for your work.