An SMT-based concolic testing tool for logic programs

DOI10.1007/978-3-030-59025-3_13OpenAlexW3020673255MaRDI QIDQ2039953

Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal, Fred Mesnard, Sophie Fortz

Publication date: 6 July 2021

Full work available at URL: https://arxiv.org/abs/2002.07115

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Related Items

Testing your (static analysis) truths

Cites Work

• On the completeness of selective unification in concolic testing of logic programs
• SWI-Prolog
• Concolic Execution and Test Case Generation in Prolog
• Concolic testing in logic programming
• A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
• Selective Unification in (Constraint) Logic Programming*
• Concolic Testing in CLP
• Fast unfolding of communities in large networks