Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

https://hal.univ-reunion.fr/hal-03064580
Contributor : Réunion Univ <>
Submitted on : Tuesday, December 15, 2020 - 1:27:08 PM
Last modification on : Wednesday, June 30, 2021 - 9:40:08 PM
Long-term archiving on: : Tuesday, March 16, 2021 - 7:32:58 PM

File

2008.00421.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Fred Mesnard, Étienne Payet, Germán Vidal. Concolic Testing in CLP. Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2020, 20 (5), pp.671-686. ⟨10.1017/s1471068420000216⟩. ⟨hal-03064580⟩

Share

Metrics

Record views

53

Files downloads

20