Paul F Ringseth

US Patent:

6654953, Nov 25, 2003

Filed:

Oct 9, 1998

Appl. No.:

09/169383

Inventors:

Christian Beaumont - Issaquah WA
Jonathan Caves - Redmond WA
Paul F. Ringseth - Redmond WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 945

US Classification:

717158, 717112, 717117, 717130, 717131, 717141, 717142, 717143, 717159

Abstract:

Attribute tags embedded in the statements of a source program system extend a programming language. A compiler for the program includes an interface to detect the attribute tags and to call one of a number of attribute-provider programs external to the compiler. The provider programs modify the operation of the compiler, for example by injecting additional statements or other code into the program at one or more predetermined points remote from the attribute tag. The compiler interface lists the names of the attributes and locations of their associated provider programs.

US Patent:

7055143, May 30, 2006

Filed:

Jul 10, 2001

Appl. No.:

09/902818

Inventors:

Paul F. Ringseth - Redmond WA, US
Momin M. Al-Ghosien - Sammamish WA, US
Jasjit S. Grewel - Kirkland WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45

US Classification:

717143, 717141, 717131

Abstract:

A system and methods are provided that make compile-time declarative modeling available for SOAP-based data transmission(s). The declarative modeling minimizes the amount of coding required of a developer. The underlying details regarding the SOAP protocol, dispatching to the appropriate object and function, marshing and un-marshing of XML and generating the SOAP response are hidden from the developer when implementing SOAP-based Web services. The task of creating a SOAP-based web service is thus greatly simplified by reducing the number and complexity of considerations required of the developer when generating SOAP-based Web services. In one embodiment, attributes for Visual C++ are utilized as a framework for a declarative syntax for SOAP-based Web services, which Visual C++ attributes have access to type and marshaling information.

US Patent:

7100153, Aug 29, 2006

Filed:

Jul 6, 2000

Appl. No.:

09/611402

Inventors:

Paul F. Ringseth - Redmond WA, US
Sridhad S. Madhugiri - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45
G06F 9/44

US Classification:

717140, 719331, 719332

Abstract:

A compiler automatically generates a late binding interface implementation based upon programming language code and definition information. The programming language code is for implementing the late bound methods of the interface, while the definition information defines late binding interface features of the interface. The late binding interface implementation includes code for invoking one or more late bound methods through a late binding mechanism, and also can include code for directly invoking the one or more late bound methods through an early binding mechanism. The compiler can also generate client-side code for calling a late bound method of a late binding interface.

US Patent:

7150010, Dec 12, 2006

Filed:

Jul 6, 2000

Appl. No.:

09/611403

Inventors:

Paul F. Ringseth - Redmond WA, US
Jonathan E. Caves - Bellevue WA, US
Jason J. Shirk - Woodinville WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45

US Classification:

717140, 717141

Abstract:

Unification of a programming language with a definition language creates a powerful tool for object-oriented programming. A programming language is extended to include definition language constructs. In a compiler environment, a compiler recognizes the definition language constructs in programming language code. The compiler environment unifies representation of the definition language information and programming language code in a unified parse tree, and derives semantic meaning from definition language information. The compiler environment also checks for lexical, syntax, and semantic errors.

US Patent:

7194733, Mar 20, 2007

Filed:

Jun 11, 2003

Appl. No.:

10/459021

Inventors:

Paul F Ringseth - Redmond WA, US
Donald James McCrady - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45
G06F 9/64

US Classification:

717136, 717140, 709230

Abstract:

Instructions in an asynchronous transactional messaging language are transformed into instructions that are compatible with the web services. In one embodiment, the asynchronous transactional messaging language is XLANG/s, and the web service languages are the web services description language (WSDL) and the simple object access protocol (SOAP). A programmer simply writes high level declarative statements that pertain to the specific type of business transaction. During compilation, selected instructions are transformed into instructions that are compatible with web services. This transformation is transparent to the designer of the business application. The asynchronous transactional messaging language source files are compiled in an iterative compilation process. During each pass of this compilation process, different variables are parsed. The parsed results are logically organized in a tree structure.

US Patent:

7210135, Apr 24, 2007

Filed:

Aug 26, 2003

Appl. No.:

10/648461

Inventors:

Donald James McCrady - Redmond WA, US
Paul F. Ringseth - Redmond WA, US
Bimal Mehta - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45

US Classification:

717140, 717142, 717144, 717154, 717155, 717156

Abstract:

A XLANG/s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.

US Patent:

7343589, Mar 11, 2008

Filed:

Jun 18, 2003

Appl. No.:

10/463940

Inventors:

Paul F. Ringseth - Redmond WA, US
Donald James McCrady - Redmond WA, US
Bimal Mehta - Sammamish WA, US
Paul Maybee - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44
G06N 5/00

US Classification:

717126, 717131, 717140, 706 47, 706 57

Abstract:

A XLANG/s compiler recognizes a statement in XLANG/s code to make an assumption as to the success or failure of a specified transaction. The assignment states of variables are tracked and changes to such states are recorded. While processing XLANG/s code, the compiler determines whether the assignment state of a particular correlation, operation or the like is correct for the transaction being performed. If not, the compiler may generate an error message. Moreover, by using declarative assumptions such as if(succeeded(T)) or if(!succeeded(T)), definite-assignment analysis of shared state variables may cross transactional boundaries.

US Patent:

7370333, May 6, 2008

Filed:

Jun 2, 2003

Appl. No.:

10/452961

Inventors:

Bimal Mehta - Sammamish WA, US
Johannes Klein - Sammamish WA, US
Lee Graber - Kirkland WA, US
Paul Maybee - Seattle WA, US
Sriram Balasubramanian - Bellevue WA, US
Sanjib Saha - Bellevue WA, US
Satish R. Thatte - Redmond WA, US
Paul F. Ringseth - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

719313, 719315

Abstract:

An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure.