Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/set-constraints-with-projections-WUBlrwxOPA
References (44)
-
Proc. Lett -
Franck Seynhaeve, M. Tommasi, R. Treinen (1997)
Grid Structure and Undecidable Constraint Theories -
M. Paterson, M. Wegman (1976)
Linear unificationJ. Comput. Syst. Sci., 16
-
A. Aiken (1999)
Introduction to Set Constraint-Based Program AnalysisSci. Comput. Program., 35
-
Rémi Gilleron, S. Tison, M. Tommasi (1999)
Set Constraints and AutomataInf. Comput., 149
-
Martin Müller, Joachim Niehren, A. Podelski (1997)
Ordering Constraints over Feature TreesConstraints, 5
-
D. Kozen (1993)
Logical Aspects of Set Constraints -
N. Heintze (1992)
Set based program analysis -
J. Reynolds (1968)
Automatic computation of data set definitions -
N. Heintze, J. Jaffar (1994)
Set Constraints and Set-Based Analysis -
Rémi Gilleron, S. Tison, M. Tommasi (1993)
Solving Systems of Set Constraints using Tree Automata -
Dan Suciu, V. Vianu (2006)
IntroductionJ. ACM, 53
-
Franck Seynhaeve, S. Tison, M. Tommasi, R. Treinen (2001)
Grid structures and undecidable constraint theoriesTheor. Comput. Sci., 258
-
Witold Charatonik, A. Podelski (1998)
Co-definite Set Constraints -
Witold Charatonik, A. Podelski (1997)
Set constraints with intersectionProceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
-
Witold Charatonik, L. Pacholski (1994)
Set constraints with projections are in NEXPTIMEProceedings 35th Annual Symposium on Foundations of Computer Science
-
Witold Charatonik, L. Pacholski (1994)
Negative set constraints with equalityProceedings Ninth Annual IEEE Symposium on Logic in Computer Science
-
J. Talbot (2000)
The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hardInf. Process. Lett., 74
-
J. Goubault-Larrecq (2002)
Higher-Order Positive Set Constraints -
Witold Charatonik, A. Podelski, J. Talbot (2000)
Paths vs. trees in set-based program analysis -
N. Heintze, J. Jaffar (1990)
A decision procedure for a class of set constraints[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
-
Tomás Uribe (1992)
Sorted Unification Using Set Constraints -
Witold Charatonik (1998)
An Undecidable Fragment of the Theory of Set ConstraintsInf. Process. Lett., 68
-
N. Heintze (1993)
Set Based Analysis of Arithmetic -
D. Kozen (1994)
Set Constraints and Logic Programming -
John Kodumal, A. Aiken (2005)
Banshee: A Scalable Constraint-Based Analysis Toolkit -
A. Cheng, D. Kozen (1996)
A Complete Gentzen-Style Axiomatization for Set Constraints -
Witold Charatonik (1994)
Set Constraints in Some Equational TheoriesInf. Comput., 142
-
J. Talbot, P. Devienne, S. Tison (2004)
Generalized Definite Set ConstraintsConstraints, 5
-
R. Givan, David McAllester, C. Witty, D. Kozen (1996)
Tarskian set constraintsProceedings 11th Annual IEEE Symposium on Logic in Computer Science
-
A. Aiken, D. Kozen, Moshe Vardi, E. Wimmers (1993)
The Complexity of Set Constraints -
Rémi Gilleron, S. Tison, M. Tommasi (1993)
Solving systems of set constraints with negated subset relationshipsProceedings of 1993 IEEE 34th Annual Foundations of Computer Science
-
W. Ackermann (1954)
Solvable Cases Of The Decision Problem -
Joachim Niehren, Martin Müller, J. Talbot (1999)
Entailment of atomic set constraints is PSPACE-completeProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
-
A. Aiken, E. Wimmers (1992)
Solving Systems of Set Constraints (Extended Abstract) -
L. Bachmair, H. Ganzinger, Uwe Waldmann (1993)
Set constraints are the monadic class[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
-
K. Stefánsson (1994)
Systems of set constraints with negative constraints are NEXPTIME-completeProceedings Ninth Annual IEEE Symposium on Logic in Computer Science
-
Witold Charatonik, J. Talbot (2002)
Atomic Set Constraints with Projection -
A. Aiken, D. Kozen, E. Wimmers (1994)
Decidability of Systems of Set Constraints with Negative ConstraintsInf. Comput., 122
-
Witold Charatonik (1999)
Automata on DAG representations of finite trees -
PACHOLSKI -
N. Heintze, J. Jaffar (1989)
A finite presentation theorem for approximating logic programs -
Witold Charatonik, A. Podelski (1996)
The Independence Property of a Class of Set Constraints -
D. Kozen (1995)
Rational Spaces and Set Constraints
- Publisher
- Association for Computing Machinery
- Copyright
- The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
- Subject
- Decision problems
- ISSN
- 0004-5411
- DOI
- 10.1145/1734213.1734217
- Publisher site
- See Article on Publisher Site
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.
Journal
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Apr 1, 2010