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

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

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

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

Automata and computability DC Kozen Springer Science & Business Media, 2012 | 800 | 2012 |

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

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

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

The design and analysis of algorithms DC Kozen Springer Science & Business Media, 2012 | 586 | 2012 |

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

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

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

Logics of programs D Kozen, J Tiuryn Formal Models and Semantics, 789-840, 1990 | 430 | 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 | 413 | 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 | 313 | 1978 |

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

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

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

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

On Hoare logic and Kleene algebra with tests D Kozen ACM Transactions on Computational Logic (TOCL) 1 (1), 60-76, 2000 | 229 | 2000 |