Open to opportunities

Pedro Abreu

@pedroabreu

Message

I verify cryptographic software, compilers, and hardware using proof assistants, SMT solving, C++, and Rust.

Brazil

Message

What I'm looking for

I'm looking to contribute to formal-verification work involving SMT-backed reasoning, interactive theorem proving, programming language theory, cryptographic software, compilers, or hardware correctness.

I've specified and checked functional and memory-safety invariants for Amazon's BIKE and SIKE post-quantum cryptographic C APIs at Galois, discharging proof obligations through symbolic execution over LLVM bitcode.

I've also verified a bytecode-to-x86-64 compiler against Jasmin semantics, proving sixteen correctness statements across roughly 380 lemmas and validating it with 29 differential end-to-end tests. At SiFive, I worked on correctness properties for a RISC-V floating-point unit using Rocq/Coq, Kami, Chisel analysis, and Cadence JasperGold.

I build language tools and systems software in C++, Rust, and OCaml, including a JVM, a 6502 emulator, and Coquedille. My research includes a first-author POPL 2023 paper on divide-and-conquer recursion in Coq, and I host Type Theory Forall interviews on formal methods and proof assistants.

Experience

Work history, roles, and key accomplishments

Research Intern

Galois

Jun 2019 - Aug 2019 (2 months)

Specified and checked functional and memory-safety invariants for Amazon's C implementations of the BIKE and SIKE post-quantum cryptographic APIs, using SAWScript and Cryptol. Translated informal API contracts into precise properties and discharged them by symbolic execution over LLVM bitcode.

SAWScript Cryptol Symbolic Execution LLVM C Formal Verification Post Quantum Cryptography