Dexter Kozen

Last updated
Dexter Kozen
BornDecember 20, 1951
United States
Alma mater Dartmouth College (BA, 1974), Cornell University (PhD, 1977)
Known for Dynamic logic (modal logic), Automata theory, Kleene algebra with tests
SpouseFrances 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/

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]

Contents

Career

Kozen 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

Related Research Articles

In mathematics, a Kleene algebra is an idempotent semiring endowed with a closure operator. It generalizes the operations known from regular expressions.

<span class="mw-page-title-main">Juris Hartmanis</span> American computer scientist (1928–2022)

Juris Hartmanis was a Latvian-born American computer scientist and computational theorist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".

<span class="mw-page-title-main">Samson Abramsky</span> British computer scientist

Samson Abramsky is a British computer scientist who is a Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021.

<span class="mw-page-title-main">Robert Harper (computer scientist)</span> Computer scientist

Robert William Harper, Jr. is a computer science professor at Carnegie Mellon University who works in programming language research. Prior to his position at Carnegie Mellon, Harper was a research fellow at the University of Edinburgh.

<span class="mw-page-title-main">Leslie Valiant</span> British American computer scientist

Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".

<span class="mw-page-title-main">Alexander Razborov</span> Russian mathematician

Aleksandr Aleksandrovich Razborov, sometimes known as Sasha Razborov, is a Soviet and Russian mathematician and computational theorist. He is Andrew McLeish Distinguished Service Professor at the University of Chicago.

ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.

The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation to mathematical logic. Extended versions of selected papers of each year's conference appear in renowned international journals such as Logical Methods in Computer Science and ACM Transactions on Computational Logic.

<span class="mw-page-title-main">David Gries</span> American computer scientist

David Gries is an American computer scientist at Cornell University, mainly known for his books The Science of Programming (1981) and A Logical Approach to Discrete Math.

<span class="mw-page-title-main">Yuri Gurevich</span> American computer scientist

Yuri Gurevich, Professor Emeritus at the University of Michigan, is an American computer scientist and mathematician and the inventor of abstract state machines.

<span class="mw-page-title-main">Cynthia Dwork</span> American computer scientist

Cynthia Dwork is an American computer scientist best known for her contributions to cryptography, distributed computing, and algorithmic fairness. She is one of the inventors of differential privacy and proof-of-work.

<span class="mw-page-title-main">Ryan Williams (computer scientist)</span> Computer scientist

Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.

Ashok K. Chandra was a computer scientist at Microsoft Research in Mountain View, California, United States, where he was a general manager at the Internet Services Research Center. Chandra received his PhD in Computer Science from Stanford University, an MS from University of California, Berkeley, and a BTech from IIT Kanpur. He was previously Director of Database and Distributed Systems at IBM Almaden Research Center.

Robert Lee Constable is an American computer scientist. He is a professor of computer science and first and former dean of the Faculty of Computing and Information Science at Cornell University. He is known for his work on connecting computer programs and mathematical proofs, especially the Nuprl system. Prior to Nuprl, he worked on the PL/CV formal system and verifier. Alonzo Church supervised Constable's junior thesis while he was studying in Princeton. Constable received his PhD in 1968 under Stephen Kleene and has supervised over 40 students.

<span class="mw-page-title-main">Toniann Pitassi</span> Canadian-American computer scientist

Toniann Pitassi is a Canadian-American mathematician and computer scientist specializing in computational complexity theory. She is currently Jeffrey L. and Brenda Bleustein Professor of Engineering at Columbia University and was Bell Research Chair at the University of Toronto.

<span class="mw-page-title-main">Prakash Panangaden</span> American/Canadian computer scientist

Prakash Panangaden is an American/Canadian computer scientist noted for his research in programming language theory, concurrency theory, Markov processes and duality theory. Earlier he worked on quantum field theory in curved space-time and radiation from black holes. He is the founding Chair of the ACM Special Interest Group on Logic and Computation.

ACM SIGLOG or SIGLOG is the Association for Computing Machinery Special Interest Group on Logic and Computation. It publishes a news magazine, and has the annual ACM–IEEE Symposium on Logic in Computer Science (LICS) as its flagship conference. In addition, it publishes an online newsletter, the SIGLOG Monthly Bulletin, and "maintains close ties" with the related academic journal ACM Transactions on Computational Logic.

Ronald Michiel de Wolf is a Dutch Computer Scientist, currently a Senior Researcher at Centrum Wiskunde & Informatica (CWI) and a professor at the Institute for Logic, Language and Computation (ILLC) of the University of Amsterdam (UvA).

Bakhadyr M. Khoussainov is a computer scientist and mathematician, who was born and educated in the Soviet Union, works in the fields of mathematical logic, computability theory, computable model theory and theoretical computer science. With Anil Nerode, he is the co-founder of the theory of automatic structures, which is an extension of the theory of automatic groups.

References

  1. ↑ "Faculty". Department of Computer Science. Cornell University. Retrieved 25 July 2024.
  2. ↑ Dexter Kozen at the Mathematics Genealogy Project
  3. ↑ Kozen, Dexter (1976-12-01). Complexity of finitely presented algebras (Report). Cornell University. Retrieved 2024-07-25.
  4. 1 2 Harel, David; Kozen, Dexter; Tiuryn, Jerzy (2000). Dynamic Logic. Cambridge, MA: MIT Press. ISBN   978-026227-495-1.
  5. ↑ Dexter Kozen (1983). "Results on the Propositional μ-Calculus". Theoretical Computer Science 27 (3): 333–354.
  6. 1 2 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.
  7. 1 2 "Previous Awards". EACSL. Archived from the original on 2023-09-27. Retrieved 2024-07-25.
  8. ↑ Kozen, Dexter (2006). Theory of Computation. London: Springer. ISBN   978-1-84628-297-3.
  9. ↑ Kozen, Dexter (1997). Automata and Computability. New York: Springer-Verlag. ISBN   978-0-387-94907-9.
  10. ↑ Kozen, Dexter (1991). The Design and Analysis of Algorithms. New York: Springer-Verlag. ISBN   978-0-387-97687-7.
  11. ↑ Donald, Bruce. "Harmful if Swallowed - MP3's". Bruce Randall Donald. Archived from the original on 24 July 2024. Retrieved 25 July 2024.
  12. ↑ "Cornell Rugby Football Club > Cornell Men Big Red Men > Team Contacts". Archived from the original on April 19, 2010. Retrieved October 7, 2010.
  13. 1 2 3 4 "Awards". Cornell Bowers CIS - Computer Science. Archived from the original on 2022-09-20. Retrieved 2022-09-08.
  14. ↑ "Dexter C. Kozen". John Simon Guggenheim Memorial Foundation. Retrieved 2022-09-08.
  15. ↑ "Dexter Kozen". Association for Computing Machinery. Archived from the original on 24 September 2023. Retrieved 25 July 2024.
  16. ↑ "AAAS Fellows" (PDF). AAAS . Retrieved 2022-09-08.
  17. ↑ 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 .
  18. ↑ "Professor Dexter Kozen". ru.nl. Retrieved 2015-03-17.[ dead link ]
  19. ↑ "Weiss Presidential Fellow (for contributions to undergraduate education)". Cornell . Retrieved 2022-09-08.
  20. ↑ "POPL 2020 Program". SIGPLAN. Retrieved 2022-09-08.
  21. ↑ 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 .
  22. ↑ "Awards". SPLASH 2023. Archived from the original on 4 March 2024. Retrieved 25 July 2024.
  23. ↑ 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.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.