Patent ID: 8484591
Filing Date: 2013-07-09
Classification: G06F

Abstract:
1. A method, in a data processing system, for simplifying a netlist before computational resources are exceeded, the method comprising: receiving, by a processor, input that identifies a netlist to be validated and at least one of a set of equivalences or a set of equivalence classes; building, by the processor, a proof graph without any edges and with at least two of a node for each equivalence in a set of equivalences at least two of a node for each equivalence class in a set of equivalence classes; performing, by the processor, speculative reduction on an unrolled version of the netlist, wherein the speculative reduction asserts a set of suspected equivalences in the set of equivalences or in the set of equivalence classes; for each suspected equivalence of the set of suspected equivalences in the proof graph of the netlist: for each node in the proof graph;