Cadence Design Systems, Inc.

Rodion Vladimirovich Melnikov

Meir Ovadia

Yonatan Ashkenazi

Marat Teplitsky

Amit Metodi

Samer Raed Alqassis

Aspects of the present disclosure address systems and methods for functional coverage in integrated circuit (IC) designs utilizing arbitrary expression to define irrelevant domains in coverage item definitions. A coverage item definition is determined to include an arbitrary expression that defines an irrelevant domain for a coverage item in a functional coverage analysis of an IC design. Based on determining if the item definition comprises the arbitrary expression, a verification the arbitrary expression satisfies one or more analyzability conditions is performed. Based on verifying the arbitrary expression satisfies the one or more analyzability conditions, the irrelevant domain for the coverage item is calculated based on the arbitrary expression. An enhanced functional coverage model that excludes the irrelevant domain for the coverage item is generated and used to perform the functional coverage analysis on the IC design.

Coverage model enhancement to support logic and arithmetic expressions

A method and system for debugging memory allocation and memory release may include recording execution events of an execution run of a program including data related to objects pertaining to that program, and data related to object association pertaining to that program at a plurality of points in time. The method may also include receiving via a user interface a user selection of an object of said objects. The method may further include identifying one or a plurality of pointers pointing from one or a plurality of objects at the selected object based on the recorded data related to object association and finding one or a plurality of execution events of said execution events corresponding to assignments of said one or a plurality of pointers. The method may further include distinctly marking a portion of the code, presented to the user on a display device, representing said one or a plurality of execution events that correspond to assignments of said one or a plurality of pointers.

Method and system for automated debugging memory allocation and memory release

A system, method, and computer program product is disclosed that for debugging errors in software code. According to some approaches, techniques are provided for performing on-the-fly switching from compiled to interpretive debugging for a software program. The test starts with compiled code, and when it needs to stop for debugging, the debugging occurs in interpretive mode. Once debugging has concluded, the execution can switch back to compiled mode. In this way, the debugging activities can achieve the speed and efficiency of using compiled optimized executables, while still being able to allow debugging without performing any recompilations.

Method and system for debugging of compiled code using an interpreter

Disclosed is a method, system, and computer program product that reduces the size of a failing test. A tree is created from the test's programming code, where the tree represents the syntactical and the semantic bounds between the programming code elements. By analyzing this tree and iteratively pruning the irrelevant sub-trees it is possible to eliminate many non necessary parts of the code, and recreate a new legal test, which represents the same error, but is potentially much smaller and therefore easier to understand and debug.

Growing community of inventors

Modiin, Israel

Rodion Vladimirovich Melnikov