Concolic Testing in CLP

Abstract

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.

An SMT-Based Concolic Testing Tool for Logic Programs

“…Recently, concolic testing has been extended to CLP programs [7], so that both positive and negative constraints can be represented in a natural way. As future work, we plan to extend our concolic testing tool to the case of CLP programs.…”

Analysis and Transformation of Constrained Horn Clauses for Program Verification

“…The approach has been extended to TCG for concurrent programs (Albert et al 2018) by integrating partial-order reduction techniques for mitigating state space explosion. Concolic testing (Godefroid et al 2005), combining concrete and symbolic execution for TCG, has recently been applied to CLP programs (Mesnard et al 2020).…”