Patents by Inventor Artem Y. Livshits

Artem Y. Livshits 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: 8306956
    Abstract: A configuration management system that uses a data compression method to compress entries in a data set. An entry is selected as a prefix value and prefix compression of the data set is performed. The entry to serve as the prefix value is quickly selected using an iterative approach. In each iteration, subgroups of entries are formed from groups formed in prior iterations based on the values of characters at successive positions in the entries. The approach is readily implemented using data structures represented as lists.
    Type: Grant
    Filed: July 31, 2007
    Date of Patent: November 6, 2012
    Assignee: Microsoft Corporation
    Inventor: Artem Y. Livshits
  • Patent number: 7653643
    Abstract: A configuration management system that uses a data compression method to compress entries in a data set. An entry is selected as a prefix value and prefix compression of the data set is performed. The entry to serve as the prefix value is quickly selected using an iterative approach. In each iteration, subgroups of entries are formed from groups formed in prior iterations based on the values of characters at successive positions in the entries. The approach is readily implemented using data structures represented as lists.
    Type: Grant
    Filed: March 24, 2005
    Date of Patent: January 26, 2010
    Assignee: Microsoft Corporation
    Inventor: Artem Y. Livshits
  • Patent number: 7299450
    Abstract: Carrying out maintaining a software configuration management system are disclosed. In particular, a way to reverse prior revisions without removing their history in the server are described. When a client submits an undo command to reverse the effects of one or more revisions within a stated revision range of a file, the revision history is updated by submitting a new revision that effectively removes the changes embodied within the range of undone revisions. Implementing undoing prior revisions preserves the revision history for a file, in case there is a need to access the undone revisions at a later time.
    Type: Grant
    Filed: June 17, 2003
    Date of Patent: November 20, 2007
    Assignee: Microsoft Corporation
    Inventors: Artem Y. Livshits, Christopher J. Antos
  • Patent number: 7290251
    Abstract: A method and system provides an improved representation of merge conflicts in a three-way merge operation of three sequences: Original, Version1, and Version2. A merge program first compares the three sequences to identify a list of difference chunks of elements between the Original and Version1, and a list of difference chunks between the Original and Version2. From the two sets of difference chunks, the merge program creates an annotated list of chunks. Each chunk in the annotated list is identified by a conflict flag that indicates whether the chunk is a part of a conflict and if it is, what sequence(s) being merged it belongs to. A merged document is then constructed based on the annotated list of chunks, with the chunks identified in the merged document with conflict markers for viewing by a user.
    Type: Grant
    Filed: May 16, 2003
    Date of Patent: October 30, 2007
    Assignee: Microsoft Corporation
    Inventor: Artem Y. Livshits
  • Patent number: 7076486
    Abstract: Methods and data structures are disclosed for carrying out identifying differences between large files comprising many lines (or other units of comparison such as rows, words, paragraphs, sentences, etc.). The disclosed methods and data structures facilitate and carry out a streamlined, yet thorough comparison of two files to identify differences between them. The streamlining is achieved by pre-processing the files prior to submitting them to any known longest common subsequence (LCS) search engine. The output of the LCS generator is post-processed to compensate for changes to the sequences introduced by the pre-processing stage.
    Type: Grant
    Filed: January 14, 2005
    Date of Patent: July 11, 2006
    Assignee: Microsoft Corporation
    Inventor: Artem Y. Livshits
  • Patent number: 6904430
    Abstract: Methods and data structures are disclosed for carrying out identifying differences between large files comprising many lines (or other units of comparison such as rows, words, paragraphs, sentences, etc.). The disclosed methods and data structures facilitate and carry out a streamlined, yet thorough comparison of two files to identify differences between them. The streamlining is achieved by pre-processing the files prior to submitting them to any known longest common subsequence (LCS) search engine. The output of the LCS generator is post-processed to compensate for changes to the sequences introduced by the pre-processing stage.
    Type: Grant
    Filed: April 26, 2002
    Date of Patent: June 7, 2005
    Assignee: Microsoft Corporation
    Inventor: Artem Y. Livshits
  • Publication number: 20040260974
    Abstract: A system and methods for carrying out maintaining a software configuration management system are disclosed. In particular, a way to reverse prior revisions without removing their history in the server are described. When a client submits an undo command to reverse the effects of one or more revisions within a stated revision range of a file, the revision history is updated by submitting a new revision that effectively removes the changes embodied within the range of undone revisions. The new method for implementing undoing prior revisions preserves the revision history for a file in case there is a need to access the undone revisions at a later time.
    Type: Application
    Filed: June 17, 2003
    Publication date: December 23, 2004
    Applicant: Microsoft Corporation
    Inventor: Artem Y. Livshits
  • Publication number: 20040230886
    Abstract: A method and system provides an improved representation of merge conflicts in a three-way merge operation of three sequences: Original, Version1, and Version2. A merge program first compares the three sequences to identify a list of difference chunks of elements between the Original and Version1, and a list of difference chunks between the Original and Version2. From the two sets of difference chunks, the merge program creates an annotated list of chunks. Each chunk in the annotated list is identified by a conflict flag that indicates whether the chunk is a part of a conflict and if it is, what sequence(s) being merged it belongs to. A merged document is then constructed based on the annotated list of chunks, with the chunks identified in the merged document with conflict markers for viewing by a user.
    Type: Application
    Filed: May 16, 2003
    Publication date: November 18, 2004
    Applicant: Microsoft Corporation
    Inventor: Artem Y. Livshits