Constable / Silva | Logic and Program Semantics | Buch | 978-3-642-29484-6 | sack.de

Buch, Englisch, Band 7230, 357 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 562 g

Reihe: Lecture Notes in Computer Science

Constable / Silva

Logic and Program Semantics

Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday
1. Auflage 2012
ISBN: 978-3-642-29484-6
Verlag: Springer

Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday

Buch, Englisch, Band 7230, 357 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 562 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-642-29484-6
Verlag: Springer


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.

Constable / Silva Logic and Program Semantics jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.