[Back]


Talks and Poster Presentations (with Proceedings-Entry):

T. Janhunen, I. Niemelä, J. Oetsch, J. Puehrer, H. Tompits:
"Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison";
Talk: 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011), Vancouver, Canada; 05-16-2011 - 05-19-2011; in: "11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)", Springer, (2011), ISBN: 978-3-642-20894-2; 242 - 247.



English abstract:
Answer-set programming (ASP) is an established paradigm for declarative problem solving, yet comparably little work on testing of answer-set programs has been done so far. In a recent paper, foundations for structure-based testing of answer-set programs building on a number of coverage notions have been proposed. In this paper, we develop a framework for testing answer-set programs based on this work and study how good the structure-based approach to test input generation is compared to random test input generation. The results indicate that random testing is quite ineffective for some benchmarks, while structure-based techniques catch faults with a high rate more consistently also in these cases.

Keywords:
answer-set programming, structure-based testing, random testing


Electronic version of the publication:
http://publik.tuwien.ac.at/files/PubDat_200937.pdf



Related Projects:
Project Head Hans Tompits:
Softwareentwicklung in der Answer-Set Programmierung


Created from the Publication Database of the Vienna University of Technology.