A Complete Gentzen-style Axiomatization for Set Constraints
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet. They are the main ingredient in set-based program analysis. In this paper we provide a Gentzen-style axiomatization for sequents