Andrew L Bliss

US Patent:

6738777, May 18, 2004

Filed:

Dec 20, 2000

Appl. No.:

09/681072

Inventors:

Andrew L. Bliss - Redmond WA
Kyle R. Johns - Redmond WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1730

US Classification:

707100, 707101

Abstract:

A plurality of actions are applied to a directed graph, where the directed graph has a plurality of nodes. A node in the directed graph is traversed to, and an specific method for each of the plurality of actions is performed on the traversed-node. The traversing and performing are repeated until all nodes in the directed graph have been traversed to. Only a single traversal of the directed graph need be performed to apply all of the actions to the directed graph. The plurality of the actions are in the form of a chain. Each action has an action object pointer, and the actions include a base action at a tail end of the chain and at least one chain action at a head end of the chain. The action object pointer of each chain action points to an immediately adjacent action toward the tail end of the chain, and the action object pointer of the base action points to the chain action at the head end of the chain.

US Patent:

6823518, Nov 23, 2004

Filed:

Oct 17, 2000

Appl. No.:

09/690675

Inventors:

Andrew L. Bliss - Redmond WA
Andre F. Vachon - Redmond WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 954

US Classification:

719310, 718100, 717125, 710240

Abstract:

A system and method to facilitate communication between a user interface and an associated process is disclosed. A first thread is associated with the user interface and a second thread is associated with the process for implementing requests by the user interface. At least one state buffer is operable to store state data for controlling ownership to the state buffer by the first and second threads for communicating data between the first and second threads. The architecture may be used in connection with a debugging system, such as to facilitate responsive interaction between the GUI and the associated debugging system.

US Patent:

6931412, Aug 16, 2005

Filed:

Nov 5, 2001

Appl. No.:

10/010698

Inventors:

Matthew T. Uyttendaele - Seattle WA, US
Andrew L. Bliss - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F017/30

US Classification:

707101, 6103 R, 6 10

Abstract:

A directed graph includes a plurality of containers, where each container has a type value and is instantiated based on one of a plurality of container types. Each action as instantiated includes an action method table comprising a plurality of action methods. Each action when traversing the directed graph employs the type value of an encountered container as an offset into the action method table thereof to select the action method to be executed on the encountered container. During run-time and prior to traversing the directed graph, an action is instantiated if not already instantiated, and the method table of the action is expanded and filled in based on any new container types in the system.

US Patent:

7150006, Dec 12, 2006

Filed:

Nov 3, 2003

Appl. No.:

10/700180

Inventors:

Andrew L. Bliss - Redmond WA, US
Vance Palmer Morrison - Kirkland WA, US
Sean Edwin Trowbridge - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44
G06F 9/45

US Classification:

717124, 717140, 717127

Abstract:

A system and method for facilitating cross-process access into a managed code process is useful in an embodiment of the invention for debugging managed code without perturbing the process being accessed or requiring the code under test to be running during debugging. A compiler according to an embodiment of the invention is used to produce mirror code wherein in-process pointers have been replaced with cross-process pointers in order to mirror the address space of the process under test to the address space of the mirror code process. In a further embodiment, the mirror code process is modified not only to allow but also to optimize the cross-process access.

US Patent:

7191364, Mar 13, 2007

Filed:

Nov 14, 2003

Appl. No.:

10/713867

Inventors:

William Hunter Hudson - Kirkland WA, US
Reiner Fink - Mercer Island WA, US
Geoff Pease - Bothell WA, US
Gerald Maffeo - Woodinville WA, US
Yi Meng - Bellevue WA, US
Eric LeVine - Seattle WA, US
Andrew L. Bliss - Redmond WA, US
Andre Vachon - Redmond WA, US
Kshitiz K. Sharma - Bellevue WA, US
Jing Shan - Boston MA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 11/00

US Classification:

714 38, 714 37, 717124, 707202

Abstract:

A large portion of software bugs are related to hangs. Analyzing and diagnosing hang-related bugs involves capturing data from a hung program and extracting attributes from the captured data. Extracting attributes from the capture data provides a scheme to determine relevant characteristics of the hang. Moreover, the extracted attributes may be compared to known issues and, based on that comparison, a bug may be classified as known or unknown. Alternatively, triage may be performed on the client computing device in order to determine the potential cause of the hang event. Once the potential cause of the hang event has been determined, troubleshooting steps may be performed on the client computing device to quarantine it. Ultimately, if the hang-inducing bug is known, a user may be provided with a solution to the bug. Alternatively, if the bug is unknown, implementations of the invention send the captured data to be analyzed and fixed by the software's provider.

US Patent:

7302613, Nov 27, 2007

Filed:

Nov 12, 2003

Appl. No.:

10/712619

Inventors:

Andrew L. Bliss - Redmond WA, US
John D. Service - Monroe WA, US
Narayanan Ganapathy - Redmond WA, US
Neill M. Clift - Kirkland WA, US
Yi Meng - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 11/00

US Classification:

714 38, 714 37

Abstract:

A system, method and interface for consistently capturing kernel resident information are provided. An operating system architecture includes user mode modules and kernel mode applications. A user mode module initiates a kernel mode information request through an application program interface identifying one or more process threads of interest. A kernel mode module captures information corresponding to standard kernel mode information and corresponding to the specifically identified process threads. The information is returned in a pre-allocated buffer.

US Patent:

7426735, Sep 16, 2008

Filed:

Oct 5, 2004

Appl. No.:

10/958859

Inventors:

Andrew L. Bliss - Redmond WA, US
Andre F. Vachon - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

719310, 710240, 717125, 718100

Abstract:

A system and method to facilitate communication between a user interface and an associated process is disclosed. A first thread is associated with the user interface and a second thread is associated with the process for implementing requests by the user interface. At least one state buffer is operable to store state data for controlling ownership to the state buffer by the first and second threads for communicating data between the first and second threads. The architecture may be used in connection with a debugging system, such as to facilitate responsive interaction between the GUI and the associated debugging system.

US Patent:

8432398, Apr 30, 2013

Filed:

Nov 5, 2009

Appl. No.:

12/613371

Inventors:

John Rapp - Seattle WA, US
Andrew Bliss - Kirkland WA, US
Shai Hinitz - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06T 11/20

US Classification:

345440, 345581, 345619, 717104, 717105, 717114, 717124, 717125, 717127, 717131, 717144

Abstract:

Systems, methods, and computer storage media having computer-executable instructions embodied thereon determine whether an output value of a dependency graph has a particular characteristic. In one embodiment, to make this determination, a dependency graph is generated that illustrates external and internal nodes, in addition to their dependency to one another. External nodes, or those nodes that do not depend on other nodes, are analyzed to determine whether they have a particular characteristic. Depending on the operation associated with the characteristic, it may then be determined whether the output value of the dependency graph also has that characteristic.