HM

Hari Mony

IBM: 96 patents #604 of 70,183Top 1%
RI Real Intent: 1 patents #10 of 16Top 65%
Overall (All Time): #15,505 of 4,157,543Top 1%
97
Patents All Time

Issued Patents All Time

Showing 25 most recent of 97 patents

Patent #TitleCo-InventorsDate
10690722 Methods and systems for efficient identification of glitch failures in integrated circuits Pranav Ashar, Fabrice Baray, Nikhil Rahagude, Vikas Sachdeva 2020-06-23
10394987 Adaptive bug-search depth for simple and deep counterexamples Jason R. Baumgartner, Raj Kumar Gajavelly, Pradeep Kumar Nalla 2019-08-27
10210296 Adaptive bug-search depth for simple and deep counterexamples Jason R. Baumgartner, Raj Kumar Gajavelly, Pradeep Kumar Nalla 2019-02-19
9483595 Method for scalable liveness verification via abstraction refinement Jason R. Baumgartner, Raj Kumar Gajavelly, Robert L. Kanzelman, Pradeep Kumar Nalla 2016-11-01
9471734 System and program product for scalable liveness verification via abstraction refinement Jason R. Baumgartner, Raj Kumar Gajavelly, Robert L. Kanzelman, Pradeep Kumar Nalla 2016-10-18
9280626 Efficiently determining Boolean satisfiability with lazy constraints Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2016-03-08
8997030 Enhanced case-splitting based property checking Krishnan K. Kailas 2015-03-31
8978001 Enhanced case-splitting based property checking Krishnan K. Kailas 2015-03-10
8850372 Method and system for performing invariant-guided abstraction of a logic design Jason R. Baumgartner, Alexander Ivrii, Arie Matsliah 2014-09-30
8589327 Efficiently determining boolean satisfiability with lazy constraints Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-11-19
8589837 Constructing inductive counterexamples in a multi-algorithm verification framework Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-11-19
8578311 Method and system for optimal diameter bounding of designs with complex feed-forward components Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-11-05
8566764 Enhanced analysis of array-based netlists via phase abstraction Jason R. Baumgartner, Michael L. Case, Paul Joseph Roessler 2013-10-22
8527922 Method and system for optimal counterexample-guided proof-based abstraction Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-09-03
8484591 Enhancing redundancy removal with early merging Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-07-09
8478574 Tracking array data contents across three-valued read and write operations Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-07-02
8473882 Method and system for scalable reduction in registers with SAT-based resubstitution Jason R. Baumgartner, Michael L. Case, Viresh Paruthi 2013-06-25
8418119 Logical circuit netlist reduction and model simplification using simulation results containing symbolic values Michael L. Case, Jason R. Baumgartner, Robert L. Kanzelman 2013-04-09
8418106 Techniques for employing retiming and transient simplification on netlists that include memory arrays Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-04-09
8413091 Enhancing redundancy removal with early merging Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2013-04-02
8336016 Eliminating, coalescing, or bypassing ports in memory array representations Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2012-12-18
8327302 Techniques for analysis of logic designs with transient logic Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2012-12-04
8307313 Minimizing memory array representations for enhanced synthesis and verification Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2012-11-06
8291359 Array concatenation in an integrated circuit design Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2012-10-16
8245166 Optimal correlated array abstraction Jason R. Baumgartner, Michael L. Case, Robert L. Kanzelman 2012-08-14