Microsoft Technology Licensing, LLC

Aaron Stern

Erik B Christensen

Umesh Madan

Michael James Coulson

Geary L Eppley

Kenneth David Wolf

Michael Steven Vernal

Donald F Box

Elliot Lee Waingold

Luis Felipe Cabrera

Christopher G Kaler

Stephen James Millet

David Wortendyke

Giovanni Moises Della-Libera

James Ernest Johnson

Tirunelveli R Vishwanath

Lance Olson

Richard Douglas Hill

Stefan R Batres

Stefan Harrington Pharies

John David Doty

Craig Andrew Critchley

Uday Sooryakant Hegde

Vijay Gajjala

Michael Marucheck

Krishnan Srinivasan

Matthew Thomas Tavis

Tomasz Janczuk

Stephen T Swartz

David Edwin Levin

Shy Cohen

Max A Feingold

Richard Dievendorff

Douglas M Purdy

Natasha Harish Jethanandani

David Owen Driver

Stefan H Pharies

Siddhartha Puri

Saurab Nog

Jesus Ruiz-Scougall

Anastasios Kasiolas

Douglas A Walter

Kapil Gupta

Ryan Thomas Sturgell

Vipul A Modi

Sowmyanarayanan K Srinivasan

Scott Christopher Seely

Jonathan T Wheeler

Evgeny Osovetsky

Mohammad Makarechian

Alexander Martin DeJarnatt

Yaniv Pessach

Mauro Ottaviani

Erin Honeycutt

Chaitanya Dutt Upadhyay

Michael Thomas Dice

Eugene Shvets

Alfred M Lee, Iv

Yasser Shohoud

Pompiliu Diplan

Anand Rjagopalan

Mohamed-Hany Essam Ramadan

Serge Sverdlov

Vaithialingam B Balayogan

Luis Filipe Cabrera

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.

Message object model

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., abort), deeming the evaluation as under attack.

Safe mode for inverse query evaluations

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&#x2014;even their own proprietary ones.

Varying of message encoding

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.

Efficient endpoint matching using a header-to-bit conversion table

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.

High performance navigator for parsing inputs of a message

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.

Interface infrastructure for creating and interacting with web services

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.

Select indexing in merged inverse query evaluations

A method for processing XML documents in a computer-based system includes associating each of a plurality of information items with a corresponding one of a plurality of binary-data units and providing a XML document associated with a XML information set comprising one or more of the plurality of information items. The method includes serializing the XML document into a binary XML format, or de-serializing the XML document from the binary XML format. Serializing includes translating the one or more information items of the XML information set into their corresponding one or more binary-data units. De-serializing includes translating one or more binary-data units of the binary XML format into their corresponding one or more information items. A computer readable medium is encoded with a program for execution on at least one processor. The program, when executed on the at least one processor, can perform the method for processing XML documents.

Method and system for binary serialization of documents

Growing community of inventors

Bellevue, WA, United States of America

Aaron Stern