April 26 & 27, 2012

Cornell University

Ithaca, New York

Dexter C.Kozen Symposium

Contact Registration Travel Schedule of Events


This two-day workshop is in honor of the 60th birthday of Dexter Kozen, an American theoretical computer scientist. He is currently Joseph Newton Pew, Jr. Professor in Engineering at Cornell University. Dexter received his B.A. from Dartmouth College in 1974 and his PhD in Computer Science from Cornell University in 1977, where he was advised by Juris Hartmanis. He is a fellow of the Association of Computing Machinery, a Guggenheim Fellow, and has received a Outstanding Innovation Award from IBM Corporation. He has also been named Faculty of the Year by the Association of Computer Science Undergraduates at Cornell.

Dexter is known for his seminal work at the intersection of logic and complexity. He is one of the fathers of dynamic logic and developed the version of the mu calculus most used today. Moreover, he has written several textbooks on the theory of computation, automata theory, dynamic logic, and algorithms.

Dexter is also a guitarist, singer, and songwriter currently in the band "The Juliatrics". He also holds the position of faculty advisor for Cornell's Rugby Football Club and plays for the Cortland Homer Thundering Herd Rugby Team.

The papers presented during the symposium will appear in a special Springer LNCS festschrift volume, which also includes several laudatios from friends and collaborators.


Conference Organizer:

Robert Constable and Alexandra Silva
Cornell University

Conference Contact:
Michelle Eighmey

Cornell University
(607) 254-6559



Day 1 -ILR Conference Center (Room 225) - CU Campus, Garden Avenue

2:00 – 2:30pm Opening Remarks
2:30-3:00pm Dexter Kozen’s Influence on the Theory of Markov Processes
Prakash Panangaden
3:00 – 3:30pm The Compass sthat Steered Robotics
Bruce Donald
3:30 – 4:00 Refreshments
4:00 – 4:30pm Brzozowski’s Algorithm (Co)algebraically
Filippo Bonchi, Marcello Bonsangue, Jan Rutten and Alexandra Silva
4:30 – 5: 00pm Capsules and Closures: a Small-Step Approach
Jean-Baptiste Jeannin
5:00 – 5:30pm On the Final Coalgebra of Automatic  Sequences
Clemens Kupke and Jan Rutten
6:30-9:00pm Reception/Dinner @ The Statler Hotel in the Ballroom

Day 2 - The Statler - Amphitheater

9:00-9:30am Folklore Results in the Theory of Multicore Systems
Wolfgang Paul
9:30 – 10:00am The Complexity of Inhabitation with Explicit Intersection
Jakob Rehof and Pawel Urzyczyn
10:00 – 10:30am Nuprl as Logical Framework for Automating Proofs in Category
Christoph Kreitz
10:30 – 11:00am Coffee Break
11:00 – 11: 30 Subtyping for F-Bounded Quantifiers and Equirecursive Types
Neal Glew
11:30 – 12:00 A Complete Logical System for the Equality of Recursive Terms for Sets
Larry Moss, Erik Wennstrom and Glen Whitney
12:00 – 2:00pm Lunch (on your own)
2:00 – 2:30pm Overloading is NP-Complete
Jens Palsberg
2:30 –3:00pm Choice and Uncertainty in Games
Rohit Parikh
3:00 –3:30 Experimental Descriptive Complexity
Marco Carmosino, Neil Immerman and Charles Jordan
 3:30-4:00 Closing - Coffee Break



Supported by: