Summary: Solving Systems of Set Constraints
Alexander Aiken Edward L. Wimmers
IBM Almaden Research Center
650 Harry Rd.
San Jose, CA 95120
phone: 408/9271876 or 9271882
Systems of set constraints are a natural formal
ism for many problems in program analysis. Set con
straints are also a generalization of tree automata. We
present an algorithm for solving systems of set con
straints built from free variables, constructors, and the
set operations of intersection, union, and complement.
Furthermore, we show that all solutions of such sys
tems can be finitely represented. 1
Set constraints are a natural formalism for describ