Concolic testing in logic programming
From MaRDI portal
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.
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
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
- A linear operational semantics for termination and complexity analysis of ISO prolog
- An Efficient Unification Algorithm
- An overview of Ciao and its design philosophy
- Automatic Generation of Test Inputs for Mercury
- Concolic execution and test case generation in Prolog
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- SICStus Prolog -- the first 25 years
- SWI-Prolog
- Symbolic execution and program testing
- Test case generation for object-oriented imperative languages in CLP
- The execution algorithm of mercury, an efficient purely declarative logic programming language
Cited in
(13)- Testing logic programs for local stratification
- An SMT-based concolic testing tool for logic programs
- The application of hypergroups in symbolic executions and finite automata
- Sound and complete concolic testing for higher-order functions
- On the completeness of selective unification in concolic testing of logic programs
- Abstraction-driven concolic testing
- Concolic execution and test case generation in Prolog
- A random testing approach using pushdown automata
- Selective Unification in (Constraint) Logic Programming*
- Concolic testing in CLP
- Fundamental Approaches to Software Engineering
- Concolic execution in functional programming by program instrumentation
- Reversible debugging in logic programming
Describes a project that uses
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)
