Show simple item record

dc.contributor.authorKozen, Dexteren_US
dc.date.accessioned2007-04-23T16:26:23Z
dc.date.available2007-04-23T16:26:23Z
dc.date.issued1994-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1467en_US
dc.identifier.urihttps://hdl.handle.net/1813/6076
dc.description.abstractSet constraints are inclusion relations between expressions denoting sets of ground terms over a randed alphabet. They are the main ingredient in set-based program analysis[3,4,12,13,17,20,21,22,26]. In this paper we describe a constraint logic programming language CLP(SC) over set constraints in the style of Jaffar and Lassez[15]. The language subsumes ordinary logic programs over an IIerbrand domain. We give an efficient unification algorithm and operational, declarative, and fixpoint semantics. We show how the language can be applied in set-based program analysis by deriving explicitly the monadic approximation of the collecting semantics of IIeintze and Jaffar[12,13].en_US
dc.format.extent347188 bytes
dc.format.extent296497 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleSet Constaints and Logic Programmingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics