default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHari Mony
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c22]Pradeep Kumar Nalla, Raj Kumar Gajavelly
, Jason Baumgartner, Hari Mony, Robert Kanzelman, Alexander Ivrii:
The art of semi-formal bug hunting. ICCAD 2016: 51- 2014
- [j1]Jiazhao Xu, Mark Williams, Hari Mony, Jason Baumgartner:
Scalable reachability analysis via automated dynamic netlist-based hint generation. Formal Methods Syst. Des. 45(2): 144-164 (2014) - [c21]Pradeep Kumar Nalla, Raj Kumar Gajavelly, Hari Mony, Jason Baumgartner, Robert Kanzelman:
Effective Liveness Verification Using a Transformation-Based Framework. VLSID 2014: 74-79 - 2013
- [c20]Alan Mishchenko, Niklas Eén, Robert K. Brayton, Jason Baumgartner, Hari Mony, Pradeep Kumar Nalla:
GLA: gate-level abstraction revisited. DATE 2013: 1399-1404 - 2012
- [c19]Jiazhao Xu, Mark Williams, Hari Mony, Jason Baumgartner:
Enhanced reachability analysis via automated dynamic netlist-based hint generation. FMCAD 2012: 157-164 - [c18]Jason Baumgartner, Alexander Ivrii, Arie Matsliah, Hari Mony:
IC3-guided abstraction. FMCAD 2012: 182-185 - 2011
- [c17]Michael L. Case, Jason Baumgartner, Hari Mony, Robert Kanzelman:
Optimal redundancy removal without fixedpoint computation. FMCAD 2011: 101-108 - [c16]Michael L. Case, Jason Baumgartner, Hari Mony, Robert Kanzelman:
Approximate reachability with combined symbolic and ternary simulation. FMCAD 2011: 109-115 - [c15]Jun Sawada, Peter Sandon, Viresh Paruthi, Jason Baumgartner, Michael L. Case, Hari Mony:
Hybrid verification of a hardware modular reduction engine. FMCAD 2011: 207-214 - 2010
- [c14]Jason Baumgartner, Michael L. Case, Hari Mony:
Coping with Moore's Law (and more): Supporting arrays in state-of-the-art model checkers. FMCAD 2010: 61-69
2000 – 2009
- 2009
- [c13]Hari Mony, Jason Baumgartner, Alan Mishchenko, Robert K. Brayton:
Speculative reduction-based scalable redundancy identification. DATE 2009: 1674-1679 - [c12]Jason Baumgartner, Hari Mony:
Scalable liveness checking via property-preserving transformations. DATE 2009: 1680-1685 - [c11]Michael L. Case, Hari Mony, Jason Baumgartner, Robert Kanzelman:
Enhanced verification by temporal decomposition. FMCAD 2009: 17-24 - [c10]Jason Baumgartner, Hari Mony, Michael L. Case, Jun Sawada, Karen Yorav:
Scalable conditional equivalence checking: An automated invariant-generation based approach. FMCAD 2009: 120-127 - 2008
- [c9]Jason Baumgartner, Hari Mony, Adnan Aziz:
Optimal Constraint-Preserving Netlist Simplification. FMCAD 2008: 1-9 - [c8]Michael L. Case, Alan Mishchenko, Robert K. Brayton, Jason Baumgartner, Hari Mony:
Invariant-Strengthened Elimination of Dependent State Elements. FMCAD 2008: 1-9 - 2007
- [c7]Adrian E. Seigler, Gary A. Van Huben, Hari Mony:
Formal Verification of Partial Good Self-Test Fencing Structures. FMCAD 2007: 188-191 - 2006
- [c6]Tilman Glökler, Jason Baumgartner, Devi Shanmugam, A. E. (Rick) Seigler, Gary A. Van Huben, Barinjato Ramanandray, Hari Mony, Paul Roessler:
Enabling Large-Scale Pervasive Logic Verification through Multi-Algorithmic Formal Reasoning. FMCAD 2006: 3-10 - [c5]Jason Baumgartner, Hari Mony, Viresh Paruthi, Robert Kanzelman, Geert Janssen:
Scalable Sequential Equivalence Checking across Arbitrary Design Transformations . ICCD 2006: 259-266 - 2005
- [c4]Jason Baumgartner, Hari Mony:
Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies. CHARME 2005: 222-237 - [c3]Hari Mony, Jason Baumgartner, Adnan Aziz:
Exploiting Constraints in Transformation-Based Verification. CHARME 2005: 269-284 - [c2]Hari Mony, Jason Baumgartner, Viresh Paruthi, Robert Kanzelman:
Exploiting suspected redundancy without proving it. DAC 2005: 463-466 - 2004
- [c1]Hari Mony, Jason Baumgartner, Viresh Paruthi, Robert Kanzelman, Andreas Kuehlmann:
Scalable Automated Verification via Expert-System Guided Transformations. FMCAD 2004: 159-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
