Extended Set Constraints and Tree Grammar Abstraction of Programs

Set constraints are relations between sets of ground terms or trees. This paper presents two main contributions: firstly we consider an extension of the systems of set constraints to include a tuple constructor, and secondly we construct a simplified solution procedure for set constraints. We illustrate the approach using logic programs and show that we can construct various set-based abstractions of a program including the TP abstraction using a system of set constraints derived in a single pass over the program.