Michael A Barnett

US Patent:

6871174, Mar 22, 2005

Filed:

May 17, 2000

Appl. No.:

09/572765

Inventors:

William B. Dolan - Redmond WA, US
Michael Barnett - Seattle WA, US
Stephen D. Richardson - Redmond WA, US
Arul A. Menezes - Bellevue WA, US
Lucretia H. Vanderwende - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F015/62

US Classification:

704 9

Abstract:

The present invention can be used in a natural language processing system to determine a relationship (such as similarity in meaning) between two textual segments. The relationship can be identified or determined based on logical graphs generated from the textual segments. A relationship between first and second logical graphs is determined. This is accomplished regardless of whether there is an exact match between the first and second logical graphs. In one embodiment, the first graph represents an input textual discourse unit. The second graph, in one embodiment, represents information in a lexical knowledge base (LKB). The input graph can be matched against the second graph, if they have similar meaning, even if the two differ lexically or structurally.

US Patent:

7013264, Mar 14, 2006

Filed:

Oct 29, 2004

Appl. No.:

10/977910

Inventors:

William B. Dolan - Redmond WA, US
Michael Barnett - Seattle WA, US
Stephen D. Richardson - Redmond WA, US
Arul A. Menezes - Bellevue WA, US
Lucretia H. Vanderwende - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

704 9

Abstract:

The present invention can be used in a natural language processing system to determine a relationship (such as similarity in meaning) between two textual segments. The relationship can be identified or determined based on logical graphs generated from the textual segments. A relationship between first and second logical graphs is determined. This is accomplished regardless of whether there is an exact match between the first and second logical graphs. In one embodiment, the first graph represents an input textual discourse unit. The second graph, in one embodiment, represents information in a lexical knowledge base (LKB). The input graph can be matched against the second graph, if they have similar meaning, even if the two differ lexically or structurally.

US Patent:

7216338, May 8, 2007

Filed:

Feb 20, 2002

Appl. No.:

10/081329

Inventors:

Michael Barnett - Seattle WA, US
Wolfram Schulte - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44
G06F 9/45

US Classification:

717126, 717143, 717146, 717147, 714 38

Abstract:

To perform conformance checking of a software implementation with a (possibly non-deterministic) specification, a software implementation and a software specification are applied to produce a CT enabled implementation. Nondeterministic choices of the software specification result in assigning a corresponding choice of the CT enabled implementation to a variable. The CT enabled implementation includes a test that the variable then comprises one of the nondeterministic choices of the software specification. To perform conformance testing where the software specification includes ordered steps, and calls to methods of other classes (mandatory calls), a software object is produced and organized such that each step of the software specification has a corresponding code section in the software object. The software object includes instructions to generate an identification of a mandatory call comprised by the software specification, and instructions to test that the state of the implementation conforms to the software specification during the mandatory call.

US Patent:

7337388, Feb 26, 2008

Filed:

Jan 2, 2003

Appl. No.:

10/336222

Inventors:

Michael Barnett - Seattle WA, US
Jacqueline Lynette Reid - Carnation WA, US
Margus Veanes - Bellevue WA, US
Lev Borisovich Nachmanson - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/00
G06F 17/00
G06F 12/00
G06F 17/30

US Classification:

715511, 715530, 707203

Abstract:

A change management method and system for tool-based document generation which incorporates tool input changes, tool changes, and user changes during iterative document creation. After a tool-based document is generated and saved by a tool, and then edited by a user, during a next iteration of creating the edited document, the tool first generates a new base document. The base document is then saved, and a three-way merge is performed on the former iteration's base document, this iteration's new base document, and the former iteration's edited document. The former iteration's base document serves as the base of the merge process. The merge outputs a merged document, and when further edits are needed, the merged document is edited, and saved as the edited document. If no edits are necessary, the merged document is saved directly as the edited document. In each iteration, the new base document and the edited document are saved for a possible next iteration.

US Patent:

7500149, Mar 3, 2009

Filed:

Mar 31, 2005

Appl. No.:

11/097684

Inventors:

Wolfgang Grieskamp - Redmond WA, US
Colin L. Campbell - Seattle WA, US
Lev Borisovich Nachmanson - Redmond WA, US
Margus Veanes - Bellevue WA, US
Michael Barnett - Seattle WA, US
Nikolai Tillmann - Redmond WA, US
Wolfram Schulte - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 11/00

US Classification:

714 38, 717104

Abstract:

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.

US Patent:

7747985, Jun 29, 2010

Filed:

Mar 18, 2005

Appl. No.:

11/085624

Inventors:

Colin L. Campbell - Seattle WA, US
Lev Borisovich Nachmanson - Redmond WA, US
Margus Veanes - Bellevue WA, US
Michael Barnett - Seattle WA, US
Nikolai Tillmann - Redmond WA, US
Wolfgang Grieskamp - Redmond WA, US
Wolfram Schulte - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

717127

Abstract:

Techniques and tools for testing multi-threaded or distributed software systems are described. For example, a multi-threaded system is instrumented and executed to produce logs of events that are performed by each of its agents. The agent logs contain a totally ordered series of events per agent, as well as information about accesses to resources shared between the agents. With this information, a partial ordering of the events performed by all the agents is described for the execution. The agent logs are then multiplexed into one or more serialized event orderings, which can then be compared to a specification of the system in a conformance testing engine.

US Patent:

7926037, Apr 12, 2011

Filed:

Jan 19, 2006

Appl. No.:

11/337129

Inventors:

K. Rustan M. Leino - Bellevue WA, US
Michael Barnett - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45

US Classification:

717126, 717124, 717131, 717132, 717136, 717137, 717143, 717157, 717159

Abstract:

A program verification process begins by converting a language of the program from a first language into an intermediate language representation. The loops of the program are eliminated. The program is converted from the intermediate language representation into a passive form. Dominators for the passive form of the program are determined. A verification condition is generated from the passive form of the program. The verification condition is structured according to the computed dominators such that when a theorem prover identifies a potential error, portions of the passive form of the program irrelevant to the potential error are ignored.

US Patent:

7958489, Jun 7, 2011

Filed:

Apr 12, 2007

Appl. No.:

11/734669

Inventors:

Henricus Johannes Maria Meijer - Mercer Island WA, US
Jeffrey van Gogh - Redmond WA, US
Bruno S. Bozza - Redmond WA, US
Brian C. Beckman - Newcastle WA, US
Wei Zhu - Sammamish WA, US
Michael Barnett - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

717110, 717114

Abstract:

Systems and methods facilitate data augmentation in a computer environment. Data collections of various forms are altered out of band with at least one augmentor specifying alterations thereto. The alterations are applied to an associated collection of data such as programmatic code. In this manner, data can be modified, extended and/or removed from the collection to enable specialization and/or personalization, among other things.