Timothy D Corrie

US Patent:

59876026, Nov 16, 1999

Filed:

May 6, 1997

Appl. No.:

8/852186

Inventors:

Kenieth Robert Peery - Bellevue WA
Timothy David Corrie - Redmond WA
Sanjay D. Jejurikar - Redmond WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1500

US Classification:

712245

Abstract:

A non-traditional computing machine having no operands and no linear addressing of code or data is disclosed. A code space having multiple dimensions contains programmed instructions each having a unique position defined with respect to the code space dimensions. A data space having multiple dimensions contains data bits each having a unique position defined with respect to the data space dimensions. A code pointer has a position and a direction within the code space. The code pointer position identifies a present instruction. A data pointer has a position and a direction within the data space. The data pointer position identifies a present data bit. The programmed instructions are selected from an instruction set that includes instructions for navigating the code pointer to select instructions and navigating the data pointer to select data bits. The computing machine operates to manipulate the data in the data space according the programmed instructions.

US Patent:

54955718, Feb 27, 1996

Filed:

Sep 30, 1992

Appl. No.:

7/954566

Inventors:

Timothy D. Corrie - Redmond WA
Robert F. Day - Bothell WA
Kenneth S. Gregg - Redmond WA
John L. Miller - Bellevue WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1100

US Classification:

39518314

Abstract:

The present invention provides a method and system for performing parametric testing of a functional programming interface. Parametric testing of a function verifies that the function performs as expected when a valid or an invalid parameter is passed to the function. To perform parameter testing on a function, the present invention receives as input prototype information for the function, and then formulates a testing plan. The invention tests the function according to the testing plan. The testing plan specifies a list of invalid and valid values for each parameter of the function. The invention repeatedly invokes the function, each time passing the function various combinations of invalid and valid values. The function passes the test when (1) the function does not return an error code for any combination of valid parameter values and (2) the function returns an error for any combination of parameter values that include an invalid parameter value.