Intuitionistic implication in abstract interpretation

By: R. Giacobazzi and F. Scozzari

Roberto Giacobazzi
Dip. di Informatica
Univ. di Pisa
Corso Italia 40, 56125 Pisa (Italy)


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.
Related papers:
  • A Unifying View on Abstract Domain Design (ACM Comp. Surveys 28(2), 1996)
  • Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics (ILPS'95, The MIT Press, 1995)

  • Available: DVI, PostScript, BibTeX Entry.