One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for
path-oriented test case generation based on binary search and describes a possible implementation.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32136 |
| Date | 08 November 2018 |
| Creators | Beydeda, Sami, Gruhn, Volker |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 0-7695-2020-0 |
Page generated in 0.0017 seconds