Results on the propositional μ-calculus D Kozen Theoretical computer science 27 (3), 333-354, 1983 | 2885 | 1983 |

Alternation A Chandra, D Kozen, L Stockmeyer J. Assoc. Comput. Mach. 28 (1), 114-133, 1981 | 2470 | 1981 |

Dynamic logic D Harel, D Kozen, J Tiuryn ACM SIGACT News 32 (1), 66-69, 2001 | 1938 | 2001 |

A completeness theorem for Kleene algebras and the algebra of regular events D Kozen Information and computation 110 (2), 366-390, 1994 | 897 | 1994 |

Automata and computability DC Kozen Springer Science & Business Media, 2007 | 762 | 2007 |

Semantics of probabilistic programs D Kozen 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 101-114, 1979 | 670 | 1979 |

Kleene algebra with tests D Kozen ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (3), 427-443, 1997 | 651 | 1997 |

Lower bounds for natural proof systems D Kozen 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 254-266, 1977 | 589 | 1977 |

Limits for automatic verification of finite-state concurrent systems KR Apt, D Kozen Inf. Process. Lett. 22 (6), 307-309, 1986 | 564 | 1986 |

The design and analysis of algorithms D Kozen Springer Science & Business Media, 1992 | 558 | 1992 |

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 | 512 | 2014 |

A probabilistic pdl D Kozen Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 440 | 1983 |

Logics of programs D Kozen, J Tiuryn Formal Models and Semantics, 789-840, 1990 | 409 | 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 | 397 | 1984 |

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 | 305 | 1978 |

Results on the propositional µ-calculus D Kozen DAIMI Report Series, 1982 | 288 | 1982 |

On Kleene algebras and closed semirings D Kozen Mathematical Foundations of Computer Science 1990: Banská Bystrica …, 1990 | 252 | 1990 |

Complexity of finitely presented algebras D Kozen Proceedings of the ninth annual ACM symposium on Theory of computing, 164-177, 1977 | 239 | 1977 |

An elementary proof of the completeness of PDL D Kozen, R Parikh Theoretical Computer Science 14 (1), 113-118, 1981 | 238 | 1981 |

Process logic: Expressiveness, decidability, completeness D Harel, D Kozen, R Parikh Journal of computer and system sciences 25 (2), 144-170, 1982 | 233 | 1982 |