default search action
Jason Baumgartner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c43]Rohit Dureja, Jason Baumgartner, Robert Kanzelman, Mark Williams, Kristin Y. Rozier:
Accelerating Parallel Verification via Complementary Property Partitioning and Strategy Exploration. FMCAD 2020: 16-25 - [c42]Jason Baumgartner, Savvas Zannettou, Brian Keegan, Megan Squire, Jeremy Blackburn:
The Pushshift Reddit Dataset. ICWSM 2020: 830-839 - [c41]Jason Baumgartner, Savvas Zannettou, Megan Squire, Jeremy Blackburn:
The Pushshift Telegram Dataset. ICWSM 2020: 840-847 - [c40]Emmi Bevensee, Maxwell Aliapoulios, Quinn Dougherty, Jason Baumgartner, Damon McCoy, Jeremy Blackburn:
SMAT: The Social Media Analysis Toolkit. ICWSM Workshops 2020 - [i2]Jason Baumgartner, Savvas Zannettou, Brian Keegan, Megan Squire, Jeremy Blackburn:
The Pushshift Reddit Dataset. CoRR abs/2001.08435 (2020) - [i1]Jason Baumgartner, Savvas Zannettou, Megan Squire
, Jeremy Blackburn:
The Pushshift Telegram Dataset. CoRR abs/2001.08438 (2020)
2010 – 2019
- 2019
- [c39]Rohit Dureja
Boosting Verification Scalability via Structural Grouping and Semantic Partitioning of Properties. FMCAD 2019: 1-9 - [c38]Raj Kumar Gajavelly
Input Elimination Transformations for Scalable Verification and Trace Reconstruction. FMCAD 2019: 10-18 - 2018
- [c37]Alexander Ivrii, Ziv Nevo, Jason Baumgartner:
k-FAIR = k-LIVENESS + FAIR Revisiting SAT-based Liveness Algorithms. FMCAD 2018: 1-5 - 2016
- [c36]Pradeep Kumar Nalla, Raj Kumar Gajavelly
The art of semi-formal bug hunting. ICCAD 2016: 51 - 2014
- [j4]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) - [c35]Pradeep Kumar Nalla, Raj Kumar Gajavelly
Effective Liveness Verification Using a Transformation-Based Framework. VLSID 2014: 74-79 - 2013
- [c34]Carmelo Loiacono, Marco Palena, Paolo Pasini, Denis Patti, Stefano Quer
Fast cone-of-influence computation and estimation in problems with multiple properties. DATE 2013: 803-806 - [c33]Alan Mishchenko, Niklas Eén, Robert K. Brayton, Jason Baumgartner, Hari Mony, Pradeep Kumar Nalla:
GLA: gate-level abstraction revisited. DATE 2013: 1399-1404 - [c32]Gadi Aleksandrowicz, Jason Baumgartner, Alexander Ivrii, Ziv Nevo:
Generalized counterexamples to liveness properties. FMCAD 2013: 169-180 - 2012
- [c31]Jiazhao Xu, Mark Williams, Hari Mony, Jason Baumgartner:
Enhanced reachability analysis via automated dynamic netlist-based hint generation. FMCAD 2012: 157-164 - [c30]Jason Baumgartner, Alexander Ivrii, Arie Matsliah, Hari Mony:
IC3-guided abstraction. FMCAD 2012: 182-185 - 2011
- [c29]Michael L. Case, Jason Baumgartner, Hari Mony, Robert Kanzelman:
Optimal redundancy removal without fixedpoint computation. FMCAD 2011: 101-108 - [c28]Michael L. Case, Jason Baumgartner, Hari Mony, Robert Kanzelman:
Approximate reachability with combined symbolic and ternary simulation. FMCAD 2011: 109-115 - [c27]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
- [c26]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
- [c25]Hari Mony, Jason Baumgartner, Alan Mishchenko, Robert K. Brayton:
Speculative reduction-based scalable redundancy identification. DATE 2009: 1674-1679 - [c24]Jason Baumgartner, Hari Mony:
Scalable liveness checking via property-preserving transformations. DATE 2009: 1680-1685 - [c23]Michael L. Case, Hari Mony, Jason Baumgartner, Robert Kanzelman:
Enhanced verification by temporal decomposition. FMCAD 2009: 17-24 - [c22]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
- [c21]Jason Baumgartner, Hari Mony, Adnan Aziz:
Optimal Constraint-Preserving Netlist Simplification. FMCAD 2008: 1-9 - [c20]Michael L. Case, Alan Mishchenko, Robert K. Brayton, Jason Baumgartner, Hari Mony:
Invariant-Strengthened Elimination of Dependent State Elements. FMCAD 2008: 1-9 - 2007
- [c19]Thuyen Le, Tilman Glökler, Jason Baumgartner:
Formal verification of a pervasive interconnect bus system in a high-performance microprocessor. DATE 2007: 219-224 - 2006
- [c18]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 - [c17]Jason Baumgartner:
Semi-Formal Verification at IBM. HLDVT 2006: 152 - [c16]Jason Baumgartner, Hari Mony, Viresh Paruthi, Robert Kanzelman, Geert Janssen:
Scalable Sequential Equivalence Checking across Arbitrary Design Transformations . ICCD 2006: 259-266 - 2005
- [j3]Rebecca M. Gott, Jason Baumgartner, Paul Roessler, S. I. Joe:
Functional formal verification on designs of pSeries microprocessors and communication subsystems. IBM J. Res. Dev. 49(4-5): 565-580 (2005) - [c15]Jason Baumgartner, Hari Mony:
Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies. CHARME 2005: 222-237 - [c14]Hari Mony, Jason Baumgartner, Adnan Aziz:
Exploiting Constraints in Transformation-Based Verification. CHARME 2005: 269-284 - [c13]Hari Mony, Jason Baumgartner, Viresh Paruthi, Robert Kanzelman:
Exploiting suspected redundancy without proving it. DAC 2005: 463-466 - [c12]Christian Jacobi, Kai Weber, Viresh Paruthi, Jason Baumgartner:
Automatic Formal Verification of Fused-Multiply-Add FPUs. DATE 2005: 1298-1303 - [c11]Fadi A. Zaraket
Scalable compositional minimization via static analysis. ICCAD 2005: 1060-1067 - 2004
- [c10]Jason Baumgartner, Andreas Kuehlmann:
Enhanced Diameter Bounding via Structural. DATE 2004: 36-41 - [c9]Hari Mony, Jason Baumgartner, Viresh Paruthi, Robert Kanzelman, Andreas Kuehlmann:
Scalable Automated Verification via Expert-System Guided Transformations. FMCAD 2004: 159-173 - 2003
- [j2]Jason Baumgartner, Tamir Heyman, Vigyan Singhal, Adnan Aziz:
An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists. Formal Methods Syst. Des. 23(1): 39-65 (2003) - 2002
- [j1]John M. Ludden, Wolfgang Roesner, Gerry M. Heiling, John R. Reysa, Jonathan R. Jackson, Bing-Lun Chu, Michael L. Behm, Jason Baumgartner, Richard D. Peterson, Jamee Abdulhafiz, William E. Bucy, John H. Klaus, Danny J. Klema, Tien N. Le, F. Danette Lewis, Philip E. Milling, Lawrence A. McConville, Bradley S. Nelson, Viresh Paruthi, Travis W. Pouarz, Audre D. Romonosky, Jeff Stuecheli, Kent D. Thompson, Dave W. Victor, Bruce Wile:
Functional verification of the POWER4 microprocessor and POWER4 multiprocessor system. IBM J. Res. Dev. 46(1): 53-76 (2002) - [c8]Jason Baumgartner, Andreas Kuehlmann, Jacob A. Abraham:
Property Checking via Structural Analysis. CAV 2002: 151-165 - [c7]Jason Baumgartner, Tim A. Waugh:
Roget2000: a 2D hyperbolic tree visualization of Roget's Thesaurus. Visualization and Data Analysis 2002: 339-346 - 2001
- [c6]Andreas Kuehlmann, Jason Baumgartner:
Transformation-Based Verification Using Generalized Retiming. CAV 2001: 104-117 - [c5]Jason Baumgartner, Andreas Kuehlmann:
Min-Area Retiming on Dynamic Circuit Structures. ICCAD 2001: 176-182 - 2000
- [c4]Jason Baumgartner, Anson Tripp, Adnan Aziz, Vigyan Singhal, Flemming Andersen:
An Abstraction Algorithm for the Verification of Generalized C-Slow Designs. CAV 2000: 5-19
1990 – 1999
- 1999
- [c3]Jason Baumgartner, Tamir Heyman, Vigyan Singhal, Adnan Aziz:
Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists. CAV 1999: 72-83 - [c2]Nadeem Malik, Jason Baumgartner, Steven Roberts, Ryan Dobson:
A toolset for assisted formal verification. IPCCC 1999: 489-492 - 1998
- [c1]Nina Saxena, Jason Baumgartner, Avijit Saha, Jacob A. Abraham:
To model check or not to model check. ICCD 1998: 314-320
Coauthor Index
aka: Robert L. Kanzelman
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: