Kozen, Dexter 1951
Overview
Works:  108 works in 354 publications in 3 languages and 4,932 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Honoree, Thesis advisor, 958 
Classifications:  QA76.6, 005.1 
Publication Timeline
.
Most widely held works by
Dexter Kozen
The design and analysis of algorithms by
Dexter Kozen(
Book
)
16 editions published between 1991 and 2012 in English and held by 528 WorldCat member libraries worldwide
The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth's works on algorithms on his or her shelf. Dexter Kozen, a researcher and professor at Cornell University, has written a text for graduate study of algorithms. This will be an important reference book as well as being a useful graduatelevel textbook
16 editions published between 1991 and 2012 in English and held by 528 WorldCat member libraries worldwide
The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth's works on algorithms on his or her shelf. Dexter Kozen, a researcher and professor at Cornell University, has written a text for graduate study of algorithms. This will be an important reference book as well as being a useful graduatelevel textbook
Automata and computability by
Dexter Kozen(
Book
)
22 editions published between 1977 and 2012 in English and Italian and held by 369 WorldCat member libraries worldwide
These are my lecture notes from CS381/481: Automata and Computability Theory, a onesemester seniorlevel course I have taught at Cornell Uni versity for many years. I took this course myself in thc fall of 1974 as a firstyear Ph. D. student at Cornell from Juris Hartmanis and have been in love with the subject ever sin, :e. The course is required for computer science majors at Cornell. It exists in two forms: CS481, an honors version; and CS381, a somewhat gentler paced version. The syllabus is roughly the same, but CS481 go es deeper into thc subject, covers more material, and is taught at a more abstract level. Students are encouraged to start off in one or the other, then switch within the first few weeks if they find the other version more suitaLle to their level of mathematical skill. The purpose of t.hc course is twofold: to introduce computer science students to the rieh heritage of models and abstractions that have arisen over the years; and to dew!c'p the capacity to form abstractions of their own and reason in terms of them
22 editions published between 1977 and 2012 in English and Italian and held by 369 WorldCat member libraries worldwide
These are my lecture notes from CS381/481: Automata and Computability Theory, a onesemester seniorlevel course I have taught at Cornell Uni versity for many years. I took this course myself in thc fall of 1974 as a firstyear Ph. D. student at Cornell from Juris Hartmanis and have been in love with the subject ever sin, :e. The course is required for computer science majors at Cornell. It exists in two forms: CS481, an honors version; and CS381, a somewhat gentler paced version. The syllabus is roughly the same, but CS481 go es deeper into thc subject, covers more material, and is taught at a more abstract level. Students are encouraged to start off in one or the other, then switch within the first few weeks if they find the other version more suitaLle to their level of mathematical skill. The purpose of t.hc course is twofold: to introduce computer science students to the rieh heritage of models and abstractions that have arisen over the years; and to dew!c'p the capacity to form abstractions of their own and reason in terms of them
Theory of computation by
Dexter Kozen(
Book
)
27 editions published between 2006 and 2010 in English and held by 345 WorldCat member libraries worldwide
Dexter Kozen covers core material in the foundations of computing, as well as providing an introduction to some more advanced contemporary topics. He focuses primarily on computational complexity theory  the classification of computational problems in terms of their inherent complexity
27 editions published between 2006 and 2010 in English and held by 345 WorldCat member libraries worldwide
Dexter Kozen covers core material in the foundations of computing, as well as providing an introduction to some more advanced contemporary topics. He focuses primarily on computational complexity theory  the classification of computational problems in terms of their inherent complexity
Dynamic logic by
David Harel(
Book
)
15 editions published between 2000 and 2015 in English and held by 326 WorldCat member libraries worldwide
15 editions published between 2000 and 2015 in English and held by 326 WorldCat member libraries worldwide
Logics of Programs Workshop, Yorktown Heights, New York, May 1981 by
Dexter Kozen(
Book
)
19 editions published in 1982 in 3 languages and held by 305 WorldCat member libraries worldwide
19 editions published in 1982 in 3 languages and held by 305 WorldCat member libraries worldwide
Logics of Programs, workshop, Carnegie Mellon University, Pittsburgh, PA, June 68, 1983 by
Edmund Clarke(
Book
)
28 editions published between 1982 and 2007 in 3 languages and held by 298 WorldCat member libraries worldwide
None Available
28 editions published between 1982 and 2007 in 3 languages and held by 298 WorldCat member libraries worldwide
None Available
Mathematics of program construction : 7th international conference, MPC 2004, Stirling, Scotland, UK, July 1214, 2004 : proceedings by
Dexter Kozen(
Book
)
17 editions published in 2004 in English and held by 199 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 7th International Conference on the Mathematics of Program Construction, MPC 2004, held in Stirling, Scotland, UK in July 2004. The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. Among the topics addressed are programming theory, programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics
17 editions published in 2004 in English and held by 199 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 7th International Conference on the Mathematics of Program Construction, MPC 2004, held in Stirling, Scotland, UK in July 2004. The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. Among the topics addressed are programming theory, programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics
Tenth Annual IEEE Symposium on Logic in Computer Science : proceedings, June 2629, 1995, San Diego, California by Symposium on Logic in Computer Science(
Book
)
9 editions published between 1995 and 2002 in English and held by 97 WorldCat member libraries worldwide
9 editions published between 1995 and 2002 in English and held by 97 WorldCat member libraries worldwide
Logics of programs workshop, Yorktown Heights, N. Y., May 1981(
)
1 edition published in 1982 in English and held by 18 WorldCat member libraries worldwide
1 edition published in 1982 in English and held by 18 WorldCat member libraries worldwide
Separability in domain semirings(
)
1 edition published in 2004 in English and held by 16 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 16 WorldCat member libraries worldwide
Logic and program semantics : essays dedicated to Dexter Kozen on the occasion of his 60th birthday by
Robert L Constable(
)
1 edition published in 2012 in English and held by 14 WorldCat member libraries worldwide
This Festschrift volume is published in honor of Dexter Kozen on the occasion of his 60th birthday. Dexter Kozen has been a leader in the development of Kleene Algebras (KAs) and the contributions in this volume reflect the breadth of his work and influence. The volume includes 19 full papers related to Dexter Kozen's research. They deal with coalgebraic methods; congruence closure; the completeness of various programming logics; decision procedures for logics; alternation; algorithms and complexity; and programming languages and program analysis. The second part of this volume includes laudatios from several collaborators, students and friends, including the members of his current band
1 edition published in 2012 in English and held by 14 WorldCat member libraries worldwide
This Festschrift volume is published in honor of Dexter Kozen on the occasion of his 60th birthday. Dexter Kozen has been a leader in the development of Kleene Algebras (KAs) and the contributions in this volume reflect the breadth of his work and influence. The volume includes 19 full papers related to Dexter Kozen's research. They deal with coalgebraic methods; congruence closure; the completeness of various programming logics; decision procedures for logics; alternation; algorithms and complexity; and programming languages and program analysis. The second part of this volume includes laudatios from several collaborators, students and friends, including the members of his current band
Models of computation : an introduction to computability theory by
Maribel Fernández(
)
2 editions published in 2009 in English and held by 9 WorldCat member libraries worldwide
'Models of Computation' provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing machines and recursive functions, to the modern computation models inspired by quantum physics
2 editions published in 2009 in English and held by 9 WorldCat member libraries worldwide
'Models of Computation' provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing machines and recursive functions, to the modern computation models inspired by quantum physics
Selected papers from the Second Annual IEEE Symposium on Logic in Computer Science (LICS) : Ithaca, NY, June 2225, 1987 by
1987, Ithaca, NY) Symposium on Logic in Computer Science (2(
Book
)
4 editions published in 1991 in English and held by 9 WorldCat member libraries worldwide
4 editions published in 1991 in English and held by 9 WorldCat member libraries worldwide
Proceedings by
Symposium on Logic in Computer Science(
Book
)
2 editions published in 1995 in English and held by 8 WorldCat member libraries worldwide
2 editions published in 1995 in English and held by 8 WorldCat member libraries worldwide
Complexity of finitely presented algebras by
Dexter Kozen(
Book
)
8 editions published between 1976 and 1977 in English and held by 8 WorldCat member libraries worldwide
The uniform word problem, the finiteness problem, the triviality problem (whether $\cal A$ is the one element algebra), and the subalgebra membership problem (whether a given element of $\cal A$ is contained in a finitely generated subalgebra of $\cal A$) for finitely presented algebras are shown to be $\leq[superscript]{m}_{\log}$complete for P. The schema satisfiability problem and schema validity problem are shown to be $\leq[superscript]{m}_{\log}$complete for NP and coNP, respectively, Finally, the problem of isomorphism of finitely presented algebras is shown to be polynomial time manyone equivalent to the problem of graph isomorphism
8 editions published between 1976 and 1977 in English and held by 8 WorldCat member libraries worldwide
The uniform word problem, the finiteness problem, the triviality problem (whether $\cal A$ is the one element algebra), and the subalgebra membership problem (whether a given element of $\cal A$ is contained in a finitely generated subalgebra of $\cal A$) for finitely presented algebras are shown to be $\leq[superscript]{m}_{\log}$complete for P. The schema satisfiability problem and schema validity problem are shown to be $\leq[superscript]{m}_{\log}$complete for NP and coNP, respectively, Finally, the problem of isomorphism of finitely presented algebras is shown to be polynomial time manyone equivalent to the problem of graph isomorphism
Decidability of systems of set constraints with negative constraits by Alexander Aiken(
Book
)
6 editions published between 1993 and 1994 in English and held by 7 WorldCat member libraries worldwide
Abstract: "Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. Recently, several algorithms for solving general systems of positive set constraints have appeared. In this paper we consider systems of mixed positive and negative constraints, which are considerably more expressive than positive constraints alone. We show that it is decidable whether a given such system has a solution. The proof involves a reduction to a numbertheoretic decision problem that may be of independent interest."
6 editions published between 1993 and 1994 in English and held by 7 WorldCat member libraries worldwide
Abstract: "Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. Recently, several algorithms for solving general systems of positive set constraints have appeared. In this paper we consider systems of mixed positive and negative constraints, which are considerably more expressive than positive constraints alone. We show that it is decidable whether a given such system has a solution. The proof involves a reduction to a numbertheoretic decision problem that may be of independent interest."
Dedicated to selected papers from the Conferene of Program Construction 2004 (MPC 2004) : [... Seventh International Conference
on the Mathematics of Program Construction. The conference took place in Stirling, Scotland in July 2004] by
2004, Stirling> MPC. <7(
Book
)
2 editions published in 2007 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 2007 in English and held by 7 WorldCat member libraries worldwide
LICS 1995 by
1995, San Diego, Calif.> Symposium on Logic in Computer Science. <10(
Book
)
3 editions published in 2000 in English and held by 6 WorldCat member libraries worldwide
3 editions published in 2000 in English and held by 6 WorldCat member libraries worldwide
Logical aspects of set constraints by
Dexter Kozen(
Book
)
3 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Set constraints are inclusion relations between sets of ground terms over a ranked alphabet. They have been used extensively in program analysis and type inference. Here we present an equational axiomatization of the algebra of set constraints. Models of these axioms are called termset algebras. They are related to the Boolean algebras with operators of Jónsson and Tarski. We also define a family of combinatorial models called topological term automata, which are essentially the term automata studied by Kozen, Palsberg, and Schwartzbach endowed with a topology such that all relevant operations are continuous. These models are similar to Kripke frames for modal or dynamic logic. We establish a Stone duality between termset algebras and topological term automata, and use this to derive a completeness theorem for a related multidimensional modal logic. Finally, we prove a small model property by filtration, and argue that this result contains the essence of several algorithms appearing in the literature on set constraints."
3 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Set constraints are inclusion relations between sets of ground terms over a ranked alphabet. They have been used extensively in program analysis and type inference. Here we present an equational axiomatization of the algebra of set constraints. Models of these axioms are called termset algebras. They are related to the Boolean algebras with operators of Jónsson and Tarski. We also define a family of combinatorial models called topological term automata, which are essentially the term automata studied by Kozen, Palsberg, and Schwartzbach endowed with a topology such that all relevant operations are continuous. These models are similar to Kripke frames for modal or dynamic logic. We establish a Stone duality between termset algebras and topological term automata, and use this to derive a completeness theorem for a related multidimensional modal logic. Finally, we prove a small model property by filtration, and argue that this result contains the essence of several algorithms appearing in the literature on set constraints."
Logics of programs : workshop; New York, (46) May 1981 : (proceedings)(
Book
)
2 editions published in 1982 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1982 in English and held by 4 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Tiuryn, Jerzy Author
 Harel, David 1950 Author
 Clarke, Edmund Author Editor
 IEEE Computer Society Technical Committee on Mathematical Foundations of Computing
 ACM Special Interest Group for Automata and Computability Theory
 MPC (7, 2004, Stirling)
 Institute of Electrical and Electronics Engineers
 Möller, Bernhard
 Logics of Programs Workshop (1981, Yorktown Heights, NY)
 Constable, Robert Lee
Useful Links
Associated Subjects
Abstract data types (Computer science) Computable functions Computational complexity Computer algorithms Computer logic Computer programming Computer programs Computer programsCorrectness Computer programsVerification Computer science Computer scienceMathematics Computer software Dynamic programming Formal methods (Computer science) Group algebras Information theory Logic, Symbolic and mathematical Logic design Logic programming Machine theory Programming languages (Electronic computers) Recursion theory Software engineering Turing machines
Alternative Names
Dexter Kozen American computer scientist
Dexter Kozen Amerikaans informaticus
Dexter Kozen informaticien américain
Dexter Kozen USamerikanischer Informatiker
Kozen, D. 1951
Kozen, D. C.
Kozen, Dexter.
Kozen, Dexter 1951
Kozen, Dexter C.
Kozen, Dexter C. 1951
Kozen, Dexter Campbell
Kozen, Dexter Campbell 1951
Kozen, Dexter Campell 1951
덱스터 코젠
Languages
Covers