Virtual automata
AssigneeMicrosoft Corporation
InventorsJohn Wesley Dyer, Brian C. Beckman, Henricus Johannes Maria Meijer, Jeffrey Van Gogh
Life of this patent
Estimating the term…
Abstract
Computer-based machines can be modeled after a virtual automaton. The virtual automaton defines processes that are not bound statically to particular behavior but rather perform a lookup at runtime to bind behavior to a specific process mechanism. In accordance with one aspect, binding can be dependent upon runtime context information such as object type. Instances of virtual automaton are provided in the context of graph processing including serialization of object graphs and scanning/parsing, among others.
Claims20
A computer-implemented data process system, comprising:
- a map component that provides node process mechanisms;
- and
- a process component that interacts with the map component to identify and execute specific process mechanisms to process nodes of a graph in a recursive manner at runtime.
A serialization method, comprising:
- acquiring a writer component to write output with in a specific transfer syntax;
- looking up a type serializer for an object type of a node in an object graph;
- and
- executing the type serializer to serialize the node, wherein the type serializer invokes the writer component.
A method of deserialization, comprising:
- locating a type serializer as a function of an object type;
- and
- executing the type serializer to deserialize an object, the type serializer invokes a reader component to read serialized data in a particular transfer sytnax.
Dependencies are inferred from the claim text.