Invention Grant
- Patent Title: Automated use of uninterpreted functions in sequential equivalence
- Patent Title (中): 自动使用未解释的功能进行顺序等效
-
Application No.: US12362513Application Date: 2009-01-30
-
Publication No.: US07996803B2Publication Date: 2011-08-09
- Inventor: Jason R. Baumgartner , Robert L. Kanzelman , Hari Mony , Viresh Paruthi
- Applicant: Jason R. Baumgartner , Robert L. Kanzelman , Hari Mony , Viresh Paruthi
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Dillon & Yudell LLP
- Main IPC: G06F17/50
- IPC: G06F17/50

Abstract:
A method, system and computer program product for automated use of uninterpreted functions in sequential equivalence checking. A first netlist and a second netlist may be received and be included in an original model, and from the original model, logic to be abstracted may be determined. A condition for functional consistency may be determined, and an abstract model may be created by replacing the logic with abstracted logic using one or more uninterpreted functions. One or more functions may be performed on the abstract model. For example, the one or more functions may include one or more of a bounded model checking (BMC) algorithm, an interpolation algorithm, a Boolean satisfiability-based analysis algorithm, and a binary decision diagram (BDD) based reachability analysis algorithm, among others.
Public/Granted literature
- US20100199241A1 Method and System for Automated Use of Uninterpreted Functions in Sequential Equivalence Checking Public/Granted day:2010-08-05
Information query