WorldCat Identities

Kozen, Dexter 1951-

Overview
Works: 79 works in 213 publications in 2 languages and 3,907 library holdings
Genres: Conference proceedings 
Roles: Editor
Classifications: QA76.9.L63, 005.1
Publication Timeline
Key
Publications about  Dexter Kozen Publications about Dexter Kozen
Publications by  Dexter Kozen Publications by Dexter Kozen
Most widely held works by Dexter Kozen
Dynamic logic by David Harel ( )
10 editions published in 2000 in English and held by 971 WorldCat member libraries worldwide
Theory of computation by Dexter Kozen ( )
19 editions published between 2006 and 2010 in English and held by 656 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
The design and analysis of algorithms by Dexter Kozen ( Book )
12 editions published between 1991 and 2012 in English and held by 527 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 graduate-level textbook
Automata and computability by Dexter Kozen ( Book )
14 editions published between 1997 and 2007 in English and held by 351 WorldCat member libraries worldwide
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science
Logics of Programs Workshop, Yorktown Heights, New York, May 1981 by Dexter Kozen ( Book )
11 editions published in 1982 in English and held by 341 WorldCat member libraries worldwide
Mathematics of program construction : 7th international conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004 : proceedings by Dexter Kozen ( Book )
10 editions published in 2004 in English and held by 330 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
Logics of Programs, workshop, Carnegie Mellon University, Pittsburgh, PA, June 6-8, 1983 by Edmund Clarke ( Book )
9 editions published in 1984 in English and German and held by 289 WorldCat member libraries worldwide
Tenth Annual IEEE Symposium on Logic in Computer Science : proceedings, June 26-29, 1995, San Diego, California by Symposium on Logic in Computer Science ( Book )
6 editions published between 1995 and 2002 in English and held by 176 WorldCat member libraries worldwide
Models of computation an introduction to computability theory by Maribel Fernández ( )
2 editions published in 2009 in English and held by 46 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
Mathematics of program construction : 7th international conference ; proceedings ( Book )
1 edition published in 2004 in English and held by 20 WorldCat member libraries worldwide
Separability in domain semirings ( )
1 edition published in 2004 in English and held by 16 WorldCat member libraries worldwide
Logics of programs : workshop, Yorktown Heights, N.Y., May 1981 ( Book )
1 edition published in 1982 in English and held by 12 WorldCat member libraries worldwide
Selected papers from the Second Annual IEEE Symposium on Logic in Computer Science (LICS) : Ithaca, NY, June 22-25, 1987 by Symposium on Logic in Computer Science ( Book )
4 editions published in 1991 in English and held by 9 WorldCat member libraries worldwide
A concise introduction to software engineering by Pankaj Jalote ( Book )
1 edition published in 2008 in English and held by 8 WorldCat member libraries worldwide
"Software engineering is an integral part of studies in computer science and consequently foundational knowledge is critical to all students in the field. This text focuses on the essential elements, providing readers with the basic skills and introductory knowledge required to execute a software project successfully." "This text is written specifically for undergraduates as an introduction to this broad-ranging discipline. With a strong emphasis on practice, this textbook takes a step-by-step approach whereby the key tasks involved in a project are discussed through the course of the book, illustrating the different activities involved in software development." "Designed for undergraduates and bolstered with numerous examples, this text imparts to the reader the fundamental knowledge, skills, practices and techniques within software engineering. It will also be helpful for professionals who know programming but want to be introduced to the formal systematic approach of software engineering."--Jacket
Decidability of systems of set constraints with negative constraints 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 number-theoretic decision problem that may be of independent interest."
Proceedings by Symposium on Logic in Computer Science ( Book )
1 edition published in 1995 in English and held by 7 WorldCat member libraries worldwide
Logics of programs by Dexter Kozen ( Book )
4 editions published between 1987 and 1989 in English and Undetermined and held by 6 WorldCat member libraries worldwide
None Available
Complexity of finitely presented algebras by Dexter Kozen ( Book )
6 editions published in 1977 in English and Undetermined and held by 6 WorldCat member libraries worldwide
Special issue : [papers from the Tenth Annual IEEE Symposium on Logic in Computer Science (LICS), held June 26-29, 1995, in San Diego, California] by Symposium on Logic in Computer Science ( Book )
1 edition published in 2000 in English and held by 5 WorldCat member libraries worldwide
Logical aspects of set constraints by Dexter Kozen ( Book )
2 editions published in 1994 in English and held by 4 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."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.68 (from 0.33 for Separabili ... to 0.86 for Tenth Annu ...)
Alternative Names
Kozen, D. 1951-
Kozen, D. C.
Kozen, Dexter.
Kozen, Dexter, 1951-
Kozen, Dexter C. 1951-
Kozen, Dexter Campbell
Kozen, Dexter Campbell 1951-
Languages
English (117)
German (1)
Covers