Uğur Y. Yavuz
Uğur Y. Yavuz
(he/him)
uyyavuz (at) bu (dot) edu

About Me

I am a third-year Ph.D. student in the Department of Computer Science at Boston University, advised by Marco Gaboardi and Alley Stoughton. I am part of the Principles of Programming and Verification group at BU, where I organize the weekly POPV seminar series. Before joining BU, I received an M.S. in Computer Science and an A.B. in Computer Science and Mathematics from Dartmouth College, where I had the pleasure of working with Prof. Prasad Jayanti.

My research focuses on the specification and formal verification of concurrent algorithms and systems. I am particularly interested in proof development using tools such as TLA+/TLAPS, EasyCrypt, and EasyUC. Most recently, I’ve been exploring how to study linearizability as a universally composable (UC) security property using the EasyUC framework.

publications

news

blog

Mechanized Metatheory of Forward Reasoning for End-to-End Linearizability Proofs
(with collaborators)
Under review
Formal Machine-Verification of MemSnap: an Efficient, Far-Future Linearizable Snapshot Algorithm
(with collaborators)
Under review
Meta-Configuration Tracking for Machine-Certified Correctness of Concurrent Data Structures
Prasad Jayanti, Siddhartha Jayanti, Ugur Yavuz, Lizzie Hernandez
ACM Workshop on Highlights of Parallel Computing (HOPC), 2024
A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability
Prasad Jayanti, Siddhartha Jayanti, Ugur Yavuz, Lizzie Hernandez
51st ACM Symposium on Principles of Programming Languages (POPL), 2024
A Machine-Verified Proof of Linearizability for a Queue Algorithm
Ugur Y. Yavuz
Dartmouth College, Master's thesis, 2022
Coming soon! 🚧
This section is under construction — check back soon for updates.