Answer-set programming as a new approach to event-sequence testing

Erdem, Esra and Inoue, Katsumi and Oetsch, Johannes and Pührer, Jörg and Tompits, Hans and Yılmaz, Cemal (2011) Answer-set programming as a new approach to event-sequence testing. In: International Conference on Advances in System Testing and Validation Lifecycle, (Accepted/In Press)

[thumbnail of VALID2011.pdf] PDF

Download (376kB)


In many applications, faults are triggered by events that occur in a particular order. Based on the assumption that most bugs are caused by the interaction of a low number of events, Kuhn et al. recently introduced sequence covering arrays (SCAs) as suitable designs for event sequence testing. In practice, directly applying SCAs for testing is often impaired by additional constraints, and SCAs have to be adapted to fit application-specific needs. Modifying precomputed SCAs to account for problem variations can be problematic, if not impossible, and developing dedicated algorithms is costly. In this paper, we propose answer-set programming (ASP), a well-known knowledge-representation formalism from the area of artificial intelligence based on logic programming, as a declarative paradigm for computing SCAs. Our approach allows to concisely state complex coverage criteria in an elaboration tolerant way, i.e., small variations of a problem specification require only small modifications of the ASP representation.
Item Type: Papers in Conference Proceedings
Subjects: Q Science > Q Science (General)
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Cemal Yılmaz
Date Deposited: 20 Sep 2011 16:17
Last Modified: 26 Apr 2022 09:01

Actions (login required)

View Item
View Item