We define the inverse operation for disjunctive completion, introducing the notion of least disjunctive basis for an abstract domain $D$: this is the most abstract domain inducing the same disjunctive completion as $D$. We show that the least disjunctive basis exists in most cases, and study its properties in relation with reduced product of abstract interpretations. The resulting framework is powerful enough to be applied to arbitrary abstract domains for analysis, providing advanced algebraic methods for domain manipulation and optimization. These notions are applied to abstract domains for analysis of functional and logic programming languages.

Optimization of Disjunctive Abstract Interpretations

RANZATO, FRANCESCO
1996

Abstract

We define the inverse operation for disjunctive completion, introducing the notion of least disjunctive basis for an abstract domain $D$: this is the most abstract domain inducing the same disjunctive completion as $D$. We show that the least disjunctive basis exists in most cases, and study its properties in relation with reduced product of abstract interpretations. The resulting framework is powerful enough to be applied to arbitrary abstract domains for analysis, providing advanced algebraic methods for domain manipulation and optimization. These notions are applied to abstract domains for analysis of functional and logic programming languages.
1996 Joint Conf. on Declarative Programming, APPIA-GULP-PRODE'96, Donostia-San Sebastian, Spain
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11577/2509481
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? ND
social impact