Patents by Inventor Harikumar Somakumar

Harikumar Somakumar 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).

  • Optimizing bounds checking using computer algebra
    Patent number: 8484613
    Abstract: Some embodiments of the present invention provide techniques and systems for optimizing bounds-checking During operation, the system can receive one or more instructions which when executed evaluate a first expression whose value is required to be between a lower bound expression's value and an upper bound expression's value, such that at least one of the following three values is not determinable before execution: the first expression's value, the lower bound expression's value, and the upper bound expression's value. Next, the system can use computer algebra to determine whether the first expression's value is guaranteed to be between the lower bound expression's value and the upper bound expression's value. If the system determines that the first expression's value is not guaranteed to be between the lower bound expression's value and the upper bound expression's value, the system can add bounds-checking instructions to the one or more instructions.
    Type: Grant
    Filed: January 28, 2010
    Date of Patent: July 9, 2013
    Assignee: Synopsys, Inc.
    Inventors: Harikumar Somakumar, Jimin Wang
  • OPTIMIZING BOUNDS CHECKING USING COMPUTER ALGEBRA
    Publication number: 20110185341
    Abstract: Some embodiments of the present invention provide techniques and systems for optimizing bounds-checking During operation, the system can receive one or more instructions which when executed evaluate a first expression whose value is required to be between a lower bound expression's value and an upper bound expression's value, such that at least one of the following three values is not determinable before execution: the first expression's value, the lower bound expression's value, and the upper bound expression's value. Next, the system can use computer algebra to determine whether the first expression's value is guaranteed to be between the lower bound expression's value and the upper bound expression's value. If the system determines that the first expression's value is not guaranteed to be between the lower bound expression's value and the upper bound expression's value, the system can add bounds-checking instructions to the one or more instructions.
    Type: Application
    Filed: January 28, 2010
    Publication date: July 28, 2011
    Applicant: SYNOPSYS, INC.
    Inventors: Harikumar Somakumar, Jimin Wang