Inventor · disambiguated record
Robert L. Kanzelman
Also filed as: KANZELMAN ROBERT · KANZELMAN ROBERT L · KANZELMAN ROBERT LOWELL
76 granted patents·8 pending applications·431 citations·filing 1994–2023
99Inventor score
Top patents by PatentIndex Score
84 records- 0189US7260799B2Exploiting suspected redundancy for enhanced design verificationIBM·Filed 2005·Granted Aug 21, 2007·21 cites·20 claims
- 0288US7356792B2Method and system for enhanced verification by closely coupling a structural overapproximation algorithm and a structural satisfiability solverIBM·Filed 2006·Granted Apr 8, 2008·14 cites·5 claims
- 0385US7448005B2Method and system for performing utilization of traces for incremental refinement in coupling a structural overapproximation algorithm and a satisfiability solverIBM·Filed 2006·Granted Nov 4, 2008·13 cites·3 claims
- 0485US7315996B2Method and system for performing heuristic constraint simplificationIBM·Filed 2005·Granted Jan 1, 2008·11 cites·7 claims
- 0584US8146034B2Efficient 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
- 0684US7380222B2Method and system for performing minimization of input count during structural netlist overapproximationIBM·Filed 2005·Granted May 27, 2008·11 cites·5 claims
- 0783US8181131B2Enhanced analysis of array-based netlists via reparameterizationBAUMGARTNER JASON R·Filed 2010·Granted May 15, 2012·7 cites·20 claims
- 0882US10621297B1Initial-state and next-state value foldingIBM·Filed 2018·Granted Apr 14, 2020·4 cites·20 claims
- 0982US7340694B2Method and system for reduction of XOR/XNOR subexpressions in structural design representationsIBM·Filed 2005·Granted Mar 4, 2008·9 cites·7 claims
- 1081US11922130B2Optimization of arithmetic expressionsIBM·Filed 2021·Granted Mar 5, 2024·1 cites·11 claims
- 1181US8589837B1Constructing inductive counterexamples in a multi-algorithm verification frameworkBAUMGARTNER JASON R·Filed 2012·Granted Nov 19, 2013·6 cites·20 claims
- 1281US8578311B1Method 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
- 1381US7360185B2Design verification using sequential and combinational transformationsIBM·Filed 2005·Granted Apr 15, 2008·11 cites·5 claims
- 1481US7350169B2Method and system for enhanced verification through structural target decompositionIBM·Filed 2005·Granted Mar 25, 2008·8 cites·7 claims
- 1580US7266795B2System and method for engine-controlled case splitting within multiple-engine based verification frameworkIBM·Filed 2005·Granted Sep 4, 2007·10 cites·19 claims
- 1679US10789403B1Grouping and partitioning of properties for logic verificationIBM·Filed 2019·Granted Sep 29, 2020·3 cites·18 claims
- 1779US7779378B2Computer program product for extending incremental verification of circuit design to encompass verification restraintsIBM·Filed 2008·Granted Aug 17, 2010·8 cites·4 claims
- 1879US6763505B2Apparatus and method for automated use of phase abstraction for enhanced verification of circuit designsIBM·Filed 2002·Granted Jul 13, 2004·26 cites·30 claims
- 1978US7934180B2Incremental speculative mergingIBM·Filed 2008·Granted Apr 26, 2011·8 cites·19 claims
- 2078US7793242B2Method and system for performing heuristic constraint simplificationIBM·Filed 2007·Granted Sep 7, 2010·6 cites·7 claims
- 2178US7788616B2Method and system for performing heuristic constraint simplificationIBM·Filed 2007·Granted Aug 31, 2010·6 cites·6 claims
- 2277US7509605B2Extending incremental verification of circuit design to encompass verification restraintsIBM·Filed 2005·Granted Mar 24, 2009·7 cites·4 claims
- 2374US8589327B2Efficiently determining boolean satisfiability with lazy constraintsBAUMGARTNER JASON R·Filed 2011·Granted Nov 19, 2013·3 cites·12 claims
- 2474US8418119B2Logical circuit netlist reduction and model simplification using simulation results containing symbolic valuesCASE MICHAEL L·Filed 2011·Granted Apr 9, 2013·5 cites·21 claims
- 2574US7343573B2Method and system for enhanced verification through binary decision diagram-based target decompositionIBM·Filed 2005·Granted Mar 11, 2008·5 cites·6 claims
- 2673US8527922B1Method and system for optimal counterexample-guided proof-based abstractionBAUMGARTNER JASON R·Filed 2012·Granted Sep 3, 2013·3 cites·23 claims
- 2773US8307313B2Minimizing memory array representations for enhanced synthesis and verificationBAUMGARTNER JASON R·Filed 2010·Granted Nov 6, 2012·3 cites·20 claims
- 2873US5537330AMethod for mapping in logic synthesis by logic classificationIBM·Filed 1994·Granted Jul 16, 1996·68 cites·24 claims
- 2972US8245166B2Optimal correlated array abstractionBAUMGARTNER JASON R·Filed 2010·Granted Aug 14, 2012·3 cites·22 claims
- 3072US7996800B2Computer program product for design verification using sequential and combinational transformationsIBM·Filed 2008·Granted Aug 9, 2011·5 cites·5 claims
- 3171US7552407B2Method and system for performing target enlargement in the presence of constraintsIBM·Filed 2008·Granted Jun 23, 2009·4 cites·13 claims
- 3271US7480877B2Methods and apparatus for Boolean equivalency checking in the presence of voting logicIBM·Filed 2006·Granted Jan 20, 2009·5 cites·8 claims
- 3371US6745377B2Apparatus and method for representing gated-clock latches for phase abstractionIBM·Filed 2002·Granted Jun 1, 2004·15 cites·29 claims
- 3470US8327302B2Techniques for analysis of logic designs with transient logicBAUMGARTNER JASON R·Filed 2009·Granted Dec 4, 2012·4 cites·17 claims
- 3569US7921394B2Enhanced verification through binary decision diagram-based target decompositionIBM·Filed 2007·Granted Apr 5, 2011·3 cites·13 claims
- 3669US7743353B2Enhanced verification by closely coupling a structural overapproximation algorithm and a structural satisfiability solverIBM·Filed 2008·Granted Jun 22, 2010·3 cites·5 claims
- 3769US7380221B2Method and system for reduction of and/or subexpressions in structural design representationsIBM·Filed 2005·Granted May 27, 2008·3 cites·5 claims
- 3868US7478344B2Method and system for enhanced verification by closely coupling a structural satisfiability solver and rewriting algorithmsIBM·Filed 2006·Granted Jan 13, 2009·3 cites·1 claims
- 3968US6748573B2Apparatus and method for removing effects of phase abstraction from a phase abstracted traceIBM·Filed 2002·Granted Jun 8, 2004·12 cites·30 claims
- 4067US7210109B2Equivalence checking of scan path flush operationsIBM·Filed 2004·Granted Apr 24, 2007·15 cites·17 claims
- 4166US9471734B2System and program product for scalable liveness verification via abstraction refinementIBM·Filed 2015·Granted Oct 18, 2016·1 cites·14 claims
- 4266US8418093B2Method and system for design simplification through implication-based analysisBAUMGARTNER JASON R·Filed 2009·Granted Apr 9, 2013·3 cites·21 claims
- 4366US7917884B2Enhanced verification by closely coupling a structural overapproximation algorithm and a structural satisfiability solverIBM·Filed 2008·Granted Mar 29, 2011·2 cites·8 claims
- 4466US7913208B2Optimal simplification of constraint-based testbenchesIBM·Filed 2007·Granted Mar 22, 2011·3 cites·12 claims
- 4566US7908575B2Enhanced verification through binary decision diagram-based target decomposition using state analysis extractionIBM·Filed 2007·Granted Mar 15, 2011·2 cites·20 claims
- 4666US7831937B2Method and system for reduction of XOR/XNOR subexpressions in structural design representationsIBM·Filed 2007·Granted Nov 9, 2010·2 cites·7 claims
- 4766US7823093B2Method and system for reduction of and/or subexpressions in structural design representationsIBM·Filed 2007·Granted Oct 26, 2010·2 cites·5 claims
- 4864US8042075B2Method, system and application for sequential cofactor-based analysis of netlistsIBM·Filed 2009·Granted Oct 18, 2011·2 cites·18 claims
- 4964US8015528B2Enhanced verification by closely coupling a structural satisfiability solver and rewriting algorithmsIBM·Filed 2008·Granted Sep 6, 2011·1 cites·20 claims
- 5064US7373624B2Method and system for performing target enlargement in the presence of constraintsIBM·Filed 2005·Granted May 13, 2008·2 cites·7 claims
Showing the top 50 of 84 patent records by PatentIndex Score.
Join the waitlist — get patent alerts
Get an alert when Robert L. Kanzelman files or is granted a new patent.
We store only your email — no account needed. See our privacy policy.
Identity basis: PatentsView inventor disambiguation (2025Q4-odp release). How scoring works →