Talks and Poster Presentations (with Proceedings-Entry):
I. Niemelä, T. Janhunen, J. Oetsch, J. Puehrer, H. Tompits:
"On Testing Answer-Set Programs";
Talk: 19th European Conference on Artificial Intelligence,
- 2010-08-20; in: "19th European Conference on Artificial Intelligence (ECAI 2010)",
H. Coelho, R. Studer, M. Wooldridge (ed.);
Volume 215 of Frontiers in Artificial Intelligence and Applications (2010)
Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support the development of answer-set programs. In particular, systematic testing of programs, constituting an integral part of conventional software development, has not been discussed for ASP thus far.
In this paper, we fill this gap and develop notions enabling the structural testing of answer-set programs, i.e., we address testing based on test cases that are chosen with respect to the internal structure of a given answer-set program. More specifically, we introduce different notions of coverage that measure to what extent a collection of test inputs covers certain important structural components of the program. In particular, we introduce metrics corresponding to path and branch coverage from conventional testing. We also discuss complexity aspects of the considered notions and give strategies how test inputs that yield increasing (up to total) coverage can be automatically generated.
answer set programming, testing, software engineering, whitebox testing, structural testing
Electronic version of the publication:
Project Head Hans Tompits:
Softwareentwicklung in der Answer-Set Programmierung
Created from the Publication Database of the Vienna University of Technology.