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 metadatas

Cited literature [18 references]  Display  Hide  Download

http://hal.univ-reunion.fr/hal-01922118
Contributor : Frédéric Mesnard <>
Submitted on : Wednesday, November 14, 2018 - 12:18:01 PM
Last modification on : Thursday, March 28, 2019 - 11:24:10 AM
Long-term archiving on : Friday, February 15, 2019 - 1:57:53 PM

File

paper-with-proofs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01922118, version 1

Collections

Citation

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

Share

Metrics

Record views

59

Files downloads

78