activity
20172025
most citedAlethe: Towards a Generic SMT Proof Format (extended abstract)

18 citations · 25 across the 4 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2025

Lean-SMT: An SMT tactic for discharging proof goals in Lean

Abdalrhman Mohamed, Tomaz Mascarenhas, Harun Khan +5

Lean is an increasingly popular proof assistant based on dependent type theory. Despite its success, it still lacks important automation features present in more seasoned proof ass…

cs.LO202118 cited

Alethe: Towards a Generic SMT Proof Format (extended abstract)

Hans-Jörg Schurr, Mathias Fleury, Haniel Barbosa +1

The first iteration of the proof format used by the SMT solver veriT was presented ten years ago at the first PxTP workshop. Since then the format has matured. veriT proofs are use…

cs.LO2019

Proceedings Sixth Workshop on Proof eXchange for Theorem Proving

Giselle Reis, Haniel Barbosa

This volume of EPTCS contains the proceedings of the Sixth Workshop on Proof Exchange for Theorem Proving (PxTP 2019), held on 26 August 2019 as part of the CADE-27 conference in N…

cs.LO20191 cited

CVC4SY for SyGuS-COMP 2019

Andrew Reynolds, Haniel Barbosa, Andres Nötzli +2

CVC4Sy is a syntax-guided synthesis (SyGuS) solver based on bounded term enumeration and, for restricted fragments, quantifier elimination. The enumerative strategies are based on…

cs.LO2018

CVC4 at the SMT Competition 2018

Clark Barrett, Haniel Barbosa, Martin Brain +8

This paper is a description of the CVC4 SMT solver as entered into the 2018 SMT Competition. We only list important differences from the 2017 SMT Competition version of CVC4. For f…

cs.LO20176 cited

Language and Proofs for Higher-Order SMT (Work in Progress)

Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes +2

Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo…