On the Completeness of Selective Unification in Concolic Testing of Logic Programs

Frédéric Mesnard; Etienne Payet; Germán Vidal

On the Completeness of Selective Unification in Concolic Testing of Logic Programs

Frédéric Mesnard ¹ Etienne Payet ¹ Germán Vidal ²

1 LIM - Laboratoire d'Informatique et de Mathématiques

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.

Document type :

Conference papers

Domain :

Computer Science [cs]

Complete list of metadatas

Cited literature [12 references] Display Hide Download

http://hal.univ-reunion.fr/hal-01451698
Contributor : Réunion Univ <>
Submitted on : Monday, November 5, 2018 - 9:48:00 AM
Last modification on : Thursday, March 28, 2019 - 11:24:10 AM
Long-term archiving on : Wednesday, February 6, 2019 - 2:45:21 PM

1608.03054.pdf

Files produced by the author(s)

On the Completeness of Selective Unification in Concolic Testing of Logic Programs

File

Identifiers

Collections

Citation

Export

Metrics

97

65

Contact

On the Completeness of Selective Unification in Concolic Testing of Logic Programs

File

Identifiers

Collections

Citation

Export

Share

Metrics

97

65

Contact