An SMT-Based Concolic Testing Tool for Logic Programs

02/17/2020
by   Sophie Fortz, et al.
0

Concolic testing mixes symbolic and concrete execution to generate test cases covering paths effectively. Its benefits have been demonstrated for more than 15 years to test imperative programs. Other programming paradigms, like logic programming, have received less attention. In this paper, we present a concolic-based test generation method for logic programs. Our approach exploits SMT-solving for constraint resolution. We then describe the implementation of a concolic testing tool for Prolog and validate it on some selected benchmarks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2020

Concolic Testing in CLP

Concolic testing is a popular software verification technique based on a...
research
07/12/2019

Concolic Testing Heap-Manipulating Programs

Concolic testing is a test generation technique which works effectively ...
research
04/13/2018

Active Learning for Efficient Testing of Student Programs

In this work, we propose an automated method to identify semantic bugs i...
research
03/15/2023

Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving

Parametric time Petri nets with inhibitor arcs (PITPNs) support flexibil...
research
10/10/2020

Cuvée: Blending SMT-LIB with Programs and Weakest Preconditions

Cuvée is a program verification tool that reads SMT-LIB-like input files...
research
12/05/2017

On Benchmarking the Capability of Symbolic Execution Tools with Logic Bombs

Symbolic execution is an important software testing approach. It has bee...
research
02/01/2019

Practical Model-driven Data Generation for System Testing

The ability to generate test data is often a necessary prerequisite for ...

Please sign up or login with your details

Forgot password? Click here to reset