Skip to content

Grand Challenge 3

Grand Challenge 3

How do we build computing systems that can be trusted to do exactly what we want them to do, every time?

From elections to energy grids, society depends on computers that must be safe, secure, and reliable: not just 90% or even 99% of the time, but every time.

That’s where verification comes in: using math to prove software always behaves as intended. In the lab, verification has been shown to produce applications that are dramatically safer and more reliable. But real-world code is so complex, most of it can’t be fully verified today, and the rise of unpredictable AI and “vibe coding” only raises the stakes. Allen School researchers are working to make verification practical across the stack — from chips and compilers, to cryptographic protocols and ML-powered apps.


Selected Projects

Michael Flanders, Reshabh Sharma, Alexandra Michael, Dan Grossman, David Kohlbrenner
ASPLOS, 2024

Yuval Ishai, Hanjun Li, and Huijia Lin
FOCS 2025

Wilson Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, Dan Boneh
IACR CRYPTO 2024

Zijing Di, Lucas Xia, Wilson Nguyen, Nirvan Tyagi
IACR ASIACRYPT 2024

Junhan Kong, Mingyuan Zhong, James Fogarty, Jacob O. Wobbrock
International ACM SIGACCESS Conference on Computers 2024