Summary: Solving Systems of Set Constraints
(Extended Abstract)
Alexander Aiken Edward L. Wimmers
IBM Almaden Research Center
650 Harry Rd.
San Jose, CA 95120
phone: 408/927­1876 or 927­1882
email: lastname@almaden.ibm.com
fax: 408/927­2100
Abstract
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
1 Introduction
Set constraints are a natural formalism for describ­

Source: Aiken, Alex - Department of Computer Science, Stanford University

Collections: Computer Technologies and Information Sciences