Set constraints: Results, applications and future directions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 874 LNCS, Issue , 1994, Pages 326-335

  Aiken, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

PROGRAM ANALYSIS; SET CONSTRAINTS; STATE OF THE ART;

CONSTRAINT THEORY;

EID: 84965037759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58601-6_110     Document Type: Conference Paper

References (27)

1. A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The complexity of set constraints. In Computer Science Logic '93, Swansea, Wales, September 1993. To appear.
2. A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Research Report RJ 9421, IBM, 1993.
3. A. Aiken and T.K. Lakshman. Directional type checking of logic programs. In Proceedings of the l st International Static Analysis Symposium, September 1994. To appear.
4. 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.
5. A. Aiken and E. Wimmers. Solving systems of set constraints. In Symposium on Logic in Computer Science, pages 329-340, June 1992.
6. A. Aiken and E. Wimmers. Type inclusion constraints and type inference. In Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture, pages 31-41, Copenhagen, Denmark, June 1993.
7. A. Aiken, E. Wimmers, and T.K. Lakshman. Soft typing with conditional types. In Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 163-173, Portland, Oregon, January 1994.
8. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Symposium on Logic in Computer Science, pages 75-83, June 1993.
9. W. Charatonik and L. Pacholski. Negative set constraints wtih equality: An easy proof of decidability. In Symposium on Logic in Computer Science, July 1994. To appear.
10. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Foundations of Computer Science, 1994. To appear.
11. F. M. Damm. Subtyping with union types, intersection types and recursive types. In Proceedings of the International Symposium on Theoretical Aspects of Computer Software. Springer-Verlag, April 1994. To appear.
12. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constrnints using tree automata. In Proceedings of the 10 th Annual Symposium on Theoretical Aspects of Computer Science, pages 505-514, 1992.
13. R. Gilleron, S. Tison, and M. Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. In Foundations of Computer Science, pages 372-380, November 1993.
14. N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, 1992.
15. N. Heintze. Set-based analysis of ML programs (extended abstract). In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, June 1994. To appear.
16. N. Heintze and J. Jatfar. A decision procedure for a class of Herbrand set constraints. In Symposium on Logic in Computer Science, pages 42-51, June 1990.
17. 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.
18. N. Heintze and J. Jaffar. Set-based program analysis. Draft manuscript, 1991.
19. N. Heintze and J. Jaffar. An engine for logic program analysis. In Symposium on Logic in Computer Science, pages 318-328, June 1992.
20. 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.
21. L. Löwenheim. Über möglichkeiten im relativkalkül. Math. Annalen, 76:228-251, 1915.
22. P. Mishra. Towards a theory of types in PROLOG. In Proceedings of the First IEEE Symposium in Logic Programming, pages 289-298, 1984.
23. P. Mishra and U. Reddy Declaration-free type checking. In Proceedings Of the Twelfth Annual ACM Symposium on the Principles of Programming Languages, pages 7-21, 1985.
24. J. C. Reynolds. Automatic Computation of Data Set Definitions, pages 456-461. Information Processing 68. North-Holland, 1969.
25. H. Seidl. Deciding equivalence of finite tree automata. SIAM Journal of Computing, 19(3):424-437, June 1990.
26. S. Thatte. Type inference with partial types. In Automata, Languages and Programming: 15th International Colloquium, pages 615-629. Springer-Verlag Lecture Notes in Computer Science, vol. 317, July 1988.
27. E. Wang and P. N. Hilfinger. Analysis of recursive types in Lisp-like languages. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, pages 216-225, June 1992.