Set Constraints and Automata

Information and Computation

Volumn 149, Issue 1, 1999, Pages 1-41

  Gilleron, Rémi ^a   Tison, Sophie ^a   Tommasi, Marc ^a  

^a UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004479469     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2747     Document Type: Article

References (34)

1. Aiken, A., Kozen, D., Vardi, M., and Wimmers, E. (1993), The complexity of set constraints, in "Proceedings of Computer Science Logic," LNCS 832, pp. 1-17. [Also, Technical Report 93-1352, Cornell University]
2. Aiken, A., Kozen, D., Vardi, M., and Wimmers, E. (1993), The complexity of set constraints, in "Proceedings of Computer Science Logic," LNCS 832, pp. 1-17. [Also, Technical Report 93-1352, Cornell University]
3. Aiken, A., Kozen, D., and Wimmers, E. (1995), Decidability of systems of set constraints with negative constraints, Inform. and Comput. 122(1), 30-44.
4. Aiken, A., and Murphy, B. R. (1991), Implementing regular tree expressions, in "Proceedings of the ACM Conf. on Functional Programming Languages and Computer Architecture," pp. 427-447.
5. Aiken, A., and Wimmers, E. (1992), Solving systems of set constraints, in "Proc., 7th Annual IEEE Symposium on Logic in Computer Science," pp. 329-340, IEEE Computer Society Press, Los Alamitos, CA.
6. Bachmair, L., Ganzinger, H., and Waldmann, U. (1993), Set constraints are the monadic class, in "Proceedings, Eight Annual IEEE Symposium on Logic in Computer Science," pp. 75-83, IEEE Computer Society Press, Los Alamitos, CA.
7. Charatonik, W., and Pacholski, L. (1994a), Negative set constraints with equality, in "Proc., 9th Annual IEEE Symposium on Logic in Computer Science," pp. 128-136, IEEE Computer Society Press, Los Alamitos, CA.
8. Charatonik, W., and Pacholski, L. (1994b), Set constraints with projections are in NEXPTIME, in "Proceedings of the 35th Symp. Foundations of Computer Science," pp. 642-653.
9. Charatonik, W., and Podelski, A. (1997), Set Constraints with intersection, in "Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science," IEEE Computer Society Press, pp. 362-372, Los Alamitos, CA.
10. Cheng, A., and Kozen, D. (1996), A complete Gentzen-style axiomatization for set constraints, in "Proceedings, International Colloquium Automata Languages and Programming," Lecture Notes in Computer Science, Vol. 1099, pp. 134-145.
11. Comon, H. (1990), Equational formulas on order-sorted algebras, in "Proceedings, International Colloquium Automata Languages and Programming," Lecture Notes in Computer Science, Vol. 443, pp. 674-688.
12. Devienne, P., Talbot, J., and Tison, S. (1997), Solving classes of set constraints with tree automata, in "Proceedings of the 3th International Conference on Principles and Practice of Constraint Programming" (G. Smolka, Ed.), Lecture Notes in Computer Science, No. 1330, pp. 62-76.
13. Gilleron, R., Tison, S., and Tommasi, M. (1993), Solving systems of set constraints with negated subset relationships, in "Proceedings of the 34th Symp. on Foundations of Computer Science," pp. 372-380.
14. Gilleron, R., Tison, S., and Tommasi, M. (1994). Some new decidability results on positive and negative set constraints, in "Proc., 1st Int. Conf. on Constraints in Computational Logics," Vol. 845, pp. 336-351, Lecture Notes in Computer Science, Springer-Verlag, Berlin.
15. Heintze, N. (1992), "Set Based Program Analysis," Ph.D. thesis, Carnegie Mellon University.
16. Heintze, N., and Jaffar, J. (1990a), A decision procedure for a class of set constraints, in "Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science," pp. 42-51, IEEE Computer Society Press, Los Alamitos, CA.
17. Heintze, N., and Jaffar, J. (1990b), A finite presentation theorem for approximating logic programs, in "Proceedings of the 17th ACM Symp. on Principles of Programming Languages," pp. 197-209. [Full version in the IBM Tech. Rep. RC 16089 (no. 71415)]
18. Heintze, N., and Jaffar, J. (1990b), A finite presentation theorem for approximating logic programs, in "Proceedings of the 17th ACM Symp. on Principles of Programming Languages," pp. 197-209. [Full version in the IBM Tech. Rep. RC 16089 (no. 71415)]
19. Heintze, N., and Jaffar, J. (1992), An engine for logic program analysis, in "Proc., 7th Annual IEEE Symposium on Logic in Computer Science," pp. 318-328, IEEE Computer Society Press, Los Alamitos, CA.
20. Jones, N., and Muchnick, S. (1979), Flow analysis and optimization of LISP-like structures, in "Proceedings of the 6th ACM Symposium on Principles of Programming Languages," pp. 244-246.
21. Kozen, D. (1993), Logical aspects of set constraints, in "Proc. of Computer Science Logic," Vol. 832, pp. 175-188, Lecture Notes in Computer Science, Springer-Verlag, Berlin.
22. Kozen, D. (1994), Set constraints and logic programming, in "Proc. 1st Int. Conf. on Constraints in Computational Logics," p. 302, LNCS 845, Springer-Verlag, Berlin. [Also, Inform. and Comput. 142(1), 2-25.]
23. Kozen, D. (1994), Set constraints and logic programming, in "Proc. 1st Int. Conf. on Constraints in Computational Logics," p. 302, LNCS 845, Springer-Verlag, Berlin. [Also, Inform. and Comput. 142(1), 2-25.]
24. Kozen, D. (1995), Rational spaces and set constraints, in "Proceedings of the 6th International Joint Conference on Theory and Practice of Software Development," Lecture Notes in Computer Science, Vol. 915, pp. 42-61.
25. McAllester, D., Givan, R., Kozen, D., and Witty, C. (1996), Tarskian set constraints, in "Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science," pp. 138-141, IEEE Computer Society Press, Los Alamitos, CA.
26. Mishra, P. (1984), Towards a theory of types in PROLOG, in "Proceedings of the 1st IEEE Symposium on Logic Programming, Atlantic City," pp. 456-461.
27. Rabin, M. (1969), Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, 1-35.
28. Reynolds, J. (1969), Automatic computation of data set definition, Inform. Process. 68, 456-461.
29. Seynhaeve, F. (1994), "Contraintes Ensemblistes," Master's thesis, LIFL, Université de Lille 1.
30. Seynhaeve, F., Tommasi, M., and Treinen, R. (1997), Grid structures and undecidable constraint theories, in "Proceedings of the 7th International Joint Conference on Theory and Practice of Software Development" (M. Bidoit and M. Dauchet, Eds.), Lecture Notes in Computer Science, Vol. 1214, pp. 357-368, Springer-Verlag, Berlin.
31. Stefansson, K. (1994), Systems of set constraints with negative constraints are nexptime-complete, in "Proc., 9th Annual IEEE Symposium on Logic in Computer Science," pp. 137-141, IEEE Computer Society Press, Los Alamitos, CA.
32. Taitslin, M. (1968), Some further examples of undecidable theories, Algebra and Logic 7, 127-129. [Original paper (in Russian) in Algebra i Logica 6(3):105-111, 1967]
33. Taitslin, M. (1968), Some further examples of undecidable theories, Algebra and Logic 7, 127-129. [Original paper (in Russian) in Algebra i Logica 6(3):105-111, 1967]
34. Thomas, W. (1990), Automata on infinite objects, in "Handbook of Theoretical Computer Science," Volume B, pp. 134-191, Elsevier, Amsterdam.