| US 7,493,544 B2 | ||
| Extending test sequences to accepting states | ||
| Andreas Blass, Ann Arbor, Mich. (US); Colin L. Campbell, Seattle, Wash. (US); Lev Borisovich Nachmanson, Redmond, Wash. (US); Margus Veanes, Bellevue, Wash. (US); Michael Barnett, Seattle, Wash. (US); Nikolai Tillmann, Redmond, Wash. (US); Wolfgang Grieskamp, Redmond, Wash. (US); Wolfram Schulte, Bellevue, Wash. (US); and Yuri Gurevich, Redmond, Wash. (US) | ||
| Assigned to Microsoft Corporation, Redmond, Wash. (US) | ||
| Filed on Jan. 21, 2005, as Appl. No. 11/41,087. | ||
| Prior Publication US 2006/0179383 A1, Aug. 10, 2006 | ||
| Int. Cl. G06F 11/00 (2006.01) | ||
| U.S. Cl. 714—741 [714/742; 714/38; 717/100; 717/128; 717/124; 703/13; 703/23; 703/14; 703/15] | 20 Claims |
| 1. A computerized method comprising:
receiving a state space, a test suite, and an identified accepting state;
traversing the state space and assigning expected costs to states comprising the costs expected to reach the identified accepting
state;
using the assigned expected costs, creating a strategy comprising an indication of a transition to take from a present state;
determining test sequences in the test suite that terminate in states other than the identified accepting state; and
appending the determined test sequences with test segments obtained using the created strategy.
|