Patents by Inventor Nicolas Xavier Pena

Nicolas Xavier Pena 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: 8448107
    Abstract: This disclosure describes a method for accomplishing sequential logical equivalence verification using a hierarchical piecewise approach. Initially, the method provides a reference semiconductor design and a second semiconductor design with logic edits relative to it. The method submits both to formal verification to check the reference design against the second semiconductor design with all edits disabled 200. The semiconductor design is partitioned 202 and associated input constraints 204. The edits are further grouped 206 and ordered 208. The invention also discovers a set of dependencies of the logic edits 210 and checks that the ordering of groups obeys the dependencies 212. Each group of edits is further submitted to formal verification 214 and any input constraints assumed for any partitions are verified in their enclosing partition 216. Finally, the method reports success if formal verification succeeds on each group of logic edits and on each set of input constraints 218.
    Type: Grant
    Filed: July 8, 2009
    Date of Patent: May 21, 2013
    Assignee: Apple Inc.
    Inventors: Nathan Francis Sheeley, Mark H. Nodine, Nicolas Xavier Pena, Irfan Waheed, Patrick Peters, Adrian J. Isles
  • Publication number: 20110214096
    Abstract: This disclosure describes a method for accomplishing sequential logical equivalence verification using a hierarchical piecewise approach. Initially, the method provides a reference semiconductor design and a second semiconductor design with logic edits relative to it. The method submits both to formal verification to check the reference design against the second semiconductor design with all edits disabled 200. The semiconductor design is partitioned 202 and associated input constraints 204. The edits are further grouped 206 and ordered 208. The invention also discovers a set of dependencies of the logic edits 210 and checks that the ordering of groups obeys the dependencies 212. Each group of edits is further submitted to formal verification 214 and any input constraints assumed for any partitions are verified in their enclosing partition 216. Finally, the method reports success if formal verification succeeds on each group of logic edits and on each set of input constraints 218.
    Type: Application
    Filed: July 8, 2009
    Publication date: September 1, 2011
    Applicant: INTRINSITY, INC.
    Inventors: Nathan Francis Sheeley, Mark H. Nodine, Nicolas Xavier Pena, Irfan Waheed, Patrick Peters, Adrian J. Isles