Affiliation:
1. University of Wrocław, Wrocław, Poland
Abstract
Set constraints form a constraint system where variables range over the domain of sets of trees. They give a natural formalism for many problems in program analysis. Syntactically, set constraints are conjunctions of inclusions between expressions built over variables, constructors (constants and function symbols from a given signature) and a choice of set operators that defines the specific class of set constraints. In this article, we are interested in the class of
set constraints with projections
, which is the class with all Boolean operators (union, intersection and complement) and
projections
that in program analysis directly correspond to type destructors. We prove that the problem of existence of a solution of a system of set constraints with projections is in NEXPTIME, and thus that it is NEXPTIME-complete.
Funder
Division of Computing and Communication Foundations
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference41 articles.
1. Ackermann W. 1954. Solvable Cases of the Decision Problem. North-Holland Amsterdam The Netherlands. Ackermann W. 1954. Solvable Cases of the Decision Problem. North-Holland Amsterdam The Netherlands.
2. Introduction to set constraint-based program analysis
3. Decidability of Systems of Set Constraints with Negative Constraints
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献