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...

Citations

203	Type inclusion constraints and type inference - Aiken, Wimmers - 1993
186	Flow analysis and optimization of Lisplike structures - Muchnick, Jones - 1981
182	Soft typing with conditional types - Aiken, Wimmers, et al. - 1994
94	Set Based Program Analysis - Heintze - 1992
90	A finite presentation theorem for approximating logic programs - Heintze, Jaffar - 1990
73	Solving systems of set constraints - Aiken, Wimmers - 1992
69	Deciding equivalence of finite tree automata - Seidl - 1990
68	Set constraints are the monadic class - Bachmair, Ganzinger, et al. - 1993
68	Towards a theory of types in Prolog - Mishra - 1984
64	Automatic computation of data set definitions - Reynolds - 1969
60	The complexity of set con-straints - Aiken, Kozen, et al. - 1993
59	Static type inference in a dynamically typed language - Aiken, Murphy - 1991
58	Declaration-free type checking - Mishra, Reddy - 1985
51	Decidability of systems of set constraints with negative constraints - Aiken, Kozen, et al. - 1995
39	Directional type checking of logic programs - Aiken, Lakshman - 1994
38	Type inference with partial types - Thatte - 1988
35	Solving systems of set constraints with negated subset relationships - Gilleron, Tison, et al. - 1993
34	A Decision Procedure for a Class of Herbrand Set Constraints - Heintze, ar - 1990
30	Set constraints with projections are in NEXPTIME - Charatonik, Pacholski - 1994
24	Solving systems of set constraints using tree automata - Gilleron, Tison, et al. - 1993
23	Subtyping with union types, intersection types and recursive types - Damm - 1994
21	Über Möglichkeiten im Relativkalküll (On possibilities in the claculus of relations - Löwenheim - 1915
19	An engine for logic program analysis - Heintze, Jaffar - 1992
7	Analysis of recursive types in lisp-like languages - Wang, Hilfinger
4	Set-based analysis of ML programs (extended abstract - Heintze - 1994
4	Set-based program analysis. Draft manuscript - Heintze, Jaffar - 1991
1	Negative set constraints wtih equality: An easy proof of decidability - Charatonik, Pacholski - 1994