Adam Chlipala

Adam Chlipala is the Arthur J. Conner Professor of Computer Science at the Massachusetts Institute of Technology (MIT). His work bridges programming languages, formal methods, computer systems, and security, with a focus on building practical systems verified end-to-end using the Coq proof assistant. He has advised numerous PhD and Master’s students and leads research into verified compilers, hardware-software stacks, and dependent types for real-world applications through his startup Nectry.

• Undergraduate: Carnegie Mellon University, 2003
• PhD: University of California, Berkeley, 2007
• Postdoc: Harvard University, through 2011

His research revolves around verified compilers, hardware-software co-verification, and dependent types for enterprise software. Recent work explores high-performance parallel computing stacks and end-to-end machine-checked proofs for cryptographic systems. His publications span conferences like PLDI, POPL, and ICFP, emphasizing formal verification, optimization, and security.

Current research trends highlight verified cryptographic code, concurrent hardware verification, and DSLs with formal guarantees. His students work on topics from state machines to network switches and parallel computing frameworks.

• Coq Proof Assistant
• Verified Compilation
• Cryptographic Security
• Dependent Types
• Hardware Verification
• High-Performance Computing

Chlipala has served on program committees for CoqPL, Dafny, CPP, and PLDI. He co-created the MIT course Formal Reasoning About Programs and authored two books: Certified Programming with Dependent Types and Formal Reasoning About Programs.