Automatic analysis of pointer aliasing for untyped programs

In this paper we describe an automatic analysis based on Abstract Interpretation that discovers potential sharing relationships among the data structures created by an imperative program. The analysis is able to distinguish between elements in inductively defined structures and does not require any explicit data type declaration by the programmer. In order to construct the abstract interpretation we introduce a new class of abstract domains: the cofibered domains.