Inventor · disambiguated record
Hari Mony
Also filed as: MONY HARI
97 granted patents·5 pending applications·552 citations·filing 2003–2019
99Inventor score
Top patents by PatentIndex Score
102 records- 0192US7299432B2Method for preserving constraints during sequential reparameterizationIBM·Filed 2005·Granted Nov 20, 2007·29 cites·20 claims
- 0290US7882473B2Sequential equivalence checking for asynchronous verificationIBM·Filed 2007·Granted Feb 1, 2011·28 cites·21 claims
- 0389US7260799B2Exploiting suspected redundancy for enhanced design verificationIBM·Filed 2005·Granted Aug 21, 2007·21 cites·20 claims
- 0488US7437690B2Method for predicate-based compositional minimization in a verification environmentIBM·Filed 2005·Granted Oct 14, 2008·18 cites·5 claims
- 0588US7356792B2Method 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
- 0687US8181134B2Techniques for performing conditional sequential equivalence checking of an integrated circuit logic designBAUMGARTNER JASON R·Filed 2009·Granted May 15, 2012·15 cites·20 claims
- 0787US7367002B2Method and system for parametric reduction of sequential designsIBM·Filed 2005·Granted Apr 29, 2008·16 cites·7 claims
- 0885US7448005B2Method 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
- 0985US7315996B2Method and system for performing heuristic constraint simplificationIBM·Filed 2005·Granted Jan 1, 2008·11 cites·7 claims
- 1084US8146034B2Efficient 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
- 1184US7421669B2Using constraints in design verificationIBM·Filed 2005·Granted Sep 2, 2008·12 cites·5 claims
- 1284US7380222B2Method and system for performing minimization of input count during structural netlist overapproximationIBM·Filed 2005·Granted May 27, 2008·11 cites·5 claims
- 1383US10210296B2Adaptive bug-search depth for simple and deep counterexamplesIBM·Filed 2017·Granted Feb 19, 2019·3 cites·6 claims
- 1483US8181131B2Enhanced analysis of array-based netlists via reparameterizationBAUMGARTNER JASON R·Filed 2010·Granted May 15, 2012·7 cites·20 claims
- 1583US7917874B2Reversing the effects of sequential reparameterization on tracesIBM·Filed 2008·Granted Mar 29, 2011·9 cites·6 claims
- 1683US7765514B2Method for improved synthesis of binary decision diagrams with inverted edges and quantifiable as well as nonquantifiable variablesIBM·Filed 2007·Granted Jul 27, 2010·9 cites·5 claims
- 1783US7370298B2Method for heuristic preservation of critical inputs during sequential reparameterizationIBM·Filed 2005·Granted May 6, 2008·11 cites·7 claims
- 1883US7203915B2Method for retiming in the presence of verification constraintsIBM·Filed 2005·Granted Apr 10, 2007·13 cites·20 claims
- 1982US7890901B2Method and system for verifying the equivalence of digital circuitsIBM·Filed 2007·Granted Feb 15, 2011·12 cites·15 claims
- 2082US7350166B2Method and system for reversing the effects of sequential reparameterization on tracesIBM·Filed 2005·Granted Mar 25, 2008·9 cites·7 claims
- 2182US7350179B2Method for improved synthesis of binary decision diagrams with inverted edges and quantifiable as well as nonquantifiable variablesIBM·Filed 2005·Granted Mar 25, 2008·9 cites·6 claims
- 2282US7340694B2Method and system for reduction of XOR/XNOR subexpressions in structural design representationsIBM·Filed 2005·Granted Mar 4, 2008·9 cites·7 claims
- 2381US8589837B1Constructing inductive counterexamples in a multi-algorithm verification frameworkBAUMGARTNER JASON R·Filed 2012·Granted Nov 19, 2013·6 cites·20 claims
- 2481US8578311B1Method 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
- 2581US7752593B2Method for improved synthesis of binary decision diagrams with inverted edges and quantifiable as well as nonquantifiable variablesIBM·Filed 2007·Granted Jul 6, 2010·8 cites·6 claims
- 2681US7360185B2Design verification using sequential and combinational transformationsIBM·Filed 2005·Granted Apr 15, 2008·11 cites·5 claims
- 2781US7350169B2Method and system for enhanced verification through structural target decompositionIBM·Filed 2005·Granted Mar 25, 2008·8 cites·7 claims
- 2880US7266795B2System and method for engine-controlled case splitting within multiple-engine based verification frameworkIBM·Filed 2005·Granted Sep 4, 2007·10 cites·19 claims
- 2979US8978001B1Enhanced case-splitting based property checkingIBM·Filed 2013·Granted Mar 10, 2015·4 cites·12 claims
- 3079US7779378B2Computer program product for extending incremental verification of circuit design to encompass verification restraintsIBM·Filed 2008·Granted Aug 17, 2010·8 cites·4 claims
- 3179US7689943B2Parametric reduction of sequential designIBM·Filed 2008·Granted Mar 30, 2010·8 cites·13 claims
- 3279US7475370B2System for verification using reachability overapproximationIBM·Filed 2007·Granted Jan 6, 2009·7 cites·7 claims
- 3378US7934180B2Incremental speculative mergingIBM·Filed 2008·Granted Apr 26, 2011·8 cites·19 claims
- 3478US7793242B2Method and system for performing heuristic constraint simplificationIBM·Filed 2007·Granted Sep 7, 2010·6 cites·7 claims
- 3578US7788616B2Method and system for performing heuristic constraint simplificationIBM·Filed 2007·Granted Aug 31, 2010·6 cites·6 claims
- 3677US7509605B2Extending incremental verification of circuit design to encompass verification restraintsIBM·Filed 2005·Granted Mar 24, 2009·7 cites·4 claims
- 3776US7856609B2Using constraints in design verificationIBM·Filed 2008·Granted Dec 21, 2010·6 cites·8 claims
- 3875US7913205B2Method and system for reversing the effects of sequential reparameterization on tracesIBM·Filed 2008·Granted Mar 22, 2011·5 cites·7 claims
- 3975US7322017B2Method for verification using reachability overapproximationIBM·Filed 2004·Granted Jan 22, 2008·16 cites·7 claims
- 4074US8589327B2Efficiently determining boolean satisfiability with lazy constraintsBAUMGARTNER JASON R·Filed 2011·Granted Nov 19, 2013·3 cites·12 claims
- 4174US8418119B2Logical circuit netlist reduction and model simplification using simulation results containing symbolic valuesCASE MICHAEL L·Filed 2011·Granted Apr 9, 2013·5 cites·21 claims
- 4274US7882470B2Method for heuristic preservation of critical inputs during sequential reparameterizationIBM·Filed 2008·Granted Feb 1, 2011·5 cites·13 claims
- 4374US7343573B2Method and system for enhanced verification through binary decision diagram-based target decompositionIBM·Filed 2005·Granted Mar 11, 2008·5 cites·6 claims
- 4473US8527922B1Method and system for optimal counterexample-guided proof-based abstractionBAUMGARTNER JASON R·Filed 2012·Granted Sep 3, 2013·3 cites·23 claims
- 4573US8307313B2Minimizing memory array representations for enhanced synthesis and verificationBAUMGARTNER JASON R·Filed 2010·Granted Nov 6, 2012·3 cites·20 claims
- 4672US8245166B2Optimal correlated array abstractionBAUMGARTNER JASON R·Filed 2010·Granted Aug 14, 2012·3 cites·22 claims
- 4772US7996800B2Computer program product for design verification using sequential and combinational transformationsIBM·Filed 2008·Granted Aug 9, 2011·5 cites·5 claims
- 4872US7788615B2Computer program product for verification using reachability overapproximationIBM·Filed 2007·Granted Aug 31, 2010·4 cites·6 claims
- 4971US10394987B2Adaptive bug-search depth for simple and deep counterexamplesIBM·Filed 2017·Granted Aug 27, 2019·1 cites·11 claims
- 5071US7552407B2Method and system for performing target enlargement in the presence of constraintsIBM·Filed 2008·Granted Jun 23, 2009·4 cites·13 claims
Showing the top 50 of 102 patent records by PatentIndex Score.
Join the waitlist — get patent alerts
Get an alert when Hari Mony 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 →