Concolic testing in logic programming
From MaRDI portal
Publication:4593010
DOI10.1017/S1471068415000332zbMATH Open1379.68078arXiv1507.05454OpenAlexW3101423763MaRDI QIDQ4593010FDOQ4593010
Authors: Fred Mesnard, Étienne Payet, Germán Vidal 
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logic programming. In this paper, we introduce a systematic approach for dynamic testing that combines both concrete and symbolic execution. Our approach is fully automatic and guarantees full path coverage when it terminates. We prove some basic properties of our technique and illustrate its practical usefulness through a prototype implementation.
Full work available at URL: https://arxiv.org/abs/1507.05454
Recommendations
- Concolic execution and test case generation in Prolog
- Concolic testing in CLP
- An SMT-based concolic testing tool for logic programs
- Foundations of declarative testing in arbitrary logic programming
- Decidability of logic program semantics and applications to testing
- On the completeness of selective unification in concolic testing of logic programs
- A formal logic approach to constrained combinatorial testing
Cites Work
- SWI-Prolog
- An Efficient Unification Algorithm
- Symbolic execution and program testing
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
- An overview of Ciao and its design philosophy
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Concolic execution and test case generation in Prolog
- A linear operational semantics for termination and complexity analysis of ISO prolog
- Test case generation for object-oriented imperative languages in CLP
- SICStus Prolog -- the first 25 years
- Automatic Generation of Test Inputs for Mercury
Cited In (13)
- The application of hypergroups in symbolic executions and finite automata
- Selective Unification in (Constraint) Logic Programming*
- Concolic execution in functional programming by program instrumentation
- Fundamental Approaches to Software Engineering
- Sound and complete concolic testing for higher-order functions
- Concolic execution and test case generation in Prolog
- Concolic testing in CLP
- A random testing approach using pushdown automata
- An SMT-based concolic testing tool for logic programs
- Reversible debugging in logic programming
- Abstraction-driven concolic testing
- On the completeness of selective unification in concolic testing of logic programs
- Testing logic programs for local stratification
Uses Software
This page was built for publication: Concolic testing in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593010)
