The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 15, 2009

Filed:

Jan. 15, 2004
Applicants:

Lev Borisovich Nachmanson, Redmond, WA (US);

Margus Veanes, Bellevue, WA (US);

Wolfgang Grieskamp, Redmond, WA (US);

Nikolai Tillmann, Redmond, WA (US);

Inventors:

Lev Borisovich Nachmanson, Redmond, WA (US);

Margus Veanes, Bellevue, WA (US);

Wolfgang Grieskamp, Redmond, WA (US);

Nikolai Tillmann, Redmond, WA (US);

Assignee:

Microsoft Corporation, Redmond, WA (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 9/45 (2006.01); G06F 9/44 (2006.01); G06F 11/00 (2006.01);
U.S. Cl.
CPC ...
Abstract

A computerized method creates test coverage for non-deterministic programs. The method receives a graph of edges and states representing a program under test, and creates a continuous cycle of edges that reaches each edge in the graph at least once. In one example, the method splits the continuous cycle into discrete sequences that end at edges reaching non-deterministic nodes in the graph, and verifies that the executing program conforms to the behavior represented by the discrete sequences. In another example, a method creates probabilistic strategies for reaching one or more vertices in a non-deterministic graph. The strategies provide a graph path with a high probability of reaching a desired vertex.


Find Patent Forward Citations

Loading…