Dexter Campbell Kozen (born December 20, 1951) is an American theoretical computer scientist. He is Professor Emeritus and Joseph Newton Pew, Jr. Professor in Engineering at Cornell University.[1]
Dexter Kozen | |
|---|---|
| Born | December 20, 1951 |
| Alma mater | Dartmouth College (BA, 1974), Cornell University (PhD, 1977) |
| Known for | Dynamic logic (modal logic), Automata theory, Kleene algebra with tests |
| Spouse | Frances Kozen |
| Scientific career | |
| Fields | Theoretical computer science |
| Institutions | Cornell University (1985–), Radboud University Nijmegen (2014) |
| Thesis | Complexity of Finitely Presented Algebras (1977) |
| Doctoral advisor | Juris Hartmanis |
| Website | https://www.cs.cornell.edu/~kozen/ |
Career
editKozen received his BA in mathematics from Dartmouth College in 1974 and his PhD in computer science in 1977 from Cornell University, where he was advised by Juris Hartmanis on the thesis, Complexity of Finitely Presented Algebras.[2][3]
He is known for his work at the intersection of logic and complexity. He is one of the fathers of dynamic logic[4] and developed the version of the modal μ-calculus most used today.[5] His work on Kleene algebra with tests[6] was recognized with an Alonzo Church Award in 2022.[7] Moreover, he has written several textbooks on the theory of computation,[8] automata theory,[9] dynamic logic,[4] and algorithms.[10]
Kozen was a guitarist, singer, and songwriter in the band "Harmful if Swallowed".[11] He also holds the position of faculty advisor for Cornell's rugby football club.[12]
Awards and honors
edit- John G. Kemeny Prize in Computing, Dartmouth College[13] (1974)
- Outstanding Innovation Award, IBM Corporation[13] (1974)
- Fellow, John Simon Guggenheim Foundation[14] (1991)
- Stephen and Margery Russell Distinguished Teaching Award, College of Arts and Sciences, Cornell[13] (2001)
- ACM Fellow, for contributions to theoretical computer science[15] (2003)
- Fellow, AAAS[16] (2008)
- 2001 LICS Test-of-Time Award for the paper "A completeness theorem for Kleene algebras and the algebra of regular events"[17] (2011)
- Faculty of the Year, ACSU (Association of Computer Science Undergraduates at Cornell)[13] (2013)
- Radboud Excellence professorship at the Radboud University Nijmegen[18] (2014)
- Fellow, EATCS (2015)
- EATCS Distinguished Achievements Award (2016)
- McDowell Award, for groundbreaking contributions to topics ranging from computational complexity to the analysis of algebraic computations to logics of programs and verification (2016)
- Weiss Presidential Fellow[19] (2018)
- POPL Distinguished Paper Award[20] for the paper "Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time"[21] (2020)
- Alonzo Church Award,[7] for his fundamental work on developing the theory and applications of Kleene Algebra with Tests, an equational system for reasoning about iterative programs, published in the paper "Kleene algebra with tests"[6] (2022)
- OOPSLA Distinguished Paper Award[22] for the paper "Formal abstractions for packet scheduling"[23] (2023)
References
edit- ^ "Faculty". Department of Computer Science. Cornell University. Retrieved 25 July 2024.
- ^ Dexter Kozen at the Mathematics Genealogy Project
- ^ Kozen, Dexter (1976-12-01). Complexity of finitely presented algebras (Report). Cornell University. Retrieved 2024-07-25.
- ^ a b Harel, David; Kozen, Dexter; Tiuryn, Jerzy (2000). Dynamic Logic. Cambridge, MA: MIT Press. ISBN 978-026227-495-1.
- ^ Dexter Kozen (1983). "Results on the Propositional μ-Calculus". Theoretical Computer Science 27 (3): 333–354.
- ^ a b Kozen, Dexter (May 1977). "Kleene algebra with tests". ACM Transactions on Programming Languages and Systems. 19 (3): 427–443. doi:10.1145/256167.256195. S2CID 6658131.
- ^ a b "Previous Awards". EACSL. Archived from the original on 2023-09-27. Retrieved 2024-07-25.
- ^ Kozen, Dexter (2006). Theory of Computation. London: Springer. ISBN 978-1-84628-297-3.
- ^ Kozen, Dexter (1997). Automata and Computability. New York: Springer-Verlag. ISBN 978-0-387-94907-9.
- ^ Kozen, Dexter (1991). The Design and Analysis of Algorithms. New York: Springer-Verlag. ISBN 978-0-387-97687-7.
- ^ Donald, Bruce. "Harmful if Swallowed - MP3's". Bruce Randall Donald. Archived from the original on 24 July 2024. Retrieved 25 July 2024.
- ^ "Cornell Rugby Football Club > Cornell Men Big Red Men > Team Contacts". Archived from the original on April 19, 2010. Retrieved October 7, 2010.
- ^ a b c d "Awards". Cornell Bowers CIS - Computer Science. Archived from the original on 2022-09-20. Retrieved 2022-09-08.
- ^ "Dexter C. Kozen". John Simon Guggenheim Memorial Foundation. Retrieved 2022-09-08.
- ^ "Dexter Kozen". Association for Computing Machinery. Archived from the original on 24 September 2023. Retrieved 25 July 2024.
- ^ "AAAS Fellows" (PDF). AAAS. Retrieved 2022-09-08.
- ^ Kozen, Dexter (1991). "A completeness theorem for Kleene algebras and the algebra of regular events". Proc. 1991 Sixth Annual IEEE Symp. on Logic in Computer Science. Amsterdam, Netherlands: IEEE Computer Society. pp. 214–225. doi:10.1109/LICS.1991.151646. hdl:1813/6963.
- ^ "Professor Dexter Kozen". ru.nl. Retrieved 2015-03-17.[dead link]
- ^ "Weiss Presidential Fellow (for contributions to undergraduate education)". Cornell. Retrieved 2022-09-08.
- ^ "POPL 2020 Program". SIGPLAN. Retrieved 2022-09-08.
- ^ Smolka, Steffen; Foster, Nate; Hsu, Justin; Kappé, Tobias; Kozen, Dexter; Silva, Alexandra (January 2020). "Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time". Proc of the ACM on Programming Languages. Vol. 4. IEEE Computer Society. pp. 214–225. arXiv:1907.05920. doi:10.1145/3371129.
- ^ "Awards". SPLASH 2023. Archived from the original on 4 March 2024. Retrieved 25 July 2024.
- ^ Mohan, Anshuman; Liu, Yunhe; Foster, Nate; Kappé, Tobias; Kozen, Dexter (16 October 2023). "Formal Abstractions for Packet Scheduling". Proceedings of the ACM on Programming Languages. 7 (OOPSLA2): 1338–1362. arXiv:2211.11659. doi:10.1145/3622845.