
Logic and Program Semantics
Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday
Springer (Publisher)
1st Edition
Published on 11. April 2012
Book
Paperback/Softback
XIII, 357 pages
978-3-642-29484-6 (ISBN)
Description
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). 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 procedure 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.
More details
Series
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
45 s/w Abbildungen
XIII, 357 p. 45 illus.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
562 gr
ISBN-13
978-3-642-29484-6 (9783642294846)
DOI
10.1007/978-3-642-29485-3
Schweitzer Classification
Other editions
Additional editions

Robert L. Constable | Alexandra Silva
Logic and Program Semantics
Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday
E-Book
04/2012
Springer
€53.49
Available for download
Content
Residuated Kleene Algebras.-Brzozowski?s Algorithm (Co)Algebraically.-Experimental Descriptive Complexity.-Meditations on Quantified Constraint Satisfaction.-The Compass That Steered Robotics.-Subtyping for F-Bounded Quantifiers and Equirecursive Types.-
Inferring Evolutionary Scenarios in the Duplication, Loss and
Horizontal Gene Transfer Model.-Capsules and Closures: A Small-Step Approach.-Nuprl as Logical Framework for Automating Proofs in Category
Theory.-On the Final Coalgebra of Automatic Sequences.-On Topological Completeness of Regular Tree Languages.-A Complete Logical System for the Equality of Recursive Terms for
Sets.-Overloading is NP-Complete: A Tutorial Dedicated to Dexter Kozen.-Combining Epistemic Logic and Hennessy-Milner Logic.-Choice and Uncertainty in Games.-The Complexity of Inhabitation with Explicit Intersection.-On State Sequences Defined by Reaction Systems.-On Distance Coloring: A Review Based on Work with Dexter Kozen.-Winning, Losing and Drawing in Concurrent Games with Perfect or
Imperfect Information.-Reflections on a \m/ Time with Dexter Kozen.-Two Three Pages Papers.-A Tribute from the Band .-Dexter Kozen: An Appreciation.-Dexter Kozen: A Winning Combination of Brilliance, Depth, and
Elegance.-Making the World a Better Place.-Timesharing Dexter.-A Small Tribute.-Dexter Kozen?s Influence on the Theory of Labelled Markov
Processes.-An Appreciation of Dexter Kozen.-To Dexter - A Tribute from Aarhus.-Travelling with Dexter Kozen.-Dexter as a PhD Advisor.-Rock?n?Roll Computer Science.