.png){kind=icon}
.png){kind=icon}
Return
Transition Algebra for Software Testing
.png){kind=icon}
OA
AI
DOI：10.1109/TR.2021.3116054.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Model-based testing has been highlighted in the last few decades. Many improvements have been proposed for this testing method. One improvement is the use of extended regular expressions (EREs) for modeling software behavior, and then using the ERE model to generate test paths. To improve the theory of test generation based on the ERE model, this article presents an algebraic system, named transition algebra, by extending Kleene algebra. Eight operations and their corresponding operational properties, including basic and nonbasic operational properties, are designed for transition algebra, and all such properties are proven. Five examples are given to illustrate the use of ERE modeling and algebraic operations. To ensure the automatic generation of test paths from the ERE model, the article proves that any ERE model constructed by transition algebra can be converted to a set of transition sequences. Compared to Kleene algebra with tests, transition algebra has more operations to build a powerful ERE model and more operational properties to process the ERE model for the generation of test paths.
Keywords:
Algebra
Software
Erbium
Automata
Test pattern generators
Software testing
Computational modeling
Algebraic operation
extended regular expression (ERE)
model-based testing
software testing
transition algebra
Journal
IF:
5.7
Papers:
2.7K
Citations:
8.5K