Concolic Testing in CLP - Université de La Réunion Access content directly
Journal Articles Theory and Practice of Logic Programming Year : 2020

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.
Fichier principal
Vignette du fichier
2008.00421.pdf (274.5 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03064580 , version 1 (15-12-2020)

Identifiers

Cite

Frédéric Mesnard, Etienne Payet, Germán Vidal. Concolic Testing in CLP. Theory and Practice of Logic Programming, 2020, 20 (5), pp.671-686. ⟨10.1017/s1471068420000216⟩. ⟨hal-03064580⟩
81 View
66 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More