On the completeness of selective unification in concolic testing of logic programs

DOI10.1007/978-3-319-63139-4_12zbMath1485.68038arXiv1608.03054OpenAlexW2542071944MaRDI QIDQ2409737

Étienne Payet, Germán Vidal, Fred Mesnard

Publication date: 13 October 2017

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

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (3)

Concolic Testing in CLP ⋮ An SMT-based concolic testing tool for logic programs ⋮ Selective Unification in (Constraint) Logic Programming*

This page was built for publication: On the completeness of selective unification in concolic testing of logic programs