Concolic testing is a popular software verification technique based on a combination of concrete and symbolic execution. Its main focus is finding bugs and generating test cases with the aim of maximizing code coverage. A previous approach to concolic testing in logic programming was not sound because it only dealt with positive constraints (by means of substitutions) but could not represent negative constraints. In this paper, we present a novel framework for concolic testing of CLP programs that generalizes the previous technique. In the CLP setting, one can represent both positive and negative constraints in a natural way, thus giving rise to a sound and (potentially) more efficient technique. Defining verification and testing techniques for CLP programs is increasingly relevant since this framework is becoming popular as an intermediate representation to analyze programs written in other programming paradigms.

中文翻译：

---

CLP 中的 Concolic 测试

Concolic 测试是一种流行的软件验证技术，它结合了具体和符号执行。它的主要重点是发现错误并生成测试用例，以最大限度地提高代码覆盖率。以前在逻辑编程中进行 concolic 测试的方法并不可靠，因为它只处理正约束（通过替换），但不能表示负约束。在本文中，我们提出了一个用于 CLP 程序的 concolic 测试的新框架，该框架概括了以前的技术。在 CLP 设置中，可以以自然的方式表示正约束和负约束，从而产生一种健全且（可能）更有效的技术。