Symbolic Path-guided Test Cases for Models with Data and Time
Formal Languages and Automata Theory
2023-09-14 v1
Abstract
This paper focuses on generating test cases from timed symbolic transition systems. At the heart of the generation process are symbolic execution techniques on data and time. Test cases look like finite symbolic trees with verdicts on their leaves and are based on a user-specified finite symbolic path playing the role of a test purpose. Generated test cases handle data involved in time constraints and uninitialized parameters, leveraging the advantages of symbolic execution techniques.
Cite
@article{arxiv.2309.06840,
title = {Symbolic Path-guided Test Cases for Models with Data and Time},
author = {Boutheina Bannour and Arnault Lapitre and Pascale Le Gall and Thang Nguyen},
journal= {arXiv preprint arXiv:2309.06840},
year = {2023}
}