| Results on the propositional μ-calculus D Kozen Theoretical computer science 27 (3), 333-354, 1983 | 3316 | 1983 |
| Dynamic logic D Harel, D Kozen, J Tiuryn ACM SIGACT News 32 (1), 66-69, 2001 | 3302 | 2001 |
| Alternation A Chandra, D Kozen, L Stockmeyer J. Assoc. Comput. Mach. 28 (1), 114-133, 1981 | 2716 | 1981 |
| A completeness theorem for Kleene algebras and the algebra of regular events D Kozen Information and computation 110 (2), 366-390, 1994 | 1002 | 1994 |
| Automata and computability DC Kozen Springer Science & Business Media, 2007 | 847 | 2007 |
| Kleene algebra with tests D Kozen ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (3), 427-443, 1997 | 801 | 1997 |
| Semantics of probabilistic programs D Kozen 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 101-114, 1979 | 786 | 1979 |
| Lower bounds for natural proof systems D Kozen 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 254-266, 1977 | 649 | 1977 |
| NetKAT: Semantic foundations for networks CJ Anderson, N Foster, A Guha, JB Jeannin, D Kozen, C Schlesinger, ... Acm sigplan notices 49 (1), 113-126, 2014 | 616 | 2014 |
| The design and analysis of algorithms D Kozen Springer Science & Business Media, 1992 | 607 | 1992 |
| Limits for automatic verification of finite-state concurrent systems KR Apt, D Kozen Inf. Process. Lett. 22 (6), 307-309, 1986 | 590 | 1986 |
| A probabilistic pdl D Kozen Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 518 | 1983 |
| The complexity of elementary algebra and geometry M Ben-Or, D Kozen, J Reif Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 442 | 1984 |
| Logics of programs D Kozen, J Tiuryn Formal Models and Semantics, 789-840, 1990 | 441 | 1990 |
| On the power of the compass (or, why mazes are easier to search than graphs) M Blum, D Kozen 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), 132-142, 1978 | 337 | 1978 |
| Theory of computation DC Kozen Springer London, 2006 | 281 | 2006 |
| Complexity of finitely presented algebras D Kozen Proceedings of the ninth annual ACM symposium on Theory of computing, 164-177, 1977 | 267 | 1977 |
| On Kleene algebras and closed semirings D Kozen International Symposium on Mathematical Foundations of Computer Science, 26-47, 1990 | 266 | 1990 |
| On Hoare logic and Kleene algebra with tests D Kozen ACM Transactions on Computational Logic (TOCL) 1 (1), 60-76, 2000 | 251 | 2000 |
| An elementary proof of the completeness of PDL D Kozen, R Parikh Theoretical computer science 14 (1), 113-118, 1981 | 247 | 1981 |
