Set constraints with projections are in NEXPTIME

Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. In this paper 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. This extends the result of A. Aiken, D. Kozen, and E.L. Wimmers (1993) and R. Gilleron, S. Tison, and M. Tommasi (1990) on decidability of negated set constraints and solves a problem that was open for several years.<<ETX>>

[1]  Joxan Jaffar,et al.  A finite presentation theorem for approximating logic programs , 1989, POPL '90.

[2]  Alexander Aiken,et al.  The Complexity of Set Constraints , 1993, CSL.

[3]  Neil D. Jones,et al.  Flow analysis and optimization of LISP-like structures , 1979, POPL.

[4]  Alexander Aiken,et al.  Implementing Regular Tree Expressions , 1991, FPCA.

[5]  K. Stefansson,et al.  Systems of set constraints with negative constraints are NEXPTIME-complete , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[6]  A. Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994 .

[7]  Dexter Kozen.  Logical Aspects of Set Constraints , 1993, CSL.

[8]  Prateek Mishra,et al.  Declaration-free type checking , 1985, POPL.

[9]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[10]  Alexander Aiken,et al.  Static type inference in a dynamically typed language , 1991, POPL '91.

[11]  Sophie Tison,et al.  Solving systems of set constraints with negated subset relationships , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Sophie Tison,et al.  Solving Systems of Set Constraints using Tree Automata , 1993, STACS.

[13]  Joxan Jaffar,et al.  A decision procedure for a class of set constraints , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[14]  John C. Reynolds,et al.  Automatic computation of data set definitions , 1968, IFIP Congress.

[15]  Harald Ganzinger,et al.  Set constraints are the monadic class , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[16]  Alex Aiken,et al.  Solving Systems of Set Constraints (Extended Abstract) , 1992, LICS 1992.

[17]  Alexander Aiken,et al.  Solving systems of set constraints , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[18]  Witold Charatonik,et al.  Negative set constraints with equality , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.