Patents by Inventor Mark C. Seigle

Mark C. Seigle 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).

  • Publication number: 20140046906
    Abstract: Methods and systems are provided herein that facilitate cost-effective and reliable data identification in an archival data storage system. In an embodiment, a data object stored in an archival data storage system is identified by a data object identifier which encodes storage location information that may be used to locate a data object stored in an archival data storage system that reduces the cost to store a global index. The data object identifier may also encode policy information such as access control information usable for validating subsequent access to the data object, payload validation information such as size and digest usable for verifying the integrity of the payload data, metadata validation information such as error-detection codes usable for validating integrity of the data object identifier and other information.
    Type: Application
    Filed: August 8, 2012
    Publication date: February 13, 2014
    Inventors: Kestutis Patiejunas, Bryan J. Donlan, Colin L. Lazier, James Christopher Sorenson, III, Mark C. Seigle, Christian L. Claiborn
  • Patent number: 6938186
    Abstract: Described is a method and system that performs path-sensitive verification on programs having any code base size. The method maintains a symbolic store that includes symbolic states. Each symbolic state includes a concrete state and an abstract state. The abstract state identifies a state in which the property being tested currently exists. The concrete state identifies other properties of the program. The symbolic store is updated at each node in a logic path of the program with changes in the abstract state and the concrete state. The updates occur such that the symbolic states associated with a particular edge of any node will not have identical abstract states. Rather, in this case, the symbolic states are merged by combining the concrete states to include content that is similar in both symbolic states. In addition, the concrete state determines relevant paths to proceed along in the logic path.
    Type: Grant
    Filed: May 28, 2002
    Date of Patent: August 30, 2005
    Assignee: Microsoft Corporation
    Inventors: Manuvir Das, Mark C. Seigle, Sorin L. Lerner
  • Publication number: 20030226060
    Abstract: Described is a method and system that performs path-sensitive verification on programs having any code base size. The method maintains a symbolic store that includes symbolic states. Each symbolic state includes a concrete state and an abstract state. The abstract state identifies a state in which the property being tested currently exists. The concrete state identifies other properties of the program. The symbolic store is updated at each node in a logic path of the program with changes in the abstract state and the concrete state. The updates occur such that the symbolic states associated with a particular edge of any node will not have identical abstract states. Rather, in this case, the symbolic states are merged by combining the concrete states to include content that is similar in both symbolic states. In addition, the concrete state determines relevant paths to proceed along in the logic path.
    Type: Application
    Filed: May 28, 2002
    Publication date: December 4, 2003
    Applicant: Microsoft Corporation
    Inventors: Manuvir Das, Mark C. Seigle, Sorin L. Lerner