@article{ ijas12,
  author = {Martin Brain and Esra Erdem and Katsumi Inoue and Johannes Oetsch and Joerg Puehrer and Hans Tompits and Cemal Yilmaz},
  title = {Event-Sequence Testing using Answer-Set Programming},
  journal = {International Journal On Advances in Software},
  volume = {5},
  number = {3--4},
  pages = {237--251},
  year = {2012},
  ee = {http://www.iariajournals.org/software/soft_v5_n34_2012_paged.pdf},
  abstract = {In many applications, faults are triggered by
events that occur in a particular order. In fact, many bugs
are caused by the interaction of only a low number of such
events. Based on this assumption, sequence covering arrays
(SCAs) have recently been proposed 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-specifc needs. Modifying
precomputed SCAs to account for problem variations can
be problematic, if not impossible, and developing dedicated
algorithms is costly. In this article, 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. Employing ASP for computing SCAs is
further justified by new complexity results related to 
event-sequence testing that are established in this work.
}
}

{"_id":{"_str":"53424e050e946d920a000699"},"__v":1,"authorIDs":["5456f0758b01c81930000081"],"author_short":["Brain, M.","Erdem, E.","Inoue, K.","Oetsch, J.","Puehrer, J.","Tompits, H.","Yilmaz, C."],"bibbaseid":"brain-erdem-inoue-oetsch-puehrer-tompits-yilmaz-eventsequencetestingusinganswersetprogramming-2012","bibdata":{"abstract":"In many applications, faults are triggered by events that occur in a particular order. In fact, many bugs are caused by the interaction of only a low number of such events. Based on this assumption, sequence covering arrays (SCAs) have recently been proposed 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-specifc needs. Modifying precomputed SCAs to account for problem variations can be problematic, if not impossible, and developing dedicated algorithms is costly. In this article, 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. Employing ASP for computing SCAs is further justified by new complexity results related to event-sequence testing that are established in this work.","author":["Brain, Martin","Erdem, Esra","Inoue, Katsumi","Oetsch, Johannes","Puehrer, Joerg","Tompits, Hans","Yilmaz, Cemal"],"author_short":["Brain, M.","Erdem, E.","Inoue, K.","Oetsch, J.","Puehrer, J.","Tompits, H.","Yilmaz, C."],"bibtex":"@article{ ijas12,\n author = {Martin Brain and Esra Erdem and Katsumi Inoue and Johannes Oetsch and Joerg Puehrer and Hans Tompits and Cemal Yilmaz},\n title = {Event-Sequence Testing using Answer-Set Programming},\n journal = {International Journal On Advances in Software},\n volume = {5},\n number = {3--4},\n pages = {237--251},\n year = {2012},\n ee = {http://www.iariajournals.org/software/soft_v5_n34_2012_paged.pdf},\n abstract = {In many applications, faults are triggered by\nevents that occur in a particular order. In fact, many bugs\nare caused by the interaction of only a low number of such\nevents. Based on this assumption, sequence covering arrays\n(SCAs) have recently been proposed as suitable designs for\nevent sequence testing. In practice, directly applying SCAs for\ntesting is often impaired by additional constraints, and SCAs\nhave to be adapted to fit application-specifc needs. Modifying\nprecomputed SCAs to account for problem variations can\nbe problematic, if not impossible, and developing dedicated\nalgorithms is costly. In this article, we propose answer-set\nprogramming (ASP), a well-known knowledge-representation\nformalism from the area of artificial intelligence based on\nlogic programming, as a declarative paradigm for computing\nSCAs. Our approach allows to concisely state complex coverage\ncriteria in an elaboration tolerant way, i.e., small variations of\na problem specification require only small modifications of the\nASP representation. Employing ASP for computing SCAs is\nfurther justified by new complexity results related to \nevent-sequence testing that are established in this work.\n}\n}","bibtype":"article","ee":"http://www.iariajournals.org/software/soft_v5_n34_2012_paged.pdf","id":"ijas12","journal":"International Journal On Advances in Software","key":"ijas12","number":"3--4","pages":"237--251","title":"Event-Sequence Testing using Answer-Set Programming","type":"article","volume":"5","year":"2012","bibbaseid":"brain-erdem-inoue-oetsch-puehrer-tompits-yilmaz-eventsequencetestingusinganswersetprogramming-2012","role":"author","urls":{"Link":"http://www.iariajournals.org/software/soft_v5_n34_2012_paged.pdf"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://193.255.135.175/papers/krrpublications.bib","downloads":0,"keywords":[],"search_terms":["event","sequence","testing","using","answer","set","programming","brain","erdem","inoue","oetsch","puehrer","tompits","yilmaz"],"title":"Event-Sequence Testing using Answer-Set Programming","year":2012,"dataSources":["WeBGfagwiP89ve7hM"]}