Improving abstract interpretations by combining domains

M. Codish, A. Mulkers, M. Bruynooghe, M. Garcia de la Banda, M. Hermenegildo

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

6 Citations (Scopus)


In this paper we consider static analyses based on abstract interpretation of logic programs over combined domains. It is known that analyses over combined domains potentially provide more information than obtainable by performing the independent abstract interpretations. However, the construction of a combined analysis often requires redefining the basic operations for the combined domain. We demonstrate for logic programs that in practice it is possible to obtain precision in a combined analysis without redefining the basic operations. We also propose a way of performing the combination which can be more precise than the straightforward application of the classical `reduced product' approach, while keeping the original components of the basic operations. The advantage of the approach is that proofs of correctness for the new domains are not required and implementations can be reused. We illustrate our results by showing that a combined sharing analysis - constructed from `old' proposals - compares well with other `new' proposals suggested in recent literature both from the point of view of efficiency and accuracy.

Original languageEnglish
Title of host publicationProc ACM SIGPLAN Symp Partial Eval Semantics Based Program Manipulation
Editors Anon
Number of pages12
Publication statusPublished - 1 Dec 1993
Externally publishedYes
EventACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation 1993 - Copenhagen, Den
Duration: 14 Jun 199316 Jun 1993


ConferenceACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation 1993
CityCopenhagen, Den

Cite this