Inventor
CASE MICHAEL L
US25 patents
⚠️ This page may combine multiple inventors who share the name “CASE MICHAEL L”. Patents are grouped by organization below to help distinguish them — per-person disambiguation is on the roadmap.
BAUMGARTNER JASON R
23 patentsUS8181134B2May 15, 2012
Techniques for performing conditional sequential equivalence checking of an integrated circuit logic design
BAUMGARTNER JASON R15 citations84
US8181131B2May 15, 2012
Enhanced analysis of array-based netlists via reparameterization
BAUMGARTNER JASON R7 citations84
US8146034B2Mar 27, 2012
Efficient Redundancy Identification, Redundancy Removal, and Sequential Equivalence Checking within Designs Including Memory Arrays.
BAUMGARTNER JASON R8 citations84
US8589837B1Nov 19, 2013
Constructing inductive counterexamples in a multi-algorithm verification framework
BAUMGARTNER JASON R6 citations73
US8578311B1Nov 5, 2013
Method and system for optimal diameter bounding of designs with complex feed-forward components
BAUMGARTNER JASON R6 citations73
US8589327B2Nov 19, 2013
Efficiently determining boolean satisfiability with lazy constraints
BAUMGARTNER JASON R3 citations63
US8527922B1Sep 3, 2013
Method and system for optimal counterexample-guided proof-based abstraction
BAUMGARTNER JASON R3 citations63
US8473882B2Jun 25, 2013
Method and system for scalable reduction in registers with SAT-based resubstitution
BAUMGARTNER JASON R2 citations63
US8327302B2Dec 4, 2012
Techniques for analysis of logic designs with transient logic
BAUMGARTNER JASON R4 citations63
US8307313B2Nov 6, 2012
Minimizing memory array representations for enhanced synthesis and verification
BAUMGARTNER JASON R3 citations63
US8245166B2Aug 14, 2012
Optimal correlated array abstraction
BAUMGARTNER JASON R3 citations63
US8201115B2Jun 12, 2012
Scalable reduction in registers with SAT-based resubstitution
BAUMGARTNER JASON R2 citations63
US8418093B2Apr 9, 2013
Method and system for design simplification through implication-based analysis
BAUMGARTNER JASON R3 citations62
US8566764B2Oct 22, 2013
Enhanced analysis of array-based netlists via phase abstraction
BAUMGARTNER JASON R3 citations60
US9280626B2Mar 8, 2016
Efficiently determining Boolean satisfiability with lazy constraints
BAUMGARTNER JASON R0 citations52
US8484591B2Jul 9, 2013
Enhancing redundancy removal with early merging
BAUMGARTNER JASON R0 citations52
US8478574B2Jul 2, 2013
Tracking array data contents across three-valued read and write operations
BAUMGARTNER JASON R0 citations52
US8418106B2Apr 9, 2013
Techniques for employing retiming and transient simplification on netlists that include memory arrays
BAUMGARTNER JASON R1 citations52
US8413091B2Apr 2, 2013
Enhancing redundancy removal with early merging
BAUMGARTNER JASON R0 citations52
US8336016B2Dec 18, 2012
Eliminating, coalescing, or bypassing ports in memory array representations
BAUMGARTNER JASON R0 citations52
US8291359B2Oct 16, 2012
Array concatenation in an integrated circuit design
BAUMGARTNER JASON R0 citations52
US8201117B2Jun 12, 2012
Method for scalable derivation of an implication-based reachable state set overapproximation
BAUMGARTNER JASON R1 citations52
US8171437B2May 1, 2012
Automated convergence of ternary simulation by saturation of deep gates
BAUMGARTNER JASON R1 citations52