Search

Anton Lapounov Phones & Addresses

  • Kirkland, WA
  • Redmond, WA
  • Bellevue, WA
  • Kiona, WA
  • 11416 115Th Ln NE, Kirkland, WA 98033

Publications

Us Patents

Xslt/Xpath Focus Inference For Optimized Xslt Implementation

View page
US Patent:
8074166, Dec 6, 2011
Filed:
Sep 13, 2006
Appl. No.:
11/521525
Inventors:
Anton V. Lapounov - Redmond WA, US
Ralf Lammel - Redmond WA, US
Sergey Dubinets - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/00
US Classification:
715234, 715200
Abstract:
Techniques are provided for performing focus inference when compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. In XPath/XSLT, expression evaluation occurs with respect to the dynamic context. In XPath, the part of the dynamic context, related to the context node-set, is called the “focus” of the expression. Conceptually, the focus would need to be systematically computed and propagated along the recursive execution of XSLT templates. This is costly. Focus inference enables the more efficient execution of XSLT programs since the inferred focus information can be used directly by a code generator in an XSLT compilation architecture.

Type Inference For Optimized Xslt Implementation

View page
US Patent:
20070245325, Oct 18, 2007
Filed:
Sep 13, 2006
Appl. No.:
11/521140
Inventors:
Anton V. Lapounov - Redmond WA, US
Ralf Lammel - Redmond WA, US
Sergey Dubinets - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/45
US Classification:
717140
Abstract:
Type inference techniques are provided for use in compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. Using “variant” storages instead of an appropriate efficient representation is both memory-costly (requires more space) and computationally inefficient (requires runtime type switching during execution of the expression). Type inference may be used to determine what types may be assigned to variables and parameters during execution of an XSLT program.

Incremental Parsing Of Hierarchical Files

View page
US Patent:
20090030921, Jan 29, 2009
Filed:
Jul 23, 2007
Appl. No.:
11/781636
Inventors:
Yana D. Kadiyska - Seattle WA, US
Anton V. Lapounov - Kirkland WA, US
Sergey Dubinets - Bellevue WA, US
Christopher J. Lovett - Woodinville WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 17/30
US Classification:
707101, 707E17008
Abstract:
An incremental parser for hierarchical files is provided where the file can be parsed into a tree representation. Changes to the file can effectuate incremental changes to the tree such that the whole hierarchical file need not be reparsed; the incremental change modifies the necessary portions of the tree, not necessarily the entire tree. Moreover, the incremental parser can intelligently handle errors related to modification of the hierarchical file, such as unmatched tags corresponding to unmatched nodes in the tree. Such error handling provides operability with the malformed hierarchical file rather than providing an error and/or rejecting the file as modified.

Unloadable Managed Code

View page
US Patent:
20090328001, Dec 31, 2009
Filed:
Jun 27, 2008
Appl. No.:
12/147875
Inventors:
Sergey Dubinets - Bellevue WA, US
Anton V. Lapounov - Kirkland WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 9/44
US Classification:
717120
Abstract:
The claimed subject matter provides a system and/or a method that facilitates generating unloadable managed code. A set of static subroutines included in a library or an assembly can be converted into dynamic subroutines created at runtime of an application. A reflection component can extract information regarding a static subroutine to produce a full description of structure and data of the subroutine. A dynamic method component can create a dynamic subroutine based upon the full description such that the dynamic subroutine provides substantially equivalent functionality to the static subroutine. In addition, resources allocated to the dynamic subroutine can be reclaimed to prevent waste and/or application bloat.

Debugging Remote Files Using A Virtual Project

View page
US Patent:
20100192121, Jul 29, 2010
Filed:
Jan 23, 2009
Appl. No.:
12/358244
Inventors:
Aditya Unnithan - Seattle WA, US
Sergey Dubinets - Bellevue WA, US
C. Douglas Hodges - Sammamish WA, US
Stefania I. Crivat - Redmond WA, US
Anton Lapounov - Kirkland WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 9/44
US Classification:
717103, 717139
Abstract:
A virtual project system is described herein that creates a virtual project to provide information during remote debugging similar to the project information available for local debugging. The virtual project contains each of a document's local and original Uniform Resource Identifiers (URIs) for documents that are downloaded and compiled locally. At debug-time, the virtual project system injects the virtual project with information resolved by the debugger, including the original URI and the locally compiled version of the document. This allows the virtual project to associate the local to original URI mappings so that when the IDE receives symbol information at debug-time and attempts to open the document that has the current debug context, the IDE opens the correct remote document rather than a local copy. This ensures that any changes made by the user during debugging affect the remote document, rather than the temporary local copy.

Xslt/Xpath Focus Inference For Optimized Xslt Implementation

View page
US Patent:
20120042234, Feb 16, 2012
Filed:
Oct 19, 2011
Appl. No.:
13/276585
Inventors:
Anton V. Lapounov - Redmond WA, US
Ralf Lammel - Redmond WA, US
Sergey Dubinets - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/00
US Classification:
715230
Abstract:
Techniques are provided for performing focus inference when compiling an Extensible Markup Language Transforms (XSLT) stylesheet into a compiled XSLT processor. In XPath/XSLT, expression evaluation occurs with respect to the dynamic context. In XPath, the part of the dynamic context, related to the context node-set, is called the “focus” of the expression. Conceptually, the focus would need to be systematically computed and propagated along the recursive execution of XSLT templates. This is costly. Focus inference enables the more efficient execution of XSLT programs since the inferred focus information can be used directly by a code generator in an XSLT compilation architecture.
Anton V Lapounov from Kirkland, WA, age ~47 Get Report