Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs

摘要

We present a class of domains for Abstract Interpretation, the cofibered domains, that are obtained by "glueing" a category of partially ordered sets together. The internal structure of these domains is well suited to the compositional design of approximations and widening operators, and we give generic methods for performing such constructions. We illustrate the interest of these domains by developing an alias analysis of untyped programs handling structured data. The results obtained with this analysis are comparable in accuracy to those obtained with the most powerful alias analyses existing for typed languages.