Aaron Michael Stern, Age 37Lynnwood, WA

7472130, Dec 30, 2008

Oct 5, 2005

11/244670

Aaron A. Stern - Bellevue WA, US
Geary L. Eppley - Carnation WA, US
Umesh Madan - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707101, 707102, 707 1

Embodiments provide for select indexing, which uses an array to simultaneously construct output sets for instructions that operate on input nodesets with common axes. During evaluation of a message against an instruction tree, when a branching node with a large “splay” is iterated over, rather than iterating over an input nodeset with a common axis once per branch, the select indexing described herein iterates over the nodeset once in total. More specifically, the select index data structure includes an array of empty node sets for instructions that both, branch from a branching node, and evaluate input nodes that share a common axis. Identifiers for the input nodeset are compared to indices within the select index, and matches for the input nodes are added to the corresponding nodeset for the appropriate instruction. The results of the evaluation may then be passed to the branches of the select instructions for further processing.

7512957, Mar 31, 2009

Dec 3, 2004

11/003307

Shy Cohen - Bellevue WA, US
Geary L. Eppley - Carnation WA, US
Douglas M. Purdy - Bellevue WA, US
James E. Johnson - Bellevue WA, US
Stephen J. Millet - Edmonds WA, US
Stephen T. Swartz - Seattle WA, US
Vijay K. Gajjala - Sammamish WA, US
Aaron Abraham Stern - Bellevue WA, US
Alexander Martin DeJarnatt - Seattle WA, US
Anastasios Kasiolas - San Mateo CA, US
Chaitanya D. Upadhyay - Kirkland WA, US
Christopher G. Kaler - Sammamish WA, US
Craig Andrew Critchley - Fall City WA, US
David Edwin Levin - Redmond WA, US
David Owen Driver - Seattle WA, US
David Wortendyke - Seattle WA, US
Douglas A. Walter - Issaquah WA, US
Elliot Lee Waingold - Seattle WA, US
Erik Bo Christensen - Seattle WA, US
Erin P. Honeycutt - Redmond WA, US
Eugene Shvets - Seattle WA, US
Evgeny Osovetsky - Bellevue WA, US
Giovanni M. Della-Libera - Seattle WA, US
John David Doty - Seattle WA, US
Jonathan T. Wheeler - Bothell WA, US
Kapil Gupta - Redmond WA, US
Kenneth David Wolf - Seattle WA, US
Krishnan Srinivasan - Kirkland WA, US
Lance E. Olson - Sammamish WA, US
Matthew Thomas Tavis - Seattle WA, US
Mauro Ottaviani - Mercer Island WA, US
Max Attar Feingold - Bellevue WA, US
Michael James Coulson - Clyde Hill WA, US
Michael Jon Marucheck - Bellevue WA, US
Michael Steven Vernal - Seattle WA, US
Michael Thomas Dice - Redmond WA, US
Mohammad Makarechian - Seattle WA, US
Natasha Harish Jethanandani - Seattle WA, US
Richard Dievendorff - Bellevue WA, US
Richard Douglas Hill - Kirkland WA, US
Ryan Thomas Sturgell - Seattle WA, US
Saurab Nog - Sammamish WA, US
Scott Christopher Seely - Bellevue WA, US
Serge Sverdlov - Bellevue WA, US
Siddhartha Puri - Sammamish WA, US
Sowmyanarayanan K. Srinivasan - Redmond WA, US
Stefan Batres - Sammamish WA, US
Stefan Harrington Pharies - Seattle WA, US
Tirunelveli Vishwanath - Redmond WA, US
Tomasz Janczuk - Redmond WA, US
Uday S. Hegde - Bellevue WA, US
Umesh Madan - Bellevue WA, US
Vipul Arunkant Modi - Redmond WA, US
Yaniv Pessach - Redmond WA, US
Yasser Shohoud - Sammamish WA, US

Microsoft Corporation - Redmond WA

G06F 3/00

719328

A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.

7548926, Jun 16, 2009

Oct 5, 2005

11/245323

Aaron A. Stern - Bellevue WA, US
Geary L. Eppley - Carnation WA, US
Umesh Madan - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707100, 707101, 707102

Example embodiments provide a high performance navigator configured to lightly touch on the elements or input of a message, without necessarily having to build an entire tree structure for each input within the message. In addition, as portions of the inputs are identified as requiring further details, only those stub nodes representing that particular input will be created; thus avoiding the setup cost associated with loading an entire tree. Other example embodiments also provide for other optimizations such as reducing the class types of node allocations needed for navigating a particular message. For instance, a single class is defined that holds enough fields to store all of the information needed for numerous input nodes. Further, these common node structures can simultaneously generate as an array that further allows for more efficient navigation of the inputs.

7603474, Oct 13, 2009

Oct 5, 2005

11/244669

Aaron A. Stern - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 15/16
G06F 15/173

709232, 709238

A header-to-bit conversion table is provided that includes a list of address headers for registered endpoints. Assigned to each address header within the list is a bit placement within a string of bits. As messages are received, select headers within a message are compared with the address headers within the list. Each intersection or match for headers sets a bit true within a bit array for the message corresponding to the bit assignment for the header within the header-to-bit conversion table. Such array may then be compared with bit masks for each endpoint, wherein those bits set true within the bit masks represent those headers needed to satisfy the criteria for a particular endpoint. If a match is found, the message (or portion(s) thereof) may be sent to the particular endpoint for processing.

7814211, Oct 12, 2010

Aug 31, 2006

11/469442

Michael S. Vernal - Seattle WA, US
Aaron Stern - Bellevue WA, US
Donald F. Box - Bellevue WA, US
Erik B. Christensen - Seattle WA, US
Kenneth D. Wolf - Seattle WA, US
Michael J. Coulson - Clyde Hill WA, US
Elliot L. Waingold - Seattle WA, US
Luis Felipe Cabrera - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 15/16

709227, 709206, 709228, 709229, 709230, 709246, 709247, 719319, 713176, 370352

Embodiments described herein provide a user with the ability to vary the encoding of a message object rather than being bound to a specific one, e. g. , the text encoding for SOAP messaging. Accordingly, a message encoding factory is provided that is responsible for mapping a message object (e. g. , SOAP Infoset) into raw octets suitable for wire transmission. By encapsulating the notion of a message encoder factory abstractly, embodiments allow users to vary the encoding of an Infoset without varying the programming model (or any other aspect of the system that uses message). In other words, embodiments herein separate the transport (e. g. , TCP, HTTP, etc. ) from the encoding, which allows users to use any number of encoding mechanisms—even their own proprietary ones.

7899817, Mar 1, 2011

Oct 5, 2005

11/245322

Aaron A. Stern - Bellevue WA, US
Pompiliu Diplan - Seattle WA, US
Geary L. Eppley - Carnation WA, US
Umesh Madan - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 11/00

707731, 707713, 707722, 707758, 707781, 726 22, 726 26

Embodiments herein prevent or mitigate attacks on inverse query engines by providing safe mode routines that allow for the acceptance of third party messages and/or query expressions, as well as prevent trusted sources from accidental attacks. The mitigations fall into two categories: compile-time and runtime. Compile-time mitigations prevent query expressions from being accepted and compiled that are susceptible to known attacks. For example, the complexity of query expressions may be limited to functions with linear runtimes; constant memory usage; or ones that do not create large strings. Further, language constructs for the criteria in the query expression may not allow for nested predicates complexities. Runtime mitigations, on the other hand, monitor the data size and processing lengths of messages against the various query expressions. If these runtime quotas are exceeded, an exception or other violation indication may be thrown (e. g.

7949720, May 24, 2011

Aug 31, 2006

11/469430

Michael S. Vernal - Seattle WA, US
Aaron Stern - Bellevue WA, US
Donald F. Box - Bellevue WA, US
Erik B. Christensen - Seattle WA, US
Kenneth D. Wolf - Seattle WA, US
Michael J. Coulson - Clyde Hill WA, US
Stefan H. Pharies - Zuerich, CH
Luis Filipe Cabrera - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 15/16

709207, 709206, 709217, 709218, 709219, 709220, 709227, 709228, 709229, 70799901, 707999107

Embodiments described herein provide for an overall object mode that allows for a single message object to represent multiple messaging formats. A general message object is populated with fields for multiple available messaging formats, which can be appropriately filled with information with fields for both versions 1. 1 and 1. 2. Depending on which version is being used or desired, the appropriate fields can be populated when creating an instance of the message object. The other fields that do not correspond to that version, however, are left blank.

2006016, Jul 27, 2006

Jan 25, 2005

11/042524

Michael Coulson - Clyde Hill WA, US
Aaron Stern - Bellevue WA, US
Erik Christensen - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/00

707101000, 715513000

A method for processing XML documents in a computer-based system includes providing a XML document associated with a XML information set that includes one or more information items, and serializing the XML document into a serialized format. The serialized format includes at least one subset that includes a subset node. The subset node indicates that the at least one subset can be de-serialized independently of a remainder of the XML document. A computer readable medium is encoded with a program that, when executed, can perform the method for processing XML documents.