Smoke Test Planning using Answer Set Programming: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Thomas Feller (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Irina Dragoste (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
Zeile 10: | Zeile 10: | ||
|Raum=online | |Raum=online | ||
|Vortragender=Valentin Roland | |Vortragender=Valentin Roland | ||
|Event series=Research Seminar Logic and AI | |Event series=Research Seminar Logic and AI | ||
|In News anzeigen=1 | |In News anzeigen=1 | ||
}} | }} |
Aktuelle Version vom 10. September 2020, 14:16 Uhr
Smoke Test Planning using Answer Set Programming
Vortrag von Valentin Roland
- Veranstaltungsort: online
- Beginn: 10. September 2020 um 13:00
- Ende: 10. September 2020 um 14:30
- Event series: Research Seminar Logic and AI
- iCal
Smoke testing is an important method to increase stability and reliability of hardware-depending systems. Due to concurrent access to the same physical resource and the impracticality of the use of virtualization, smoke testing requires some form of planning. In this paper, we propose to decompose test cases in terms of atomic actions consisting of preconditions and effects. We present a solution based on answer set programming with multi-shot solving that automatically generates short parallel test plans. Experiments suggest that the approach is feasible for non-inherently sequential test cases and scales up to thousands of test cases.