Set Constaints and Logic Programming
| dc.contributor.author | Kozen, Dexter | en_US |
| dc.date.accessioned | 2007-04-23T16:26:23Z | |
| dc.date.available | 2007-04-23T16:26:23Z | |
| dc.date.issued | 1994-03 | en_US |
| dc.description.abstract | Set 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.extent | 347188 bytes | |
| dc.format.extent | 296497 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1467 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6076 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Set Constaints and Logic Programming | en_US |
| dc.type | technical report | en_US |