Skip to Main content Skip to Navigation
New interface
Conference papers

On the Completeness of Selective Unification in Concolic Testing of Logic Programs

Abstract : Concolic testing is a popular dynamic validation technique that can be used for both model checking and automatic test case generation. We have recently introduced concolic testing in the context of logic programming. In contrast to previous approaches, the key ingredient in this setting is a technique to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads of some program clauses. This is called “selective” unification. In this paper, we show that the existing algorithm is not complete and explore different alternatives in order to have a sound and complete algorithm for selective unification.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Réunion Univ Connect in order to contact the contributor
Submitted on : Monday, November 5, 2018 - 9:48:00 AM
Last modification on : Wednesday, November 3, 2021 - 6:03:14 AM
Long-term archiving on: : Wednesday, February 6, 2019 - 2:45:21 PM


Files produced by the author(s)


  • HAL Id : hal-01451698, version 1



Frédéric Mesnard, Etienne Payet, Germán Vidal. On the Completeness of Selective Unification in Concolic Testing of Logic Programs. 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR), Sep 2016, Edinburgh, United Kingdom. pp.205-221. ⟨hal-01451698⟩



Record views


Files downloads