A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On the Completeness of Selective Unification in Concolic Testing of Logic Programs
[article]
2016
arXiv
pre-print
Preserved Fulltext
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
arXiv:1608.03054v1
fatcat:vkhf3v4wmjdevjmx4khyxyltca