HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Selective Unification in Constraint Logic Programming: Extended version with proofs

Abstract : Concolic testing is a well-known validation technique for imperative and object-oriented programs. We have recently introduced an adaptation of this technique to logic programming. At the heart of our framework for concolic testing lies a logic programming specific procedure that we call "selective unification". In this paper, we consider concolic testing in the context of constraint logic programming and extend the notion of selective unification accordingly. We prove that the selective unification problem is generally undecidable for constraint logic programs, and we present a correct and complete algorithm for selective unification in the context of a class of constraint structures.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

Contributor : Frédéric Mesnard Connect in order to contact the contributor
Submitted on : Wednesday, November 14, 2018 - 12:18:01 PM
Last modification on : Wednesday, November 3, 2021 - 4:27:09 AM
Long-term archiving on: : Friday, February 15, 2019 - 1:57:53 PM


Files produced by the author(s)


  • HAL Id : hal-01922118, version 1



Frédéric Mesnard, Etienne Payet, Germán Vidal. Selective Unification in Constraint Logic Programming: Extended version with proofs. 2018. ⟨hal-01922118⟩



Record views


Files downloads