| Results on the propositional ě-calculus D Kozen Theoretical computer science 27 (3), 333-354, 1983 | 2899 | 1983 |
| Alternation A Chandra, D Kozen, L Stockmeyer J. Assoc. Comput. Mach. 28 (1), 114-133, 1981 | 2302* | 1981 |
| Alternation AK Chandra, LJ Stockmeyer Foundations of Computer Science, 1976., 17th Annual Symposium on, 98-108, 1976 | 2302 | 1976 |
| Alternation AK Chandra, LJ Stockmeyer Foundations of Computer Science, 1976., 17th Annual Symposium on, 98-108, 1976 | 2302 | 1976 |
| Dynamic logic D Harel, D Kozen, J Tiuryn Handbook of philosophical logic, 99-217, 2001 | 1778 | 2001 |
| A completeness theorem for Kleene algebras and the algebra of regular events D Kozen Information and computation 110 (2), 366-390, 1994 | 808 | 1994 |
| Automata and computability DC Kozen Springer Science & Business Media, 2012 | 653 | 2012 |
| Semantics of probabilistic programs D Kozen 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 101-114, 1979 | 581 | 1979 |
| Kleene algebra with tests D Kozen ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (3), 427-443, 1997 | 565 | 1997 |
| Limits for automatic verification of finite-state concurrent systems KR Apt, D Kozen Inf. Process. Lett. 22 (6), 307-309, 1986 | 505 | 1986 |
| Lower bounds for natural proof systems D Kozen 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 254-266, 1977 | 505 | 1977 |
| The design and analysis of algorithms DC Kozen Springer Science & Business Media, 1992 | 495 | 1992 |
| Logics of programs D Kozen, J Tiuryn Formal Models and Semantics, 789-840, 1990 | 396 | 1990 |
| 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 | 388 | 1984 |
| 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 | 386 | 2014 |
| A probabilistic pdl D Kozen Journal of Computer and System Sciences 30 (2), 162-178, 1985 | 378 | 1985 |
| 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 | 285 | 1978 |
| Complexity of finitely presented algebras D Kozen Proceedings of the ninth annual ACM symposium on Theory of computing, 164-177, 1977 | 228 | 1977 |
| On Kleene algebras and closed semirings D Kozen International Symposium on Mathematical Foundations of Computer Science, 26-47, 1990 | 223 | 1990 |
| An elementary proof of the completeness of PDL D Kozen, R Parikh Theoretical Computer Science 14 (1), 113-118, 1981 | 217 | 1981 |
