Set Constraints and Logic Programming

Dexter Kozen
1998 Information and Computation  
Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet. They are the main ingredient i n s e tbased program analysis 4, 5, 15, 16, 19, 23, 24, 26] . In this paper we describe a constraint logic programming language clp(sc) over set constraints in the style of Ja ar and Lassez 17]. The language subsumes ordinary logic programs over an Herbrand domain. We g i v e an e cient uni cation algorithm and operational, declarative, and xpoint s e
more » ... a n tics. We show h o w the language can be applied in set-based program analysis by deriving explicitly the monadic approximation of the collecting semantics of Heintze and Ja ar 15,16].
doi:10.1006/inco.1997.2694 fatcat:vemmnq3chrdyrgvtdhg6kd5pny