Set constraints with projections are in NEXPTIME

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 642-653

  Charatonik, Witold ^a   Pacholski, Leszek ^a,b  

^a UNIVERSITY OF WROC AW   (Poland)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EXISTENCE OF A SOLUTIONS; GROUND TERMS; PROGRAM ANALYSIS; SET CONSTRAINTS; TYPE INFERENCES;

EID: 0002342535     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365727     Document Type: Conference Paper

References (18)

1. W. Ackermann. Solvable Cases of the Decision Problem. North-Holland, Amsterdam, 1954.
2. A. Aiken, D. Kozen, M. Vardi, and E. L. Wimmers. The complexity of set constraints. In Computer Science Logic'93, LNCS 832, pages 1-17. Springer-Verlag, 1994.
3. A. Aiken, D. Kozen, and E. L. Wimmers. Decidability of systems of set constraints with negative constraints. Technical Report 93-1362, Computer Science Department, Cornell University, June 1993.
4. A. Aiken and B. Murphy. Implementing regular tree expressions. In ACM Conference on Functional Programming Languages and Computer Architecture, pages 427-447, August 1991.
5. A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 279-290, January 1991.
6. A. Aiken and E. L. Wimmers. Solving systems of set constraints (extended abstract). In Seventh Annual IEEE Symposium on Logic in Computer Science, pages 329-340, 1992.
7. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Eight Annual IEEE Symposium on Logic in Computer Science, pages 75-83, 1993.
8. W. Charatonik and L. Pacholski. Negative set constraints with equality. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 128-136, July 1994.
9. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In 10th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 665, pages 505-514. Springer-Verlag, 1993.
10. th Symp. on Foundations of Computer Science, pages 372-380, 1993. A full version Technical report IT 247, Laboratoire d'Informatique Fondamentale de Lille.
11. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints (extended abstract). In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 42-51, 1990.
12. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197-209, January 1990.
13. N. D. Jones and S. S. Muchnick. Flow analysis and optimization of lisp-like structures. In Sixth Annual ACM Symposium on Principles of Programming Languages, pages 244-256, January 1979.
14. D. Kozen. Logical aspects of set constraints. In Computer Science Logic'93, volume 832 of LNCS, pages 175-188, 1994.
15. P. Mishra and U. Reddy. Declaration-free type checking. In Twelfth Annual ACM Symposium on the Principles of Programming Languages, pages 7-21, 1985.
16. J. C. Reynolds. Automatic computation of data set definitions. Information Processing, 68:456-461, 1969.
17. K. Stefansson. Systems of set constraints with negative constraints are NEXPTIME-complete. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 137-141, 1994.
18. J. Young and P. O'Keefe. Experience with a type evaluator. In D. Bj0rner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573-581. North-Holland, 1988.