Invention Grant
- Patent Title: Scalable connectivity verification using conditional cut-points
-
Application No.: US15922272Application Date: 2018-03-15
-
Publication No.: US10579770B2Publication Date: 2020-03-03
- Inventor: Pradeep Kumar Nalla , Raj Kumar Gajavelly , Jason Baumgartner , Raja Bilwakeshwar Ivaturi
- Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: Cantor Colburn LLP
- Agent Erik Johnson
- Main IPC: G06F17/50
- IPC: G06F17/50

Abstract:
Invention disclosed herein is a method for performing connectivity verification of an integrated circuit device. In embodiments of the invention, the method includes creating a directed graph representation of the integrated circuit device. The method can further include determining target gates referred to as trace signals within the integrated circuit device. The method can further include creating a hierarchical representation of trace signals and determining nested trace signals. The method can further include determining one or more locations for cut points for non-nested trace signals. Thereafter, performing connectivity verification using the one or more locations for cut points. Finally improving scalability of the connectivity verification by utilizing hierarchical decomposition embodiment of the invention.
Public/Granted literature
- US20190286782A1 SCALABLE CONNECTIVITY VERIFICATION USING CONDITIONAL CUT-POINTS Public/Granted day:2019-09-19
Information query