The paper focuses on the automatic generating of the witnesses for the word equation satisfiability problem by means of specializing an interpreter which tests whether a composition of variable substitutions of a given word equation system produces its solution. We specialize such an interpreter w.r.t. the equation system, while the substitutions are unknown. We show that several variants of such interpreters, when specialized using the basic unfold/fold specialization methods, are able to construct the whole solution sets for some classes of the word equations whose left- and right-hand sides share variables. We prove that the specialization process wrt the constructed interpreters gives a simple syntactic criterion of the satisfiability of the equations considered, and show that the suggested approach can solve some equations not solvable by Z3str3 and CVC4, the widely-used SMT-solvers.

中文翻译：

---

程序专业化作为解决词方程的工具

本文着重于通过专门的解释器来自动生成词方程可满足性问题的证人，该解释器测试给定词方程系统的变量替换组合是否产生其解。我们专门用这样的解释器来编写方程系统，而替换是未知的。我们展示了这种解释器的几种变体，当使用基本的展开/折叠专业化方法进行专业化时，能够为左侧和右侧共享变量的某些词方程类构建整个解集。我们证明了构建解释器的专业化过程给出了所考虑方程的可满足性的简单句法标准，