Measuring Coverage of Prolog Programs Using Mutation Testing

August 23, 2018 Β· Declared Dead Β· πŸ› Workshop on Functional and Constraint Logic Programming

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexandros Efremidis, Joshua Schmidt, Sebastian Krings, Philipp KΓΆrner arXiv ID 1808.07725 Category cs.PL: Programming Languages Cross-listed cs.LO Citations 7 Venue Workshop on Functional and Constraint Logic Programming Last Checked 3 months ago
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 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted