Invention Grant
- Patent Title: Computer program product for verification using reachability overapproximation
- Patent Title (中): 使用可达性过近似的验证计算机程序产品
-
Application No.: US11938612Application Date: 2007-11-12
-
Publication No.: US07788615B2Publication Date: 2010-08-31
- Inventor: Jason Raymond Baumgartner , Hari Mony , Viresh Paruthi , Jiazhao Xu
- Applicant: Jason Raymond Baumgartner , Hari Mony , Viresh Paruthi , Jiazhao Xu
- 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 ; G06F9/45

Abstract:
A method, system and computer program product for verifying that a design conforms to a desired property is disclosed. The method comprises receiving a design, a first initial state of the design, and a property for verification with respect to the design. The first initial state of the design is expanded to create a superset of the first initial state containing one or more states reachable from the first initial state of the design. A superset is synthesized to define a second initial state of the design. Application of the superset to the design is overapproximated through cutpoint insertion into the superset to obtain a modified superset, and the property is verified with reference to the modified superset.
Public/Granted literature
- US20080052650A1 Method for Verification Using Reachability Overapproximation Public/Granted day:2008-02-28
Information query