Abstract
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow infinite regular terms, so it seems natural to consider set constraints over this domain. In the paper we show that the satisfiability problem of set constraints over regular terms is undecidable. We also show that, if each function symbol has the arity at most 1, then this problem is EXPSPACE-complete.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aiken, A., Kozen, D., Vardi, M., Wimmers, E.L.: The complexity of set constraints. In: Proceedings of CSL 1993, pp. 1–17. Springer, Heidelberg (1993)
Aiken, A., Lakshman, T.K.: Directional type checking of logic programs. In: Charlier, B.L. (ed.) Proceedings of the First International Static Analysis Symposium, pp. 43–60. Springer, Heidelberg (1994)
Aiken, A., Lakshman, T.K., Wimmers, E.: Soft typing with conditional types. In: Proceedings of POPL 1994, pp. 163–173. ACM Press, New York (1994)
Aiken, A., Wimmers, E.: Solving systems of set constraints. In: Proceedings of LICS 1992, pp. 329–340. IEEE Computer Society Press, Los Alamitos (1992)
Bachmair, L., Ganzinger, H., Waldmann, U.: Set constraints are the monadic class. In: Proceedings of LICS 1993, pp. 75–83. IEEE Computer Society Press, Los Alamitos (1993)
Charatonik, W.: Automata on dag representations of finite trees, Tech. report, Max-Planck-Institut fr Informatik (1999)
Colmerauer, A.: Prolog II reference manual and theoretical model, Universite de la Mediterranee Aix-Marseille II (1982)
Charatonik, W., Pacholski, L.: Set constraints with projections are in NEXPTIME. In: FOCS 1994, pp. 642–653. IEEE Comp. Society Press, Los Alamitos (1994)
Charatonik, W., Podelski, A.: Set constraints with intersection. In: Proceedings of LICS 1997, pp. 362–372. IEEE Computer Society Press, Los Alamitos (1997)
Charatonik, W., Podelski, A.: Co-definite set constraints. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 211–225. Springer, Heidelberg (1998)
Charatonik, W., Podelski, A., Müller, M.: Set-based failure analysis for logic programs and concurrent constraint programs. In: Proceedings of the European Symposium on Programming, pp. 177–192. Springer, Heidelberg (1999)
Gilleron, R., Tison, S., Tommasi, M.: Solving systems of set constraints with negated subset relationships. In: Proceedings of FOCS 1993, pp. 372–380. IEEE Computer Society Press, Los Alamitos (1993)
Heintze, N., Jaffar, J.: A decision procedure for a class of set constraints. In: Proceedings of LICS 1990, pp. 42–51. IEEE Computer Society Press, Los Alamitos (1990)
Heintze, N., Jaffar, J.: Set constraints and set-based analysis. In: Proceedings of CP 1994, pp. 281–298. Springer, Heidelberg (1994)
Hopcroft, J., Ullman, J.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1979)
McAllester, D.A., Givan, R., Witty, C., Kozen, D.: Tarskian set constraints. LICS 1996, pp. 138–147. IEEE Computer Society Press, Los Alamitos (1996)
Wielemaker, J.: SWI-Prolog 5.1 reference manual (2003)
Wallace, M., Novello, S., Schimpf, J.: ECLiPSe: A Platform for Constraint Logic Programming. Tech. report, IC-Parc, Imperial College, London (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rychlikowski, P., Truderung, T. (2004). Set Constraints on Regular Terms. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-30124-0_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23024-3
Online ISBN: 978-3-540-30124-0
eBook Packages: Springer Book Archive