Microsoft Technology Licensing, LLC

James R Tierney

Dimitris Achlioptas

Christian Herwarth Borgs

Jennifer Tour Chayes

Henry J Robinson

Noel Richard Cross

Methods and systems of testing software and modeling user actions are described. In some embodiments, multiple different algorithms are provided for operating on a software model. The software model describes behavior associated with software that is to be tested. Different sets of algorithms can be selected for operating on the software model to produce a sequence of test actions that are to be used to test the software. The algorithms can be mixed and matched to achieve a desired testing result. In some embodiments, the different algorithms comprise deterministic algorithms, random algorithms, and various types of algorithms therebetween. In one embodiment, the software model comprises a state graph having nodes that represent state, and links between the nodes that represent actions. The different algorithms that are available for selection can have different graph traversal characteristics such that the state graph can be traversed in different manners.

Methods and systems of testing software, and methods and systems of modeling user behavior

Methods and systems of testing software and modeling user actions are described. In some embodiments, multiple different algorithms are provided for operating on a software model. The software model describes behavior associated with software that is to be tested. Different sets of algorithms can be selected for operating on the software model to produce a sequence of test actions that are to be used to test the software. The algorithms can be mixed and matched to achieve a desired testing result. In some embodiments, the different algorithms comprise deterministic algorithms, random algorithms, and various types of algorithms therebetween. In one embodiment, the software model comprises a state graph having nodes that represent state, and links between the nodes that represent actions. The different algorithms that are available for selection can have different graph traversal characteristics such that the state graph can be traversed in different manners. For example, algorithms that are more local in their traversals can be teamed with algorithms that are more global in their traversals, thus covering a wider area of the state space with good local coverage in some areas.

A system and method for automatically testing software using a deterministic acceptance test and random command sequence selections to more rapidly uncover errors in computer software. A results analyzer checks test parameters following the execution of each of a series of predetermined test commands and a series of random test commands to determine if the commands were properly executed. The test command sequences and test results determined by the results analyzer are stored in a log file which may be examined by the tester. The randomly selected test command sequence is stored in a tracker log file. The tester may reexecute the tracker file in its entirety or any portion selected by the tester as a means of determining the cause of an error in the software. The system also provides for error recovery. When an error is detected, the system restarts the test of the computer software and continues maintaining the log file and the tracker file. The system also uses the probabilities for various responses that an end-user may make in response to a particular screen display or program state. The system may select random responses corresponding to the probabilities. These probabilities are calculated for each individual screen display or software state. Because the present invention executes a random selection of command sequences, a particular applications program may be tested on multiple machines, thereby decreasing the overall time required for acceptance testing.

Growing community of inventors

Kirkland, WA, United States of America

James R Tierney