Over-constraints for formal verification
AssigneeCadence Design Systems, Inc.
InventorMike Pedneau
Life of this patent
Estimating the term…
Loading patent…
AssigneeCadence Design Systems, Inc.
InventorMike Pedneau
Estimating the term…
In the described examples, an electronic design automation formal verification EDA application is configured to receive an initial evaluation of a circuit design of an integrated circuit (IC) chip. The circuit design of the IC chip includes a list of properties for the IC chip, and the list of properties includes a list of assertions for the IC chip. The formal verification EDA program extracts a counter-example trace from the initial evaluation. The counter-example trace characterizes a set of signals over a plurality of cycles that reach a state in which a given assertion in the list of assertions does not hold true. The formal verification EDA program identifies a subset of signals in the counter-example trace that remain in a specific constant value over the plurality of cycles. The formal verification EDA program executes an over-constrained formal verification for the circuit design.
A non-transitory machine readable medium having machine readable instructions, the machine readable instructions comprising a formal verification electronic design automation (EDA) application, the formal verification EDA application being configured to:
A method comprising:
A system comprising:
Dependencies are inferred from the claim text.