## Set Constraints: Results, Applications and Future Directions (0)

Venue: | In Second Workshop on the Principles and Practice of Constraint Programming |

Citations: | 69 - 3 self |

### BibTeX

@INPROCEEDINGS{Aiken_setconstraints:,

author = {Alexander Aiken},

title = {Set Constraints: Results, Applications and Future Directions},

booktitle = {In Second Workshop on the Principles and Practice of Constraint Programming},

year = {},

pages = {326--335},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

. Set constraints are a natural formalism for many problems that arise in program analysis. This paper provides a brief introduction to set constraints: what set constraints are, why they are interesting, the current state of the art, open problems, applications and implementations. 1 Introduction Set constraints are a natural formalism for describing relationships between sets of terms of a free algebra. A set constraint has the form X ` Y , where X and Y are set expressions. Examples of set expressions are 0 (the empty set), ff (a set-valued variable), c(X; Y ) (a constructor application), and the union, intersection, or complement of set expressions. Recently, there has been a great deal of interest in program analysis algorithms based on solving systems of set constraints, including analyses for functional languages [AWL94, Hei94, AW93, AM91, JM79, MR85, Rey69], logic programming languages [AL94, HJ92, HJ90b, Mis84], and imperative languages [HJ91]. In these algorithms, sets of...