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/6132
Title: Decidability of Systems of Set Constraints with Negative Constraints
Authors: Aiken, Alexander
Kozen, Dexter
Wimmers, Ed
Keywords: computer science
technical report
Issue Date: Jun-1993
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1362
Abstract: Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. Recently, several algorithms for solving general systems of positive set constraints have appeared. In this paper, we consider systems of mixed positive and negative constraints, which are considerably more expressive than positive constraints alone. We show that it is decidable whether a given such system has a solution. The proof involves a reduction to a number-theoretic decision problem that may be of independent interest.
URI: http://hdl.handle.net/1813/6132
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
93-1362.pdf2.07 MBAdobe PDFView/Open
93-1362.ps440.83 kBPostscriptView/Open

Refworks Export

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

 

© 2014 Cornell University Library Contact Us