Abstrakti
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.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2011 |
Toimittajat | James Delgrande, Wolfgang Faber |
Kustantaja | Springer |
Sivut | 242-247 |
Sivumäärä | 6 |
ISBN (elektroninen) | 978-3-642-20895-9 |
ISBN (painettu) | 978-3-642-20894-2 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 2011 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisuussa |
Tapahtuma | International Conference on Logic Programming and Nonmonotonic Reasoning - Vancouver, Kanada Kesto: 16 toukok. 2011 → 19 toukok. 2011 Konferenssinumero: 11 |
Julkaisusarja
Nimi | Lecture Notes in Computer Science |
---|---|
Kustantaja | SPRINGER-VERLAG BERLIN |
Vuosikerta | 6645 |
ISSN (painettu) | 0302-9743 |
Conference
Conference | International Conference on Logic Programming and Nonmonotonic Reasoning |
---|---|
Lyhennettä | LPNMR |
Maa/Alue | Kanada |
Kaupunki | Vancouver |
Ajanjakso | 16/05/2011 → 19/05/2011 |