Patents by Inventor David E. Langworthy
David E. Langworthy has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10193951Abstract: A method implemented in a computing system includes receiving communications from a client device to a first web server via the Internet. The communications are associated with a plurality of operations requested by the client device and to be performed by a web service implemented by both the first web server and a second web server. The method further includes, responsive to the received communications, arriving at a consensus between the first and second web servers regarding an agreed-upon order of operations to be performed in response to the requested operations and, upon arriving at the consensus, generating a response by performing the requested operations in the agreed-upon order at both the first and second web servers. The web service has the same state subsequent to performing the requested operations at the first and second web servers. The generated response is returned to the client device via the Internet.Type: GrantFiled: March 1, 2016Date of Patent: January 29, 2019Assignee: Microsoft Technology Licensing, LLCInventors: David E. Langworthy, John P. Shewchuk, William Lawrence Portnoy
-
Publication number: 20160197976Abstract: Various embodiments enable redundant or replica services, such as “cloud” services, to be run at geographically distributed locations. Each replica is capable of performing operations that are generally, identically performed across all replicas. In the event of an interruption at one location, services in other locations can quickly and automatically take over operations. In one or more embodiments, a Distributed Agreement Protocol is utilized to bind a CRUD-type protocol as a state machine. Binding takes place through the use of a reverse proxy that is located at each of the locations at which the service is distributed. In at least some embodiments, the Distributed Agreement Protocol is implemented as the Paxos protocol or a variant thereof, and/or the CRUD-type protocol comprises the HTTP protocol.Type: ApplicationFiled: March 1, 2016Publication date: July 7, 2016Inventors: David E. Langworthy, John P. Shewchuk, William Lawrence Portnoy
-
Patent number: 9313252Abstract: Various embodiments enable redundant or replica services, such as “cloud” services, to be run at geographically distributed locations. Each replica is capable of performing operations that are generally, identically performed across all replicas. In the event of an interruption at one location, services in other locations can quickly and automatically take over operations. In one or more embodiments, a Distributed Agreement Protocol is utilized to bind a CRUD-type protocol as a state machine. Binding takes place through the use of a reverse proxy that is located at each of the locations at which the service is distributed. In at least some embodiments, the Distributed Agreement Protocol is implemented as the Paxos protocol or a variant thereof, and/or the CRUD-type protocol comprises the HTTP protocol.Type: GrantFiled: April 20, 2012Date of Patent: April 12, 2016Assignee: Microsoft Technology Licensing, LLCInventors: David E. Langworthy, John P. Shewchuk, William Lawrence Portnoy
-
Patent number: 9229696Abstract: A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.Type: GrantFiled: May 24, 2013Date of Patent: January 5, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Donald F. Box, Bradford H. Lovering, John D. Doty, Jeffrey C. Schlimmer, John L. Hamby, David E. Langworthy
-
Patent number: 8949784Abstract: An efficient, logical and expressive type system is provided for flexibly defining types of a declarative programming language so that efficient and structurally compact data intensive applications can be generated. The type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. With the type system, types can be expressed as intersections and/or unions of other types. Thus, types can be efficiently represented for a full range of types of data as may be found in real world data stores.Type: GrantFiled: October 3, 2008Date of Patent: February 3, 2015Assignee: Microsoft Technology Licensing, LLCInventors: David E. Langworthy, Gavin Bierman, Andrew D. Gordon, Donald F. Box, Bradford H. Lovering, Jeffrey C. Schlimmer, John D. Doty
-
Patent number: 8762942Abstract: An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. A bidirectional type checking algorithm is provided for the type system including synthesis and checking steps to statically verify types of code based on the type system.Type: GrantFiled: October 3, 2008Date of Patent: June 24, 2014Assignee: Microsoft CorporationInventors: David E. Langworthy, Gavin Bierman, Andrew D. Gordon, Donald F. Box, Bradford H. Lovering, Jeffrey C. Schlimmer, John D. Doty
-
Patent number: 8763093Abstract: The subject disclosure relates to authorization based on a determination of permissions that can be granted for an action(s) to be performed on a resource. The determination of the permission is based on a set of rules that represent a theory including a notion of trust that has been divided into different sized tables. The tables are utilized to evaluate two or more input claims and to facilitate a determination of whether access to at least one system resource is to be granted. The evaluation can include matching the two or more input claims to rows in the table, wherein access is allowed if a match is found.Type: GrantFiled: September 12, 2011Date of Patent: June 24, 2014Assignee: Microsoft CorporationInventors: David E. Langworthy, Qian Wang, Andrew John Layman, John Peter Shewchuk, Jr., Shiung-Vei Yong, Charles Edgar Passmore, Hervey Oliver Wilson, Caleb Geoffrey Baker
-
Publication number: 20130282789Abstract: Various embodiments enable redundant or replica services, such as “cloud” services, to be run at geographically distributed locations. Each replica is capable of performing operations that are generally, identically performed across all replicas. In the event of an interruption at one location, services in other locations can quickly and automatically take over operations. In one or more embodiments, a Distributed Agreement Protocol is utilized to bind a CRUD-type protocol as a state machine. Binding takes place through the use of a reverse proxy that is located at each of the locations at which the service is distributed. In at least some embodiments, the Distributed Agreement Protocol is implemented as the Paxos protocol or a variant thereof, and/or the CRUD-type protocol comprises the HTTP protocol.Type: ApplicationFiled: April 20, 2012Publication date: October 24, 2013Applicant: MICROSOFT CORPORATIONInventors: David E. Langworthy, John P. Shewchuk, William Lawrence Portnoy
-
Publication number: 20130263099Abstract: A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.Type: ApplicationFiled: May 24, 2013Publication date: October 3, 2013Applicant: Microsoft CorporationInventors: Donald F. Box, Bradford H. Lovering, John D. Doty, Jeffrey C. Schlimmer, John L. Hamby, David E. Langworthy
-
Patent number: 8473897Abstract: A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.Type: GrantFiled: October 3, 2008Date of Patent: June 25, 2013Assignee: Microsoft CorporationInventors: Donald F. Box, Bradford H. Lovering, John D. Doty, Jeffrey C. Schlimmer, John L. Hamby, David E. Langworthy
-
Patent number: 8413119Abstract: An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. Various embodiments verify the validity of subtyping relationships by translating to first-order logic, and invoking a general-purpose theorem prover with the first-order logic as input. In contrast to treating formulas as types, types are translated into formulas of standard first-order logic. Moreover, to represent data structures of the programming language as first-order logic, universal and existential quantifiers of first-order logic, and function symbols in terms, are exploited. Data intensive applications can be generated, verified, and deployed with greater speed and scale.Type: GrantFiled: October 3, 2008Date of Patent: April 2, 2013Assignee: Microsoft CorporationInventors: David E. Langworthy, Gavin Bierman, Andrew D. Gordon, Donald F. Box, Bradford H. Lovering, Jeffrey C. Schlimmer, John D. Doty
-
Publication number: 20130067539Abstract: The subject disclosure relates to authorization based on a determination of permissions that can be granted for an action(s) to be performed on a resource. The determination of the permission is based on a set of rules that represent a theory including a notion of trust that has been divided into different sized tables. The tables are utilized to evaluate two or more input claims and to facilitate a determination of whether access to at least one system resource is to be granted. The evaluation can include matching the two or more input claims to rows in the table, wherein access is allowed if a match is found.Type: ApplicationFiled: September 12, 2011Publication date: March 14, 2013Applicant: MICROSOFT CORPORATIONInventors: David E. Langworthy, Qian Wang, Andrew John Layman, John Peter Shewchuk, JR., Shiung-Vei Yong, Charles Edgar Passmore, Hervey Oliver Wilson, Caleb Geoffrey Baker
-
Patent number: 8321833Abstract: The subject disclosure relates to a syntax for a scripting language that allows data intensive applications to be written in a compact, human friendly, textual format. The scripting language can be a declarative programming language, such as the “D” programming language, which is well suited to the authoring of data intensive programs. A compact query syntax is provided for D that simplifies the expression of complex and data intensive programs. In another non-limiting aspect, conventional operator precedence is modified to accommodate the compact syntax and other unique features of a general purpose declarative programming language.Type: GrantFiled: October 3, 2008Date of Patent: November 27, 2012Assignee: Microsoft CorporationInventors: David E. Langworthy, Bradford H. Lovering, Donald F. Box, Giovanni M. Della-Libera, Jeffrey S. Pinkston, Jeffrey C. Schlimmer, John D. Doty, John L. Hamby
-
Patent number: 8296744Abstract: Embodiments of tree-based directed graph programming structures for a declarative programming language are provided. In various embodiments, complex graph structured data, referred to as “DGraphs” herein in one non-limiting implementation, is authored using a compact, human friendly syntax without the use of explicit identifiers. In one non-limiting aspect, the syntax includes support for conformance relationships, also referred to as factored relationships. In another non-limiting aspect, the semistructured graph data is a tree-based representation and the syntax includes lexical resolution of references or lexical scoping, and/or non local initialization.Type: GrantFiled: October 3, 2008Date of Patent: October 23, 2012Assignee: Microsoft CorporationInventors: David E. Langworthy, John L. Hamby, Bradford H. Lovering, Donald F. Box
-
Patent number: 8135794Abstract: Methods, systems, and computer program products that provide for a runtime messaging infrastructure, which abstracts send and receive operations for exchanging messages with partner endpoint. The messaging infrastructure improves availability and scalability of a message application by improving on the availability and scalability of the underlying message transports. In particular, availability and scalability are improved by linking the message application at runtime with any number of the message transports, without the message application specifying a transport at development time. The message infrastructure receives instructions from the message application specifying end-to-end delivery assurances. The infrastructure uses transports in order to fulfill the specified delivery assurance, and creates a link between the message application and transports for use in exchanging messages.Type: GrantFiled: March 31, 2010Date of Patent: March 13, 2012Assignee: Microsoft CorporationInventors: Rodney T. Limprecht, Richard D. Hill, David E. Langworthy, Hany Essam Ramadan, Shy Cohen
-
Patent number: 7949787Abstract: Systems and methods for open content model Web service messaging in a networked computing environment are described. In one aspect, a transport neutral message is generated that includes message recipient, endpoint addressing information, and one or more reference properties. The reference properties include selectively opaque message context. The transport neutral message is bound to a transport protocol for communication to the message recipient. At least a portion of the selectively opaque message context is not directed to the message recipient.Type: GrantFiled: March 15, 2004Date of Patent: May 24, 2011Assignee: Microsoft CorporationInventors: Donald F. Box, Christopher G. Kaler, David E. Langworthy, Steven E. Lucco, John Shewchuk, Luis Felipe Cabrera, Craig A Critchley, Geary L. Eppley, Bradford H. Lovering, Jeffrey C. Schlimmer, David Wortendyke, Henrik F. Nielsen
-
Patent number: 7912973Abstract: A mechanism for negotiating a relatively transport agnostic communication protocol for use in accomplishing a distributed activity. The potential protocols subject to negotiation may be, for example, extensions to Web Services Coordination. In that case, when the initiator creates a transaction, the initiator also negotiates the desired protocol with its transaction manager. The transaction manager and any other participants in the transaction will then follow that negotiated protocol when communicating with the transaction manager. The protocol may be selected to improve performance and may be tailored to existing needs and capabilities.Type: GrantFiled: December 3, 2004Date of Patent: March 22, 2011Assignee: Microsoft CorporationInventors: Max A. Feingold, David E. Langworthy, James E. Johnson, John D. Doty, Michael R. Clark
-
Patent number: 7873832Abstract: Mechanisms for securely allowing a participant computing entity to engage in a transaction initiated by an initiator computing entity and managed by a coordinator computing entity. The initiator provides a transaction initiation request to the coordinator. Upon receipt, the coordinator accessing a transaction coordination context that includes information such as a secure key that may be used by a participant to register in the transaction. The coordinator then provides the coordination context to the initiator, which provides the coordination context to the participant(s) that are also to engage in the transaction. Each participant then generates a registration request that is based on the coordination context, and that is secured using the secure key provided in the coordination context.Type: GrantFiled: August 19, 2004Date of Patent: January 18, 2011Assignee: Microsoft CorporationInventors: Max A. Feingold, David E. Langworthy, Christopher G. Kaler, James E. Johnson
-
Patent number: 7853695Abstract: A message processor accesses an electronic message. The accessing message processor identifies, from within the electronic message, any communication session information associated with the accessing message processor. This can include identifying expressive XML instructions or XML data structures representing communication sessions or message sequences. The accessing message processor determines if any session information within the electronic message is to be modified. This can include inserting session information for new sessions or message sequences, updating existing session information, or removing session information for terminated or expired communication sessions or message sequences. The accessing message processor then routes the electronic message to another message processor. In some embodiments, an initiating message processor identifies cached session information that is used to initially establish a communication session.Type: GrantFiled: February 21, 2003Date of Patent: December 14, 2010Assignee: Microsoft CorporationInventors: Christopher G. Kaler, David E. Langworthy, John P. Shewchuk
-
Patent number: 7801999Abstract: Example embodiments provide for a new set of binding extensions that allow individual messages within a contract of a Network Protocol Description Language data structure (e.g., a portType of a WSDL document or file) to flow over different transports and to different network transport addresses. Further, example embodiments provide for a concise expression of protocol choices through the use of a default element for specifying one of a plurality of binding mechanisms. Moreover, the present invention also provides for not only defining services within a document or data structure through standard URLs, but also for allowing the addressing of a service using an endpoint reference as defined by, e.g., WS-Addressing. This allows for a more robust way to address a service in a document by providing a lightweight, extensible, self-contained description of the service.Type: GrantFiled: December 13, 2004Date of Patent: September 21, 2010Assignee: Microsoft CorporationInventors: Jeffrey C. Schlimmer, David E. Langworthy