Individual holder
BAUMGARTNER JASON R
US·30 granted patents·6 pending applications·88 citations·filing 2006–2012
Individually held — no corporate assignee on record.
Technology mixG06F36
Top patents by PatentIndex Score
36 records- 0187US8181134B2Techniques for performing conditional sequential equivalence checking of an integrated circuit logic designBAUMGARTNER JASON R·Filed 2009·Granted May 15, 2012·15 cites·20 claims
- 0284US8146034B2Efficient Redundancy Identification, Redundancy Removal, and Sequential Equivalence Checking within Designs Including Memory Arrays.BAUMGARTNER JASON R·Filed 2010·Granted Mar 27, 2012·8 cites·20 claims
- 0383US8181131B2Enhanced analysis of array-based netlists via reparameterizationBAUMGARTNER JASON R·Filed 2010·Granted May 15, 2012·7 cites·20 claims
- 0481US8589837B1Constructing inductive counterexamples in a multi-algorithm verification frameworkBAUMGARTNER JASON R·Filed 2012·Granted Nov 19, 2013·6 cites·20 claims
- 0581US8578311B1Method and system for optimal diameter bounding of designs with complex feed-forward componentsBAUMGARTNER JASON R·Filed 2012·Granted Nov 5, 2013·6 cites·22 claims
- 0676US8255848B2Logic design verification techniques for liveness checking with retimingBAUMGARTNER JASON R·Filed 2009·Granted Aug 28, 2012·7 cites·13 claims
- 0774US8589327B2Efficiently determining boolean satisfiability with lazy constraintsBAUMGARTNER JASON R·Filed 2011·Granted Nov 19, 2013·3 cites·12 claims
- 0873US8527922B1Method and system for optimal counterexample-guided proof-based abstractionBAUMGARTNER JASON R·Filed 2012·Granted Sep 3, 2013·3 cites·23 claims
- 0973US8307313B2Minimizing memory array representations for enhanced synthesis and verificationBAUMGARTNER JASON R·Filed 2010·Granted Nov 6, 2012·3 cites·20 claims
- 1072US8245166B2Optimal correlated array abstractionBAUMGARTNER JASON R·Filed 2010·Granted Aug 14, 2012·3 cites·22 claims
- 1170US8566764B2Enhanced analysis of array-based netlists via phase abstractionBAUMGARTNER JASON R·Filed 2010·Granted Oct 22, 2013·3 cites·20 claims
- 1270US8473882B2Method and system for scalable reduction in registers with SAT-based resubstitutionBAUMGARTNER JASON R·Filed 2012·Granted Jun 25, 2013·2 cites·20 claims
- 1370US8327302B2Techniques for analysis of logic designs with transient logicBAUMGARTNER JASON R·Filed 2009·Granted Dec 4, 2012·4 cites·17 claims
- 1466US8418093B2Method and system for design simplification through implication-based analysisBAUMGARTNER JASON R·Filed 2009·Granted Apr 9, 2013·3 cites·21 claims
- 1566US8086429B2Predicate-based compositional minimization in a verification environmentBAUMGARTNER JASON R·Filed 2008·Granted Dec 27, 2011·3 cites·13 claims
- 1665US8141048B2Sequential encoding for relational analysis (SERA) of a software modelBAUMGARTNER JASON R·Filed 2007·Granted Mar 20, 2012·3 cites·21 claims
- 1764US8201115B2Scalable reduction in registers with SAT-based resubstitutionBAUMGARTNER JASON R·Filed 2008·Granted Jun 12, 2012·2 cites·15 claims
- 1863US8418106B2Techniques for employing retiming and transient simplification on netlists that include memory arraysBAUMGARTNER JASON R·Filed 2010·Granted Apr 9, 2013·1 cites·14 claims
- 1962US8407641B2Logic design verification techniques for liveness checking with retimingBAUMGARTNER JASON R·Filed 2012·Granted Mar 26, 2013·1 cites·13 claims
- 2061US8201118B2Method and system for dynamic automated hint generation for enhanced reachability analysisBAUMGARTNER JASON R·Filed 2009·Granted Jun 12, 2012·2 cites·15 claims
- 2159US8201117B2Method for scalable derivation of an implication-based reachable state set overapproximationBAUMGARTNER JASON R·Filed 2009·Granted Jun 12, 2012·1 cites·20 claims
- 2259US8122403B2Trace containment detection of combinational designs via constraint-based uncorrelated equivalence checkingBAUMGARTNER JASON R·Filed 2009·Granted Feb 21, 2012·1 cites·19 claims
- 2358US8171437B2Automated convergence of ternary simulation by saturation of deep gatesBAUMGARTNER JASON R·Filed 2009·Granted May 1, 2012·1 cites·19 claims
- 2453US8185852B2Performing minimization of input count during structural netlist overapproximationBAUMGARTNER JASON R·Filed 2008·Granted May 22, 2012·0 cites·6 claims
- 2553US2008104559A1Method and System for Enhanced Verification Through Structural Target DecompositionBAUMGARTNER JASON R·Filed 2008·Application pending·0 cites
- 2653US2008104558A1Method and System for Enhanced Verification Through Structural Target DecompositionBAUMGARTNER JASON R·Filed 2008·Application pending·0 cites
- 2751US9280626B2Efficiently determining Boolean satisfiability with lazy constraintsBAUMGARTNER JASON R·Filed 2012·Granted Mar 8, 2016·0 cites·6 claims
- 2851US8484591B2Enhancing redundancy removal with early mergingBAUMGARTNER JASON R·Filed 2012·Granted Jul 9, 2013·0 cites·9 claims
- 2951US2008092096A1Method and system for optimized automated case-splitting via constraints in a symbolic simulation frameworkBAUMGARTNER JASON R·Filed 2007·Application pending·0 cites
- 3050US8413091B2Enhancing redundancy removal with early mergingBAUMGARTNER JASON R·Filed 2011·Granted Apr 2, 2013·0 cites·10 claims
- 3146US8291359B2Array concatenation in an integrated circuit designBAUMGARTNER JASON R·Filed 2010·Granted Oct 16, 2012·0 cites·20 claims
- 3245US8478574B2Tracking array data contents across three-valued read and write operationsBAUMGARTNER JASON R·Filed 2010·Granted Jul 2, 2013·0 cites·19 claims
- 3345US8336016B2Eliminating, coalescing, or bypassing ports in memory array representationsBAUMGARTNER JASON R·Filed 2010·Granted Dec 18, 2012·0 cites·23 claims
- 3445US2007168372A1Method and system for predicate selection in bit-level compositional transformationsBAUMGARTNER JASON R·Filed 2006·Application pending·0 cites
- 3543US2007220461A1Method and system for sequential equivalence checking with multiple initial statesBAUMGARTNER JASON R·Filed 2006·Application pending·0 cites
- 3640US2012151423A1Large scale formal analysis by structural preprocessingBAUMGARTNER JASON R·Filed 2011·Application pending·0 cites
Join the waitlist — get patent alerts
Get an alert when BAUMGARTNER JASON R files or is granted a new patent.
We store only your email — no account needed. See our privacy policy.
Counts cover granted patents and pending applications in the PatentIndex corpus. How scoring works →