Excavating
Patent
1996-12-13
1998-11-03
Tu, Trinh L.
Excavating
395500, G01R 3128, G06F 300
Patent
active
058319980
ABSTRACT:
A new method of testcase optimization for generating testcases is provided which is both efficient and effective. A 2-level heuristic is employed. The method is iterative, and at each iteration, at the first level of the heuristic, a greedy algorithm is used to select a testcase which covers the largest number of uncovered interactions from a remaining set of uncovered interactions. The second level heuristic consists of a simulation step which is employed at each iteration. Rather than conducting the greedy algorithm over an entire test domain, during each iteration the algorithm is applied over a randomly selected set of testcases. The method is efficient in the sense that a quasi-optimal number of testcases is generated which covers the most interactions with close to the fewest number of testcases. The method is effective in the sense that 100% coverage of all possible interactions is guaranteed. The method is generic in that it can be applied to any complex testing and verification task regardless of its domain.
REFERENCES:
patent: 4935877 (1990-06-01), Koza
patent: 5485471 (1996-01-01), Bershteyn
patent: 5542043 (1996-07-01), Cohen et al.
patent: 5604895 (1997-02-01), Raimi
patent: 5664171 (1997-09-01), Agrawal et al.
patent: 5724504 (1998-03-01), Aharon et al.
M. S. Phadke, "Quality Engineering Using Robust Design", AT&T Bell Labs, (1989), pp. 41-65 & 149-182.
B. Korte, "Approximative Algorithms for Discrete Optimization Problems", Annuals of Discrete Mathematics, vol. 4, (1979), pp. 85-120.
Northern Telecom Limited
Tu Trinh L.
LandOfFree
Method of testcase optimization does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of testcase optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of testcase optimization will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-698332