**Honors and Awards:** Sloan Research Fellowship - 2009, NSF CAREER Award - 2004

**Research Expertise: **Programming Languages | Security

Steve's research focuses on the problem of building software that is reliable, robust, and secure by construction. He draws on techniques from type theory, logic, and formal methods to develop programming languages that enforce strong information-flow and authorization policies in dynamic, distributed environments. His recent projects have developed techniques for incorporating robust declassification, dynamic principals, and cryptographic enforcement of authorization policies into a security-oriented language called AURA. Steve is also interested in machine-checked theorem proving, concurrent programming, and functional languages.

**Education:**

PhD Computer Science 2002 - Cornell University

MS Computer Science 2000 - Cornell University

BS Computer Science & Mathematics 1996 - Carnegie Mellon University

- From C to interaction trees: Specifying, verifying, and testing a networked server, Koh, N. | Li, Y. | Li, Y. | Xia, L.-Y. | Beringer, L. | HonorĂ©, W. | Mansky, W. | Pierce, B.C. | Zdancewic, S., CPP 2019 - Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with POPL 2019, 2019
- Reqwire: Reasoning about reversible quantum circuits, Rand, R. | Paykin, J. | Lee, D.-H. | Zdancewic, S., Electronic Proceedings in Theoretical Computer Science, EPTCS, 2019
- A linear/producer/consumer model of classical linear logic, Paykin, J. | Zdancewic, S., Mathematical Structures in Computer Science, 2018
- Qwire practice: Formal verification of quantum circuits in coq, Rand, R. | Paykin, J. | Zdancewic, S., Electronic Proceedings in Theoretical Computer Science, EPTCS, 2018
- Technical perspective building bug-free compilers, Zdancewic, S., Communications of the ACM, 2018