Loading patent…
AssigneeMicrosoft Corporation
InventorsWolfgang Grieskamp, Colin Campbell, Lev Nachmanson, Margus Veanes, Michael Barnett, Nikolai Tillmann, Wolfram Schulte
Estimating the term…
Techniques and tools for generating finite state machines (“FSMs”) for a software system with asynchronous callbacks are described. For example, method invocations in a model of the software system are partitioned into observable and controlled method invocations. The controlled method invocations are those which can be run from a test harness while the observed method invocations are those which are observed asynchronously as they are invoked in the system. An FSM is created with observation and control nodes such that observable transitions are found from observation nodes and controlled transitions are found from control nodes. If a state of the model contains both controlled and observable invocations, a timeout transition is added to the FSM to give an implementation time to come up with an observed method invocation before continuing to controlled invocations.
In an analysis tool, a method comprising generating a finite state machine representing a software system that includes asynchronous callbacks, wherein the finite state machine models the asynchronous callbacks.
A method of constructing a finite state machine describing a program which includes asynchronous callbacks, the finite state machine constructed to be used to test an implementation of the program, and the method comprising:
One or more computer-readable media containing instructions which, when executed by a computer, cause the computer to perform a method of generating a finite state machine from an abstract state machine, the abstract state machine comprising plural states, one or more controlled invocations, and one or more observable invocations and representing a program with asynchronous callbacks, and the method comprising:
Dependencies are inferred from the claim text.