• Publications
  • Influence
Dynamic logic
TLDR
Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. Expand
  • 1,054
  • 87
  • PDF
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
  • D. Kozen
  • Computer Science, Mathematics
  • Inf. Comput.
  • 15 July 1991
TLDR
A finitary axiomatization of the algebra of regular events involving only equations and equational implications that is sound for all interpretations over Kleene algebras is given. Expand
  • 681
  • 60
  • PDF
Lower bounds for natural proof systems
  • D. Kozen
  • Mathematics, Computer Science
  • 18th Annual Symposium on Foundations of Computer…
  • 30 September 1977
TLDR
Two decidable logical theories are presented, one complete for deterministic polynomial time, the other complete for Polynomial space. Expand
  • 457
  • 59
Kleene algebra with tests
TLDR
We introduce Kleene algebra with tests, an equational system for manipulating programs. Expand
  • 489
  • 58
  • PDF
Semantics of probabilistic programs
  • D. Kozen
  • Computer Science, Mathematics
  • 20th Annual Symposium on Foundations of Computer…
  • 1 June 1981
TLDR
In this paper we provide a formal semantics for a class of probabilistic programs. Expand
  • 494
  • 56
  • PDF
A probabilistic PDL
  • D. Kozen
  • Mathematics, Computer Science
  • STOC '83
  • 1 December 1983
TLDR
In this paper we give a probabilistic analog PPDL of Propositional Dynamic Logic and give a deductive calculus. Expand
  • 267
  • 48
Results on the Propositional µ-Calculus
We define a propositional version of the µ-calculus, and give an exponential-time decision procedure, small model property, and complete deductive system. We also show that it is strictly moreExpand
  • 483
  • 43
Results on the Propositional µ-Calculus
  • D. Kozen
  • Mathematics, Computer Science
  • ICALP
  • 12 July 1982
TLDR
We define a propositional version of the Μ-calculus, and give an exponential-time decision procedure, small model property, and complete deductive system. Expand
  • 781
  • 40
Automata and Computability
  • D. Kozen
  • Mathematics, Computer Science
  • Undergraduate Texts in Computer Science
  • 1 August 1997
TLDR
This introduction to the basic theoretical models of computability develops their rich and varied structure. Expand
  • 372
  • 36
Limits for Automatic Verification of Finite-State Concurrent Systems
TLDR
A new and distinct cultivar of petunia plant named Cas 57, characterized by the combined feature of pink-violet flowers with white bordered edges and white throat with dark violet veins, vigorous growth habit, long overhanging plant habit, and light green foliage. Expand
  • 395
  • 17