Alexander Ozdemir
Greater Los Angeles Area United States
Summary
🤩
Rockstar🎓
Top SchoolAlexander Ozdemir is a problem-driven software engineer and Harvey Mudd student studying Computational, Mathematical, and Physical Theory with 11 years of hands-on experience across research and industry internships. He has contributed to high-assurance tooling—most notably significant back-end and algorithm work on the cvc5 SMT theorem prover, refactoring proof storage and bit-vector proof systems for better performance and proof quality. His research experience includes static and dataflow analyses of Rust’s unsafe usage at Harvard, and he’s built large-scale syntactic tooling and detectors that informed published write-ups. Comfortable in distributed systems and infrastructure from internships at Facebook and J.P. Morgan, he also tutors and mentors students at Harvey Mudd, blending deep technical rigor with teaching. Colleagues describe him as intellectually curious and deliberate: he treats gaps in knowledge as opportunities to design more impactful, auditable solutions.
12 years of coding experience
1 year of employment as a software developer
Mira Loma High SchoolBachelor of Science (BS), Mathematics and Computer Science, Bachelor of Science (BS), Mathematics and Computer Science at Harvey Mudd College
French, English
Github Skills (13)
algorithm10
data-structures10
theorem-proving10
algorithms10
code-optimization10
c-language10
cprogramming-language10
data-structure10
architecture9
architectures9
logic8
symbolic-logic8
logical8
Programming languages (14)
Github contributions (5)
cvc5/cvc5
Oct 2018 - Jan 2023
cvc5 is an open-source automatic theorem prover for Satisfiability Modulo Theories (SMT) problems.
Role in this project:
Back-end Developer & Algorithm Engineer
Back-end Developer & Algorithm EngineerContributions:186 reviews, 172 commits, 222 PRs in 4 years 4 months
Contributions summary:Alexander made significant contributions to the core of the cvc5 theorem prover, specifically within the proof system. Their work involved refactoring the storage and iteration methods for lemma proof steps, shifting from a linked list to a vector for improved performance. They also introduced iterators for proof steps and implemented output stream operations for proof step and lemma proof recipes. Furthermore, they modified and extended the architecture of the bit-vector proof system, by refactoring the bit-vector proof into a super/sub class structure and adding DRAT optimization. They worked on providing better lemmas and proofs. They also improved the API.
satisfiability
alex-ozdemir/circ
Mar 2022 - Jan 2023
(Cir)cuit (C)ompiler. Compiling high-level languages for SMT, zero-knowledge proofs, and more.
Contributions:169 commits, 244 pushes, 194 branches in 10 months
compilercompilingprogramming-languagedependent-typeszero
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.