Selective Unification in Constraint Logic Programming - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Selective Unification in Constraint Logic Programming

(1) , (1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
paper-with-proofs.pdf (513.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01922118 , version 1 (14-11-2018)

Identifiers

  • HAL Id : hal-01922118 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More