Publications Available Online
Dexter Kozen

[2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [2003] [2002] [2001] [2000] [1999] [1998] [1997] [1996] [1995] [1994] [1993] [1992] [1991] [1990] [1989] [1988] [1987] [1986] [1985] [1983] [1981]

[By area] [Show abstracts] [Home]

2012

• Dexter Kozen. New. Technical Report http://hdl.handle.net/1813/28632, Computing and Information Science, Cornell University, March 2012. Conf. Mathematical Foundations of Programming Semantics (MFPS XXVIII), Bath, UK, June 2012, to appear.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Jean-Baptiste Jeannin and Dexter Kozen. Capsules and separation. Technical Report http://hdl.handle.net/1813/28284, Computing and Information Science, Cornell University, January 2012. Conf. Logic in Computer Science (LICS12), Dubrovnik, Croatia, June 2012, to appear.
  [full text (.pdf)] [abstract] [bibtex] [top]

2011

• Dexter Kozen and Alexandra Silva. Left-handed completeness. Technical Report http://hdl.handle.net/1813/23556, Computing and Information Science, Cornell University, August 2011.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Alexandra Silva. On Moessner's theorem. Technical Report http://hdl.handle.net/1813/22959, Computing and Information Science, Cornell University, June 2011. American Mathematical Monthly, to appear.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Ganesh Ramanarayanan. Publication/citation: A proof-theoretic approach to mathematical knowledge management. In Johan van Benthem, Amitabha Gupta, and Eric Pacuit, editors, Games, Norms, and Reasons: Logic at the Crossroads, volume 353 of Synthese Library, pages 151-161. Dordrecht, Springer Science and Business Media, 2011.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Realization of coinductive types. In Michael Mislove and Joël Ouaknine, editors, Proc. 27th Conf. Math. Found. Programming Semantics (MFPS XXVII), pages 148-155, Pittsburgh, PA, May 2011. Elsevier Electronic Notes in Theoretical Computer Science.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Jean-Baptiste Jeannin and Dexter Kozen. Computing with capsules. Technical Report http://hdl.handle.net/1813/22082, Computing and Information Science, Cornell University, January 2011. Proc. Conf. Descriptional Complexity of Formal Systems (DCFS 2012), Braga, Portugal, July 2012, to appear.
  [full text (.pdf)] [abstract] [bibtex] [top]

2010

• Dexter Kozen. Halting and equivalence of program schemes in models of arbitrary theories. In Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, editors, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, volume 6300 of Lecture Notes in Computer Science, pages 463-469. Springer-Verlag, August 2010.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Church-Rosser made easy. Fundamenta Informaticae, 103:129-136, 2010.
  [full text (.pdf)] [abstract] [bibtex] [top]

2009

• Nikos Karampatziakis and Dexter Kozen. Learning prediction suffix trees with Winnow. In Léon Bottou and Michael Littman, editors, Proc. 26th Int. Conf. Machine Learning (ICML'09), pages 489-496, Montreal, Canada, June 2009. Omnipress.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Lexicographic flow. Technical Report http://hdl.handle.net/1813/13018, Computing and Information Science, Cornell University, June 2009.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Optimal coin flipping. Technical Report http://hdl.handle.net/1813/12869, Computing and Information Science, Cornell University, June 2009.
  [full text (.pdf)] [abstract] [bibtex] [top]

2008

• Dexter Kozen. Nonlocal flow of control and Kleene algebra with tests. In Proc. 23rd IEEE Symp. Logic in Computer Science (LICS'08), pages 105-117, June 2008.
  [full text] [abstract] [bibtex] [top]

• Dexter Kozen. On the coalgebraic theory of Kleene algebra with tests. Technical Report http://hdl.handle.net/1813/10173, Computing and Information Science, Cornell University, March 2008.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Wei-Lung (Dustin) Tseng. The Böhm-Jacopini theorem is false, propositionally. In P. Audebaud and C. Paulin-Mohring, editors, Proc. 9th Int. Conf. Mathematics of Program Construction (MPC'08), volume 5133 of Lect. Notes in Comput. Sci., pages 177-192. Springer, July 2008.
  [full text (.pdf)] [abstract] [bibtex] [top]

2007

• Fred B. Schneider, Dexter Kozen, Greg Morrisett, and Andrew C. Myers. Language-based security for malicious mobile code. In Department of Defense Sponsored Information Security Research: New Methods for Protecting Against Cyber Threats, pages 477-494. Wiley, 2007.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Kamal Aboul-Hosn and Dexter Kozen. Local variable scoping and Kleene algebra with tests. J. Log. Algebr. Program., 2007. DOI: 10.1016/j.jlap.2007.10.007.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Coinductive proof principles for stochastic processes. Logical Methods in Computer Science, 3(4:8), 2007. DOI: 10.2168/LMCS-3 (4:8) 2007.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Marc Timme. Indefinite summation and the Kronecker delta. Technical Report http://hdl.handle.net/1813/8352, Computing and Information Science, Cornell University, October 2007.
  [full text] [abstract] [bibtex] [top]

• Dexter Kozen and Alexa Sharp. On distance coloring. Technical Report TR2007-2084, Computing and Information Science, Cornell University, June 2007.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Daniel Sheldon, M. A. Saleh Elmohamed, and Dexter Kozen. Collective inference on Markov models for modeling bird migration. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems (NIPS'07), volume 20, December 2007.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Nicholas Ruozzi. Applications of metric coinduction. In T. Mossakowski et al., editor, Proc. 2nd Conf. Algebra and Coalgebra in Computer Science (CALCO 2007), volume 4624 of Lecture Notes in Computer Science, pages 327-341. Springer, August 2007.
  [full text (.pdf)] [abstract] [bibtex] [top]

2006

• Dexter Kozen. On the representation of Kleene algebras with tests. In R. Královic and P. Urzyczyn, editors, Proc. Conf. Mathematical Foundations of Computer Science (MFCS'06), volume 4162 of Lecture Notes in Computer Science, pages 73-83. Springer, August 2006.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Kamal Aboul-Hosn and Dexter Kozen. Relational semantics for higher-order programs. In Tarmo Uustalu, editor, Proc. 8th Int. Conf. Mathematics of Program Construction (MPC'06), volume 4014 of Lecture Notes in Computer Science, pages 29-48. Springer, July 2006.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen, Christoph Kreitz, and Eva Richter. Automating proofs in category theory. In Proc. 3rd Int. Joint Conf. Automated Reasoning (IJCAR'06), number 4130 in Lecture Notes in AI, pages 392-407. Springer, August 2006.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Kamal Aboul-Hosn and Dexter Kozen. KAT-ML: An interactive theorem prover for Kleene algebra with tests. Journal of Applied Non-Classical Logics, 16(1-2):9-33, 2006.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Theory of Computation. Springer, New York, 2006.
  [table of contents (.pdf)] [abstract] [bibtex] [top]

2005

• Łucja Kot and Dexter Kozen. Kleene algebra and bytecode verification. In Fausto Spoto, editor, Proc. 1st Workshop Bytecode Semantics, Verification, Analysis, and Transformation (Bytecode'05), pages 201-215, April 2005.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Chavdar Botev, Hubert Chao, Theodore Chao, Yim Cheng, Raymond Doyle, Sergey Grankin, Jon Guarino, Saikat Guha, PeiChen Lee, Dan Perry, Christopher Re, Ilya Rifkin, Tingyan Yuan, Dora Abdullah, Kathy Carpenter, David Gries, Dexter Kozen, Andrew Myers, David Schwartz, and Jayavel Shanmugasundaram. Supporting workflow in a course management system. In W. Dann et al., editor, Proc. 36th Technical Symposium on Computer Science Education (SIGCSE'05), pages 262-266. ACM SIGCSE, February 2005.
  [full text (.pdf)] [abstract] [bibtex] [top]

2004

• Łucja Kot and Dexter Kozen. Second-order abstract interpretation via Kleene algebra. Technical Report TR2004-1971, Computer Science Department, Cornell University, December 2004.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Bernhard Möller. Separability in domain semirings. Technical Report 2004-16, Universität Augsburg, Institut für Informatik, December 2004.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Toward the automation of category theory. Technical Report TR2004-1964, Computer Science Department, Cornell University, September 2004.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Natural transformations as rewrite rules and monad composition. Technical Report TR2004-1942, Computer Science Department, Cornell University, July 2004.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Some results in dynamic model theory. Science of Computer Programming, 51(1-2):3-22, May 2004. Special issue: Mathematics of Program Construction (MPC 2002). Eerke Boiten and Bernhard Möller (eds.).
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Computational inductive definability. Annals of Pure and Applied Logic, 126(1-3):139-148, April 2004. Special issue: Provinces of logic determined. Essays in the memory of Alfred Tarski. Zofia Adamowicz, Sergei Artemov, Damian Niwinski, Ewa Orlowska, Anna Romanowska, and Jan Wolenski (eds.).
  [full text (.pdf)] [abstract] [bibtex] [top]

2003

• Dexter Kozen. Kleene algebras with tests and the static analysis of programs. Technical Report TR2003-1915, Computer Science Department, Cornell University, November 2003.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Automata on guarded strings and applications. Matématica Contemporânea, 24:117-139, 2003.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Chris Hardin and Dexter Kozen. On the complexity of the Horn theory of REL. Technical Report TR2003-1896, Computer Science Department, Cornell University, May 2003.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Jerzy Tiuryn. Substructural logic and partial correctness. Trans. Computational Logic, 4(3):355-378, July 2003.
  [full text (.pdf)] [abstract] [bibtex] [top]

2002

• Dexter Kozen. On Hoare logic, Kleene algebra, and types. In P. Gärdenfors, J. Wole\'nski, and K. Kijania-Placek, editors, In the Scope of Logic, Methodology, and Philosophy of Science: Volume 1 of the 11th Int. Congress Logic, Methodology and Philosophy of Science, Cracow, August 1999, volume 315 of Studies in Epistemology, Logic, Methodology, and Philosophy of Science, pages 119-133. Kluwer, 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Robert Givan, David McAllester, Carl Witty, and Dexter Kozen. Tarskian set constraints. Information and Computation, 174(2):105-131, May 2002.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. On the complexity of reasoning in Kleene algebra. Information and Computation, 179:152-162, 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Halting and equivalence of schemes over recursive theories. Technical Report TR2002-1881, Computer Science Department, Cornell University, October 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Chris Hardin and Dexter Kozen. On the elimination of hypotheses in Kleene algebra with tests. Technical Report TR2002-1879, Computer Science Department, Cornell University, October 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Frank Adelstein, Dexter Kozen, and Matt Stillerman. Malicious code detection for open firmware. In Proc. 18th Computer Security Applications Conf. (ACSAC'02), pages 403-412, December 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Adam Barth and Dexter Kozen. Equational verification of cache blocking in LU decomposition using Kleene algebra with tests. Technical Report TR2002-1865, Computer Science Department, Cornell University, June 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. On two letters versus three. In Zoltán Ésik and Anna Ingólfsdóttir, editors, Proc. Workshop on Fixed Points in Computer Science (FICS'02), pages 44-50, July 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Matt Stillerman. Eager class initialization for Java. In W. Damm and E.R. Olderog, editors, Proc. 7th Int. Symp. Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT'02), volume 2469 of Lecture Notes in Computer Science, pages 71-80. IFIP, Springer-Verlag, Sept. 2002.
  [full text (.pdf)] [abstract] [bibtex] [top]

2001

• Allegra Angus and Dexter Kozen. Kleene algebra with tests and program schematology. Technical Report TR2001-1844, Computer Science Department, Cornell University, July 2001.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen and Jerzy Tiuryn. On the completeness of propositional Hoare logic. Information Sciences, 139(3-4):187-195, 2001.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Myhill-Nerode relations on automatic systems and the completeness of Kleene algebra. In Afonso Ferreira and Horst Reichel, editors, Proc. 18th Symp. Theoretical Aspects of Computer Science (STACS'01), volume 2010 of Lecture Notes in Computer Science, pages 27-38, Dresden, Germany, February 2001. Springer-Verlag.
  [full text (.pdf)] [abstract] [bibtex] [top]

2000

• Ernie Cohen and Dexter Kozen. A note on the complexity of propositional Hoare logic. Trans. Computational Logic, 1(1):171-174, July 2000.
  [full text (.pdf)] [abstract] [bibtex] [top]

• David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. MIT Press, Cambridge, MA, 2000.
  [table of contents (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen and Maria-Cristina Patron. Certification of compiler optimizations using Kleene algebra with tests. In John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Proc. 1st Int. Conf. Computational Logic (CL2000), volume 1861 of Lecture Notes in Artificial Intelligence, pages 568-582, London, July 2000. Springer-Verlag.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. On Hoare logic and Kleene algebra with tests. Trans. Computational Logic, 1(1):60-76, July 2000.
  [full text (.pdf)] [abstract] [bibtex] [top]

1999

• Dexter Kozen. Language-based security. In M. Kutyowski, L. Pacholski, and T. Wierzbicki, editors, Proc. Conf. Mathematical Foundations of Computer Science (MFCS'99), volume 1672 of Lecture Notes in Computer Science, pages 284-298. Springer-Verlag, September 1999.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Mark Hopkins and Dexter Kozen. Parikh's theorem in commutative Kleene algebra. In Proc. 14th Conf. Logic in Computer Science (LICS'99), pages 394-401. IEEE, July 1999.
  [full text (.ps)] [abstract] [bibtex] [top]

1998

• Kenneth Andrews, Chris Heegard, and Dexter Kozen. Interleaver design methods for turbo codes. In Proc. International Symposium on Information Theory (ISIT'98), page 420. IEEE, August 1998.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen. Set constraints and logic programming. Information and Computation, 142(1):2-25, April 1998.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen, Yaron Minsky, and Brian Smith. Efficient algorithms for optimal video transmission. In James A. Storer and Martin Cohn, editors, Proc. Data Compression Conference (DCC'98), pages 229-238, Snowbird, Utah, March 1998. IEEE.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. Typed Kleene algebra. Technical Report TR98-1669, Computer Science Department, Cornell University, March 1998.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. Efficient code certification. Technical Report TR98-1661, Computer Science Department, Cornell University, January 1998.
  [full text (.pdf)] [abstract] [bibtex] [top]

1997

• Kenneth Andrews, Chris Heegard, and Dexter Kozen. A theory of interleavers. Technical Report TR97-1634, Computer Science Department, Cornell University, June 1997.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. Kleene algebra with tests. Transactions on Programming Languages and Systems, 19(3):427-443, May 1997.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. Automata and Computability. Springer-Verlag, New York, 1997.
  [table of contents (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen and Kjartan Stefansson. Computing the Newtonian graph. Journal of Symbolic Computation, 24:125-136, 1997.
  [full text (.ps)] [abstract] [bibtex] [top]

1996

• Ernie Cohen, Dexter Kozen, and Frederick Smith. The complexity of Kleene algebra with tests. Technical Report TR96-1598, Computer Science Department, Cornell University, July 1996.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen and Frederick Smith. Kleene algebra with tests: Completeness and decidability. In D. van Dalen and M. Bezem, editors, Proc. 10th Int. Workshop Computer Science Logic (CSL'96), volume 1258 of Lecture Notes in Computer Science, pages 244-259, Utrecht, The Netherlands, September 1996. Springer-Verlag.
  [full text (.ps)] [abstract] [bibtex] [top]

• Allan Cheng and Dexter Kozen. Some notes on rational spaces. Technical Report TR96-1576, Computer Science Department, Cornell University, March 1996.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. Rational spaces and set constraints. Theoretical Computer Science, 167:73-94, 1996.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. On regularity-preserving functions. Bull. Europ. Assoc. Theor. Comput. Sci., 58:131-138, February 1996.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen, Susan Landau, and Richard Zippel. Decomposition of algebraic functions. Journal of Symbolic Computation, 22(3):235-246, September 1996.
  [full text (.ps)] [abstract] [bibtex] [top]

• Allan Cheng and Dexter Kozen. A complete Gentzen-style axiomatization for set constraints. In F. Meyer auf der Heide and B. Monien, editors, Proc. 23rd Int. Colloq. Automata, Languages, and Programming (ICALP'96), volume 1099 of Lecture Notes in Computer Science, pages 134-145, Paderborn, Germany, July 1996. Eur. Assoc. for Theoretical Comput. Sci., Springer-Verlag.
  [full text (.ps)] [abstract] [bibtex] [top]

1995

• Nils Klarlund and Dexter Kozen. Rabin measures. Chicago Journal of Theoretical Computer Science, 1995(3), September 1995.
  [full text (.pdf)] [abstract] [bibtex] [top]

• Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient recursive subtyping. Mathematical Structures in Computer Science, 5:113-125, 1995.
  [full text (.ps)] [abstract] [bibtex] [top]

• Alexander Aiken, Dexter Kozen, and Edward Wimmers. Decidability of systems of set constraints with negative constraints. Infor. and Comput., 122(1):30-44, October 1995.
  [full text (.ps)] [abstract] [bibtex] [top]

1994

• Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient inference of partial types. J. Comput. Syst. Sci., 49(2):306-324, October 1994.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. Efficient resolution of singularities of plane curves. In P. S. Thiagarajan, editor, Proc. 14th Conf. Foundations of Software Technology and Theoretical Computer Science, volume 880 of Lecture Notes in Computer Science, pages 1-11, Madras, India, December 1994. Springer-Verlag.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput., 110(2):366-390, May 1994.
  [full text (.ps)] [abstract] [bibtex] [top]

• Jin-Yi Cai, W. H. J. Fuchs, Dexter Kozen, and Zicheng Liu. Efficient average-case algorithms for the modular group. In Proc. 35th Symp. Found. Comput. Sci., pages 143-152. IEEE, November 1994.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen and Shmuel Zaks. Optimal bounds for the change-making problem. Theor. Comput. Sci., 123:377-388, 1994.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. On action algebras. In J. van Eijck and A. Visser, editors, Logic and Information Flow, pages 78-88. MIT Press, 1994.
  [full text (.ps)] [abstract] [bibtex] [top]

1993

• Dexter Kozen. Logical aspects of set constraints. In E. Börger, Y. Gurevich, and K. Meinke, editors, Proc. 1993 Conf. Computer Science Logic (CSL'93), volume 832 of Lecture Notes in Computer Science, pages 175-188, Swansea, U. K., September 1993. Eur. Assoc. Comput. Sci. Logic, Springer-Verlag.
  [full text (.ps)] [abstract] [bibtex] [top]

• Doug Ierardi and Dexter Kozen. Parallel resultant computation. In J. Reif, editor, Synthesis of Parallel Algorithms, pages 679-720. Morgan Kaufmann, 1993.
  [full text (.ps)] [abstract] [bibtex] [top]

• Alexander Aiken, Dexter Kozen, Moshe Vardi, and Edward Wimmers. The complexity of set constraints. In E. Börger, Y. Gurevich, and K. Meinke, editors, Proc. 1993 Conf. Computer Science Logic (CSL'93), volume 832 of Lecture Notes in Computer Science, pages 1-17, Swansea, U. K., September 1993. Eur. Assoc. Comput. Sci. Logic, Springer-Verlag.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. Partial automata and finitely generated congruences: An extension of Nerode's theorem. In J. N. Crossley, J. B. Remmel, R. A. Shore, and M. E. Sweedler, editors, Logical Methods: In Honor of Anil Nerode's Sixtieth Birthday, pages 490-511. Birkhäuser, Ithaca, New York, 1993.
  [full text (.ps)] [abstract] [bibtex] [top]

1992

• Dexter Kozen. On the Myhill-Nerode theorem for trees. Bull. Europ. Assoc. Theor. Comput. Sci., 47:170-173, June 1992.
  [full text (.ps)] [abstract] [bibtex] [top]

1991

• Dexter Kozen. The Design and Analysis of Algorithms. Springer-Verlag, New York, 1991.
  [table of contents (.ps)] [abstract] [bibtex] [top]

1990

• Dexter Kozen. On Kleene algebras and closed semirings. In Rovan, editor, Proc. Math. Found. Comput. Sci., volume 452 of Lecture Notes in Computer Science, pages 26-47, Banska-Bystrica, Slovakia, 1990. Springer-Verlag.
  [full text (.ps)] [abstract] [bibtex] [top]

1989

• Neil Immerman and Dexter Kozen. Definability with bounded number of bound variables. Infor. and Comp., 83(2):121-139, November 1989.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen and Susan Landau. Polynomial decomposition algorithms. J. Symb. Comput., 7:445-456, 1989.
  [full text (.ps)] [abstract] [bibtex] [top]

1988

• Michael Ben-Or, Ephraim Feig, Dexter Kozen, and Prasoon Tiwari. Fast parallel algorithms for finding the roots of a polynomial with all real roots. SIAM J. Comput., 17(6):1081-1092, 1988.
  [full text] [abstract] [bibtex] [top]

• Dexter Kozen. A finite model theorem for the propositional μ-calculus. Studia Logica, 47(3):233-241, 1988.
  [full text (.pdf)] [abstract] [bibtex] [top]

1987

• Dexter Kozen. On teaching left-handed children to write. Technical Report TR87-844, Computer Science Department, Cornell University, June 1987.
  [full text] [abstract] [bibtex] [top]

1986

• Krzysztof Apt and Dexter Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 22:307-309, 1986.
  [full text (.pdf)] [abstract] [bibtex] [top]

1985

• Dexter Kozen, Umesh Vazirani, and Vijay Vazirani. NC algorithms for comparability graphs, interval graphs, and unique perfect matching. In Maheshwari, editor, Proc. 5th Conf. Found. Software Technology and Theor. Comput. Sci., volume 206 of Lecture Notes in Computer Science, pages 496-503, New Delhi, December 1985. Springer-Verlag.
  [full text (.ps)] [abstract] [bibtex] [top]

• Dexter Kozen. A probabilistic PDL. J. Comput. Syst. Sci., 30(2):162-178, April 1985.
  [full text (.pdf)] [abstract] [bibtex] [top]

1983

• Dexter Kozen. Results on the propositional μ-calculus. Theor. Comput. Sci., 27:333-354, 1983.
  [full text (.pdf)] [abstract] [bibtex] [top]

1981

• Dexter Kozen. Semantics of probabilistic programs. J. Comput. Syst. Sci., 22:328-350, 1981.
  [full text (.pdf)] [abstract] [bibtex] [top]