Concolic Testing in CLP
From MaRDI portal
Publication:5140007
DOI10.1017/S1471068420000216zbMath1468.68055arXiv2008.00421MaRDI QIDQ5140007
Fred Mesnard, Germán Vidal, Étienne Payet
Publication date: 13 December 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.00421
Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)
Related Items
Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ An SMT-based concolic testing tool for logic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the completeness of selective unification in concolic testing of logic programs
- Concolic Execution and Test Case Generation in Prolog
- Partial evaluation in logic programming
- Symbolic execution and program testing
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Horn clauses as an intermediate representation for program analysis and transformation
- Concolic testing in logic programming
- A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
- Towards Typed Prolog
- Concolic Execution in Functional Programming by Program Instrumentation
This page was built for publication: Concolic Testing in CLP