Abstract interpretation over algebraic data types

This paper is concerned with the static analysis of programs over recursive data structures such as lists and trees. In particular, we consider the analysis of uniform properties i.e., properties pertaining only to the content of a data structure. We first present an axiomatic description of properties of sum types and algebraic types and use the theory of powerdomains to construct lattices modelling the logic of the axiomatisations. In addition to a new analysis of sum types based on logic, this provides a systematic way of defining abstract lattices for arbitrary algebraic data types. We provide a detailed description of the lattice for analysing lists and show how our developments generalise existing frameworks proposed by Wadler (1987) and Nielson and Nielson (1992). Finally, we show how abstract interpretations of well known list operations can be defined over these lattices.<>