Haniel Barbosa
Scholar

Haniel Barbosa

Google Scholar ID: 14LdhrcAAAAJ
Universidade Federal de Minas Gerais
Automated ReasoningSatisfiability Modulo TheoriesFormal VerificationFormal Methods
Citations & Impact
All-time
Citations
1,431
 
H-index
14
 
i10-index
19
 
Publications
20
 
Co-authors
31
list available
Resume (English only)
Academic Achievements
  • 2025: Paper on 'Reconstruction of cvc5 Alethe proofs in Isabelle/HOL' accepted at ITP'25.
  • 2025: Paper on the 'Lean-SMT project' accepted at CAV'25.
  • 2024: Invited tutorial 'SMT solving for verification' at ATVA 2024.
  • 2024: Invited lecture 'An introduction to SMT solving with quantifiers' at SAT/SMT/AR Summer School 2024.
  • 2024: Co-PI of the DARPA-funded PEGISUS project (Proof EnGineering and Integration with Satisfiability modUlo theorieS).
  • 2024: Paper 'Towards Producing Shorter Congruence Closure Proofs in a State-of-the-art SMT Solver' to appear at PAAR 2024.
  • 2024: Tutorial paper 'Satisfiability Modulo Theories: A Beginner's Tutorial' to appear at FM'24.
  • 2024: Paper on IsaRare to appear at TACAS'24.
  • 2023: Article 'Generating and Exploiting Automated Reasoning Proof Certificates' published in Communications of the ACM.
  • 2023: Paper 'An Interactive SMT Tactic in Coq using Abductive Reasoning' appeared at LPAR'23.
  • 2023: Paper on Carcara appeared at TACAS'23.
  • Multiple invited talks at international workshops including SC-Square and Machine Assisted Proofs (IPAM/UCLA).
Background
  • Tenured Assistant Professor in the Department of Computer Science (DCC) at Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil.
  • Research focuses on improving Satisfiability Modulo Theories (SMT) solvers for formal verification and enhancing their trustworthiness through proof certificate generation and checking.
  • Senior technical lead for the state-of-the-art SMT solver cvc5.
  • Research currently supported by DARPA, CAPES, and Amazon Web Services.
  • Actively seeking motivated undergraduate, master's, and PhD students to work on the above topics.