2 papers
cs.SE2013
Random Grammar-based Testing for Covering All Non-Terminals
Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko
In the context of software testing, generating complex data inputs is frequently performed using a grammar-based specification. For combinatorial reasons, an exhaustive generation…
cs.FL2013
Enhancing Approximations for Regular Reachability Analysis
Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko
This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mecha…