A
Aina Niemetz
Researcher at Stanford University
Publications - 38
Citations - 690
Aina Niemetz is an academic researcher from Stanford University. The author has contributed to research in topics: Satisfiability modulo theories & Solver. The author has an hindex of 11, co-authored 31 publications receiving 400 citations. Previous affiliations of Aina Niemetz include Johannes Kepler University of Linz.
Papers
More filters
Journal ArticleDOI
Boolector 2.0
TL;DR: The most important changes and new features introduced with version 2.0 of Boolector, which placed first in the QF_BV and QF-ABV tracks of the SMT competition 2014, are discussed.
Book ChapterDOI
cvc5: A Versatile and Industrial-Strength SMT Solver
Haniel Barbosa,Clark Barrett,Martin Brain,Gereon Kremer,Hanna Elif Lachnitt,Makai Mann,Abdalrhman Mohamed,Mudathir Mohamed,Aina Niemetz,Andres Nötzli,Alex Ozdemir,Mathias Preiner,Andrew Reynolds,Ying Sheng,Cesare Tinelli,Yoni Zohar +15 more
TL;DR: VC5 as discussed by the authors is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 ’s architectural design and highlights the major features and components introduced since CVC 4 1.8.
Book ChapterDOI
Btor2 , BtorMC and Boolector 3.0
TL;DR: Btor2, a word-level model checking format for capturing models of hardware and potentially software in a bit-precise manner, is described and supported by the new open source model checker BtorMC, which is built on top of version 3.0 of the SMT solver Boolector.
Book ChapterDOI
Resolution-based certificate extraction for QBF
TL;DR: This work describes the workflow consisting of proof checking, certificate extraction, and certificate checking, and implemented the steps of that workflow in stand-alone tools and carried out comprehensive experiments to demonstrate the practical applicability of resolution-based certificate extraction.
Proceedings Article
Resolution-Based Certificate Extraction for QBF - (Tool Presentation).
TL;DR: In this article, the authors present an integrated set of tools for resolution-based certificate extraction for quantified Boolean formulas in prenex conjunctive normal form, starting from resolution proofs produced by the solver DepQBF, and describe the workflow consisting of proof checking, certificate extraction, and certificate checking.