Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1993: Computer Science Logic pp 1–17Cite as

The complexity of set constraints

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 832))

Abstract

Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. We present several results on the computational complexity of solving systems of set constraints. The systems we study form a natural complexity hierarchy depending on the form of the constraint language.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aiken, D. Kozen, M. Vardi, and E. Wimmers, The complexity of set constraints. Technical Report 93-1352, Computer Science Department, Cornell University, May 1993.

    Google Scholar 

  2. A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Technical Report 93-1362, Computer Science Department, Cornell University, June 1993.

    Google Scholar 

  3. A. Aiken and B. Murphy. Implementing regular tree expressions. In Proc. 1991 Conf. Functional Programming Languages and Computer Architecture, pages 427–447, August 1991.

    Google Scholar 

  4. A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Proc. 18th Symp. Principles of Programming Languages, pages 279–290. ACM, January 1991.

    Google Scholar 

  5. A. Aiken and E. Wimmers. Solving systems of set constraints. In Proc. 7th Symp. Logic in Computer Science, pages 329–340. IEEE, June 1992.

    Google Scholar 

  6. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Proc. 8th Symp. Logic in Computer Science, pages 75–83. IEEE, June 1993.

    Google Scholar 

  7. J. A. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci., 10:19–35, 1980.

    Article  MathSciNet  Google Scholar 

  8. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J. Assoc. Comput. Mach., 28(1):114–133, 1981.

    MathSciNet  Google Scholar 

  9. W. Charatonik and L. Pacholski. Negative set constraints with equality. In Proc. 9th Symp. Logic in Computer Science. IEEE, July 1994. To appear. Also, Max-Planck-Institut für Informatik Technical Report MPI-I-93-265.

    Google Scholar 

  10. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In Proc. Symp. Theor. Aspects of Comput. Sci., volume 665, pages 505–514. Springer-Verlag Lect. Notes in Comput. Sci., February 1993.

    MathSciNet  Google Scholar 

  11. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proc. 34th Symp. Foundations of Comput. Sci., pages 372–380. IEEE, November 1993.

    Google Scholar 

  12. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints. In Proc. 5th Symp. Logic in Computer Science, pages 42–51. IEEE, June 1990.

    Google Scholar 

  13. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Proc. 17th Symp. Principles of Programming Languages, pages 197–209. ACM, January 1990.

    Google Scholar 

  14. N. D. Jones and S. S. Muchnick. Flow analysis and optimization of LISP-like structures. In Proc. 6th Symp. Principles of Programming Languages, pages 244–256. ACM, January 1979.

    Google Scholar 

  15. K. Marriott and M. Odersky. Systems of negative boolean constraints. Technical Report YALEU/DCS/RR-900, Computer Science Department, Yale University, April 1992.

    Google Scholar 

  16. P. Mishra. Towards a theory of types in PROLOG. In Proc. 1st Symp. Logic Programming, pages 289–298. IEEE, 1984.

    Google Scholar 

  17. P. Mishra and U. Reddy. Declaration-free type checking. In Proc. 12th Symp. Principles of Programming Languages, pages 7–21. ACM, 1985.

    Google Scholar 

  18. J. C. Reynolds. Automatic computation of data set definitions. In Information Processing 68, pages 456–461. North-Holland, 1969.

    Google Scholar 

  19. K. Stefansson. Systems of set constraints with negative constraints are NEXPTIME-complete. In Proc. 9th Symp. Logic in Computer Science. IEEE, June 1994. To appear. Also Cornell University TR93-1380, August 1993.

    Google Scholar 

  20. J. Young and P. O'Keefe. Experience with a type evaluator. In D. Bjørner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573–581. North-Holland, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EECS Division, University of California, 94720, Berkeley, CA, USA

    Alexander Aiken

  2. Computer Science Department, Cornell University, 14853, Ithaca, NY, USA

    Dexter Kozen

  3. Computer Science Department, Rice University, 77251, Houston, TX, USA

    Moshe Vardi

  4. IBM Almaden Research Center, 650 Harry Road, 95120, San Jose, CA, USA

    Ed Wimmers

Authors
  1. Alexander Aiken
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dexter Kozen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Moshe Vardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ed Wimmers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Yuri Gurevich Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aiken, A., Kozen, D., Vardi, M., Wimmers, E. (1994). The complexity of set constraints. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049320

Download citation

  • DOI: https://doi.org/10.1007/BFb0049320

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58277-9

  • Online ISBN: 978-3-540-48599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation