DJPlus cuts test time by shrinking software test steps in graphs
DJPlus: Generating minimal test suites for strong coverage criteria in graph models
Software Engineering
Summary
Testing software using detailed maps called graphs helps find bugs but can take a long time because many test steps are needed. The team behind DJPlus created a method to make these test suites smaller while still checking everything important. Their approach works well on complex coverage goals and speeds up testing by removing repeated steps. Compared to other methods, DJPlus produces much shorter tests, saving time when checking real systems. This makes it easier to use advanced testing on large software projects.
model-based testinggraph coveragetest suiteedge-pair criterionprime path criteriontest optimizationtest execution timeredundant test steps
Authors
Yavuz Köroğlu, Mutlu Beyazıt, Onur Kılınççeker, Serge Demeyer, Franz Wotawa
Abstract
Automated test generation from graph models is essential to model-based testing. In this type of testing, graph coverage ensures test suite strength but also results in long test cases that take time to execute on the system under test. We propose a novel optimization-driven method, DJPlus, which generates reduced test suites while satisfying given graph-based test requirements. We implement DJPlus and show the feasibility of edge-pair criterion, a stronger coverage criterion than vertex or edge criteria, on four realistic systems, while prime path criterion poses scalability issues. Our evaluation reveals that the alternative methods generate 2 to 26 times more redundant test steps than DJPlus and DJPlus decreases test execution times by reducing the number of test steps. These results show that DJPlus is a positive step towards tackling the challenges of model-based testing at an industrial scale.