Follow
Dexter Kozen
Dexter Kozen
Professor of Computer Science, Cornell University
Verified email at cs.cornell.edu - Homepage
Title
Cited by
Cited by
Year
Results on the propositional μ-calculus
D Kozen
Theoretical computer science 27 (3), 333-354, 1983
31511983
Alternation
A Chandra, D Kozen, L Stockmeyer
J. Assoc. Comput. Mach. 28 (1), 114-133, 1981
25121981
Dynamic logic
D Harel, D Kozen, J Tiuryn
ACM SIGACT News 32 (1), 66-69, 2001
19702001
A completeness theorem for Kleene algebras and the algebra of regular events
D Kozen
Information and computation 110 (2), 366-390, 1994
9101994
Automata and computability
DC Kozen
Springer Science & Business Media, 2007
7862007
Semantics of probabilistic programs
D Kozen
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 101-114, 1979
6881979
Kleene algebra with tests
D Kozen
ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (3), 427-443, 1997
6791997
Lower bounds for natural proof systems
D Kozen
18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 254-266, 1977
5941977
The design and analysis of algorithms
DC Kozen
Springer Science & Business Media, 2012
5772012
Limits for automatic verification of finite-state concurrent systems
KR Apt, D Kozen
Inf. Process. Lett. 22 (6), 307-309, 1986
5701986
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
5422014
A probabilistic pdl
D Kozen
Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983
4421983
Logics of programs
D Kozen, J Tiuryn
Formal Models and Semantics, 789-840, 1990
4291990
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
4111984
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
3121978
Theory of computation
DC Kozen
Springer, 2006
2752006
Complexity of finitely presented algebras
D Kozen
Proceedings of the ninth annual ACM symposium on Theory of computing, 164-177, 1977
2551977
On Kleene algebras and closed semirings
D Kozen
Mathematical Foundations of Computer Science 1990: Banská Bystrica …, 1990
2541990
An elementary proof of the completeness of PDL
D Kozen, R Parikh
Theoretical Computer Science 14 (1), 113-118, 1981
2451981
Process logic: Expressiveness, decidability, completeness
D Harel, D Kozen, R Parikh
Journal of computer and system sciences 25 (2), 144-170, 1982
2371982
The system can't perform the operation now. Try again later.
Articles 1–20