Optimization of Combinatorial Testing by Incremental SAT Solving [Elektronisk resurs]
-
Yamada, Akihisa (författare)
-
8th IEEE International Conference on Software Testing, Verification and Validation, ICST 2015, Graz, Austria, 13 April 2015 through 17 April 2015
-
Kitamura, Takashi (författare)
-
Artho, Cyrille (författare)
-
Choi, Eun-Hye (författare)
-
Oiwa, Yutaka (författare)
-
Biere, Armin (författare)
- Publicerad: Institute of Electrical and Electronics Engineers (IEEE), 2015
- Engelska.
-
Serie: IEEE International Conference on Software Testing Verification and Validation Workshops, 2159-4848
-
Ingår i: 2015 IEEE 8th International Conference on Software Testing, Verification and Validation, ICST 2015 - Proceedings. ; 1-10
-
Läs hela texten
-
Läs hela texten
-
Läs hela texten
Sammanfattning
Ämnesord
Stäng
- Combinatorial testing aims at reducing the cost of software and system testing by reducing the number of test cases to be executed. We propose an approach for combinatorial testing that generates a set of test cases that is as small as possible, using incremental SAT solving. We present several search-space pruning techniques that further improve our approach. Experiments show a significant improvement of our approach over other SAT-based approaches, and considerable reduction of the number of test cases over other combinatorial testing tools.
Ämnesord
- Natural Sciences (hsv)
- Computer and Information Sciences (hsv)
- Computer Sciences (hsv)
- Naturvetenskap (hsv)
- Data- och informationsvetenskap (hsv)
- Datavetenskap (datalogi) (hsv)
Indexterm och SAB-rubrik
- Verification
- Combinatorial testing
- SAT-based
- SAT-solving
- Search space pruning
- System testing
- Test case
Inställningar
Hjälp
Uppgift om bibliotek saknas i LIBRIS
Kontakta ditt bibliotek, eller sök utanför LIBRIS. Se högermenyn.