eCommons

 

Decidability of Systems of Set Constraints with Negative Constraints

dc.contributor.authorAiken, Alexanderen_US
dc.contributor.authorKozen, Dexteren_US
dc.contributor.authorWimmers, Eden_US
dc.date.accessioned2007-04-23T16:30:25Z
dc.date.available2007-04-23T16:30:25Z
dc.date.issued1993-06en_US
dc.description.abstractSet 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.en_US
dc.format.extent2121198 bytes
dc.format.extent451405 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1362en_US
dc.identifier.urihttps://hdl.handle.net/1813/6132
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleDecidability of Systems of Set Constraints with Negative Constraintsen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
93-1362.pdf
Size:
2.02 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
93-1362.ps
Size:
440.83 KB
Format:
Postscript Files