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.
Type de document :
Communication dans un congrès
Manuel Hermenegildo; Pedro Lopez-Garcia. 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR), Sep 2016, Edinburgh, United Kingdom. Springer Verlag, Lecture notes in Computer Sciences, 10184, pp.205-221, 2016
Liste complète des métadonnées

http://hal.univ-reunion.fr/hal-01451698
Contributeur : Réunion Univ <>
Soumis le : lundi 5 novembre 2018 - 09:48:00
Dernière modification le : mardi 6 novembre 2018 - 01:16:58

Fichier

1608.03054.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01451698, version 1

Collections

Citation

Frédéric Mesnard, Etienne Payet, Germán Vidal. On the Completeness of Selective Unification in Concolic Testing of Logic Programs. Manuel Hermenegildo; Pedro Lopez-Garcia. 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR), Sep 2016, Edinburgh, United Kingdom. Springer Verlag, Lecture notes in Computer Sciences, 10184, pp.205-221, 2016. 〈hal-01451698〉

Partager

Métriques

Consultations de la notice

67

Téléchargements de fichiers

1