1. Lecture Notes in Computer Science;J Alglave,2013
2. Lecture Notes in Computer Science;S Anand,2007
3. Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Frontiers in Artificial Intelligence and Applications, vol. 185, chap. 26, pp. 825–885. IOS Press, February 2009
4. Frontiers in Artificial Intelligence and Applications,2009
5. Chen, T., Chen, Y., Hague, M., Lin, A.W., Wu, Z.: What is decidable about string constraints with the ReplaceAll function. PACMPL 2(POPL), 3:1–3:29 (2018).
https://doi.org/10.1145/3158091