Random vs. structure-based testing of answer-set programs: an experimental comparison

  • Authors:
  • Tomi Janhunen;Ilkka Niemelä;Johannes Oetsch;Jörg Pührer;Hans Tompits

  • Affiliations:
  • Aalto University, Department of Information and Computer Science, Aalto, Finland;Aalto University, Department of Information and Computer Science, Aalto, Finland;Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria;Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria;Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria

  • Venue:
  • LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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 structurebased techniques catch faults with a high ratemore consistently also in these cases.