P. A. Abdulla, M. F. Atig, Y. Chen, L. Holik, A. Rezine et al., String Constraints for Verification, Computer Aided Verification. CAV, vol.8559, 2014.

A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz, New results on rewrite-based satisfiability procedures, ACM Trans. Comput. Log, vol.10, issue.1, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00576862

F. Baader and T. Nipkow, Term Rewriting and All That, 1999.

F. Baader and K. U. Schulz, Unification in the union of disjoint equational theories: Combining decision procedures, Journal of Symbolic Computation, vol.21, issue.2, pp.211-243, 1996.

F. Baader and W. Snyder, Unification Theory, Handbook of Automated Reasoning, pp.445-532, 2001.

A. Colmerauer, An Introduction to Prolog III. 69-90, Communications of the ACM, vol.33, 1990.

R. Dabrowski and W. Plandowski, On Word Equations in One Variable, Algorithmica, vol.60, issue.4, pp.819-828, 2011.

V. Diekert, A. Jez, and W. Plandowski, Finding All Solutions of Equations in Free Groups and Monoids with Involution, Information and Computation, vol.251, pp.263-286, 2016.

J. V. Guttag, E. Horowitz, and D. R. Musser, Abstract Data Types and Software Validation. Commun, ACM, vol.21, issue.12, pp.1048-1064, 1978.

V. Ganesh, M. Minnes, A. Solar-lezama, and M. Rinard, Word Equations with Length Constraints: What is Decidable? In: Hardware and Software: Verification and Testing. HVC 2012, vol.7857, 2013.

P. Hibbs, Unification modulo common list functions. Doctoral Dissertation, 2015.

D. Kapur, Towards A Theory For Abstract Data Types. Doctoral Dissertation, 1980.

D. Kapur and D. R. Musser, Proof by Consistency, Artif. Intell, vol.31, issue.2, pp.125-157, 1987.

J. Karhumäki, Combinatorics on Words: A New Challenging Topic, p.12, 2004.

T. Liang, N. Tsiskaridze, A. Reynolds, C. Tinelli, and C. Barrett, A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings, Frontiers of Combining Systems. FroCoS, p.9322, 2015.

A. W. Lin and R. Majumdar, Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility, 2018.

K. Morita, Universality of a reversible two-counter machine, Theoretical Computer Science, vol.168, issue.2, pp.303-320, 1996.

D. R. Musser, Abstract Data Type Specification in the AFFIRM System, IEEE Trans. Software Eng, vol.6, issue.1, pp.24-32, 1980.

D. R. Musser, On Proving Inductive Properties of Abstract Data Types, Proceedings of the Seventh Annual ACM Symposium on Principles of Programming Languages (POPL, pp.154-162, 1980.

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979.

D. C. Oppen, Reasoning About Recursively Defined Data Structures, J. ACM, vol.27, issue.3, pp.403-411, 1980.

W. Plandowski, An Efficient Algorithm For Solving Word Equations, Proceedings of the ACM Symposium on the Theory of Computing '06, pp.467-476, 2006.

J. M. Robson and V. Diekert, On Quadratic Word Equations. STACS 1999: 217-226 Lecture Notes in Computer Science 1563, 1999.

R. E. Shostak, Deciding Combinations of Theories, J. ACM, vol.31, issue.1, pp.1-12, 1984.

K. U. Schulz, On Existential Theories of List Concatenation, Lecture Notes in Computer Science, vol.1994, pp.294-308, 1994.