Dexter Kozen

IBM Research - Thomas J. Watson Research Center

Papers

Total Citations

392

H-Index

About

Dexter Kozen is a towering figure in theoretical computer science, whose work has fundamentally shaped our understanding of computation, logic, and verification. His research spans automata theory, program semantics, complexity, and algebraic algorithms. Kozen is perhaps best known for his seminal 1986 paper, "Limits for automatic verification of finite-state concurrent systems," which has garnered over 375 citations and laid critical groundwork for model checking by proving fundamental limitations in the automatic verification of concurrent systems. This work, alongside his foundational contributions to Kleene algebra and dynamic logic, has had a lasting impact on formal methods and programming language theory. He also made notable advances in symbolic computation, as seen in his work on parallel resultant computation, which provided efficient algebraic criteria for polynomial common zeros—a tool with applications in computational geometry and number theory. A professor at Cornell University, Kozen is also celebrated for his influential textbooks on automata and computability, which have educated generations of computer scientists. His career reflects a rare depth and breadth, bridging pure mathematical logic with practical algorithmic design.