Measuring Coverage of Prolog Programs Using Mutation Testing

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Testing is an important aspect in professional software development, both to avoid and identify bugs as well as to increase maintainability. However, increasing the number of tests beyond a reasonable amount hinders development progress. To decide on the completeness of a test suite, many approaches to assert test coverage have been suggested. Yet, frameworks for logic programs remain scarce. In this paper, we introduce a framework for Prolog programs measuring test coverage using mutations. We elaborate on the main ideas of mutation testing and transfer them to logic programs.To do so, we discuss the usefulness of different mutations in the context of Prolog and empirically evaluate them in a new mutation testing framework on different examples.

Cite

CITATION STYLE

APA

Efremidis, A., Schmidt, J., Krings, S., & Körner, P. (2019). Measuring Coverage of Prolog Programs Using Mutation Testing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11285 LNCS, pp. 39–55). Springer Verlag. https://doi.org/10.1007/978-3-030-16202-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free