COLIN CAMPBELL
Pilots at 116 Ave, Seattle, WA

7926025, Apr 12, 2011

Dec 30, 2005

11/322781

Colin L. Campbell - Seattle WA, US
Margus Veanes - Bellevue WA, US
Nicolas Kicillof - Buenos Aires, AR
Nikolai Tillmann - Redmond WA, US
Wolfgang Grieskamp - Redmond WA, US
Wolfram Schulte - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 9/44

717104, 717124, 717132

A model composition environment can allow for description of fill or partial symbolic system behavior, as well as the combination of models of specific features into compound models. Compositional operators can include intersection, concatenation, substitution, alternating refinement, as well as a set of regular expression-like operators. Models called “action machines” can represent object-oriented, reactive programs, and an action machine may be composed with another action machine using a compositional operator. This can allow for testing of particular scenarios or behaviors.

7548911, Jun 16, 2009

May 28, 2005

11/140061

Siddhartha Sen - Bellevue WA, US
Joseph M. Joy - Bangalore, IN
Nikolai Tillmann - Redmond WA, US
Colin L. Campbell - Seattle WA, US
Margus Veanes - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 7/00, G06F 11/00, G06F 9/44

707 4, 714 38, 717104

Diagnosing problems in distributed systems. In one aspect, a model of a distributed system defines trace statements are generated by various nodes of the system and placed in log files. The log files are sent to an automatic validator that attempts to reconcile the trace statements against the model. Results of the attempt are indicated. In another aspect, trace statements are received by a multiplexer that creates an ordering via sequence numbers. The ordering is forwarded to an automatic validator to determine whether the trace statements indicate correct behavior.

7665072, Feb 16, 2010

Apr 21, 2005

11/112282

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

Microsoft Corporation - Redmond WA

G06F 9/44

717132, 717126, 717133

Techniques and tools for generating test cases for methods or programs with input preconditions are described. For example, after finding feasible control flow paths for a tested method along with each path's associated input conditions, a new program is created which tests these conditions along with the precondition. By analyzing this new program's control flow graph, a class of test cases is found while avoiding inefficiencies created by doing complete searches of paths through the combined control flow graph of the precondition and the method. Additional efficiencies are introduced by partitioning a control flow graph for the precondition into branched and straight sections.

7747985, Jun 29, 2010

Mar 18, 2005

11/085624

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

Microsoft Corporation - Redmond WA

G06F 9/44

717127

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.

2007007, Mar 29, 2007

Sep 29, 2005

11/238470

Kia Peyvan - Seattle WA, US
Michael Bizak - Kirkland WA, US
COLIN CAMPBELL - SEATTLE WA, US
RAND LEE - KIRKLAND WA, US

C12M 1/34, C12Q 1/00

435004000, 435287200, 205777500

There is disclosed a process and apparatus for reading electrical current of electrodes on a microarray of electrodes. Those electrodes having binding events are detected by a difference in electrical current flow. Enzymes on targets catalyze the conversion of substrate to product, which is detectable by electrochemical reduction at each electrode on the microarray of electrodes. The apparatus has an integration circuit that provides a voltage output that is measured and recorded over time and used to calculate an average current flow. A potentiometer equalizes voltage at electrodes undergoing measurement compared to grounded electrodes.

7363202, Apr 22, 2008

Jan 20, 2005

11/040187

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

Microsoft Corporation - Redmond WA

G06F 17/10

703 2, 716 4

Exploration algorithms are relevant to the industrial practice of generating test cases from an abstract state machine whose runs define the predicted behavior of the software system under test. Here, a new exploration algorithm allows multiple state groupings to simultaneously guide the search for states that are interesting or relevant for testing. In some cases, the algorithm allows exploration to be optimized from exponential to linear complexity. An extended example is included that illustrates the use of the algorithm.