Combinatorial Testing and Its Applications

Combinatorial Testing and Its Applications

Studies have shown that combinatorial testing can help programs detect hard-to-find software bugs that may not be revealed by test cases generated using other testing techniques. The first part of this talk focuses on traditional black-box requirements-based combinatorial testing. In particular, results and lessons learned from two real-life industry applications will be discussed, namely a control panel of a rail-road system and a Linux system. The second part extends the concept of combinatorial testing to a white-box structure-based setting. It will present an advanced coverage criterion, Combinatorial Decision Coverage, in conjunction with symbolic execution to achieve high coverage cost-effectively without suffering from potential space exploration. Finally, the lecture will explain how combinatorial testing can be applied to a graph-based methodology for testing IoT (Internet of Things).

About event

Admission is free of charge.

Event type
Prof. W. Eric Wong
4 May 2017, 18:00
auditorium T9:107, New Building CTU
Thákurova 9, Praha 6
Person responsible for the content of this page
Veronika Dvořáková,

Last modified: 2.5.2017, 16:44