Concolic testing is a well-known validation technique for imperative and object oriented programs. In a previous paper, we have introduced an adaptation of this technique to logic programming. At the heart of our framework lies a specific procedure that we call “selective unification”. It is used to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads of some program clauses. In this paper, we show that the existing algorithm for selective unification is not complete in the presence of non-linear atoms. We then prove soundness and completeness for a restricted version of the problem where some atoms are required to be linear. We also consider concolic testing in the context of constraint logic programming and extend the notion of selective unification accordingly.

中文翻译：

---

（约束）逻辑编程中的选择性统一

Concolic测试是用于命令式和面向对象程序的众所周知的验证技术。在先前的论文中，我们介绍了该技术对逻辑编程的一种适应。我们框架的核心是一个特定的过程，我们称之为“选择性统一”。通过考虑原子可以与某些程序子句的开头统一的所有可能方式，它用于生成适当的运行时目标。在本文中，我们证明了在存在非线性原子的情况下，现有的用于选择统一的算法并不完整。然后，我们证明问题的受限版本的合理性和完备性，其中某些原子需要是线性的。我们还考虑在约束逻辑编程的上下文中进行conconic测试，并相应地扩展选择统一的概念。