On the Completeness of Selective Unification in Concolic Testing of Logic Programs - Université de La Réunion Access content directly
Conference Papers Year : 2016

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

Dates and versions

hal-01451698 , version 1 (05-11-2018)

Identifiers

  • HAL Id : hal-01451698 , version 1

Cite

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⟩
87 View
123 Download

Share

Gmail Mastodon Facebook X LinkedIn More