Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6122
Title: The Complexity of Set Constraints
Authors: Aiken, Alexander
Kozen, Dexter
Vardi, Moshe
Wimmers, Ed
Keywords: computer science
technical report
Issue Date: May-1993
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1352
Abstract: Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. We present several results on the computational complexity of solving systems of set constraints. The systems we study form a natural complexity hierarchy depending on the form of the language.
URI: http://hdl.handle.net/1813/6122
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
93-1352.pdf1.78 MBAdobe PDFView/Open
93-1352.ps388.24 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us