1 citations · 1 across the 5 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2023★ 1 cited
Symbolic Path-guided Test Cases for Models with Data and Time
Boutheina Bannour, Arnault Lapitre, Pascale Le Gall +1
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…
cs.FL2023
A Term-based Approach for Generating Finite Automata from Interaction Diagrams
Erwan Mahe, Boutheina Bannour, Christophe Gaston +2
Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach…