Introducing a Pure Weight-Based Concept for Automatic Test Case Generators v4.1.pdf (945.83 kB)Download file
Introducing a Pure Weight-Based Concept for Automatic Test Case Generators
preprintposted on 2022-02-03, 23:00 authored by Franco BazzichiFranco Bazzichi
For decades, automatic test case generators driven by context-free grammars usually have adopted a derivation method designed to obtain the minimum set of shortest sentences.
Within this paper, a pure weight-based approach is described: such approach uniquely uses weights to select a rule while expanding a nonterminal symbol; we will assess how it is always possible to identify balanced weights which ensure the convergence of the process and we will see how the generated sentences are usually more complex than the shortest ones, and having additional chances to exercise the underlying system more extensively as confirmed by experimental results.
Email Address of Submitting Authorfranco.firstname.lastname@example.org
ORCID of Submitting Author0000-0001-8372-6082
Submitting Author's Institutionnone
Submitting Author's Country