Introducing a Pure Weight-Based Concept for Automatic Test Case Generators

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.