My Account Log in

1 option

Principles of Verification: Cycling the Probabilistic Landscape : Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, Part I / edited by Nils Jansen, Sebastian Junges, Benjamin Lucien Kaminski, Christoph Matheja, Thomas Noll, Tim Quatmann, Mariëlle Stoelinga, Matthias Volk.

Springer Nature - Springer Computer Science (R0) eBooks 2025 English International Available online

View online
Format:
Book
Author/Creator:
Jansen, Nils.
Contributor:
Junges, Sebastian.
Kaminski, Benjamin Lucien.
Matheja, Christoph.
Noll, Thomas.
Quatmann, Tim.
Stoelinga, Mariëlle.
Volk, Matthias.
Series:
Lecture Notes in Computer Science, 1611-3349 ; 15260
Language:
English
Subjects (All):
Computer science.
Software engineering.
Computer Science Logic and Foundations of Programming.
Theory of Computation.
Software Engineering.
Local Subjects:
Computer Science Logic and Foundations of Programming.
Theory of Computation.
Software Engineering.
Physical Description:
1 online resource (462 pages)
Edition:
1st ed. 2025.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Summary:
This Festschrift is dedicated to Joost-Pieter Katoen in recognition of his outstanding research, teaching, and organizational successes. Joost-Pieter received his Master's and later his Ph.D. from the University of Twente, and his Professional Doctorate in Engineering from Eindhoven University of Technology. He had research positions at the University of Erlangen-Nuremberg and Philips Research, and visiting professorships in France, Australia, and the UK. Since 2004 he has been a professor at RWTH Aachen University and is part-time associated with the University of Twente. Joost-Pieter’s main areas of research are formal methods, computer-aided verification, concurrency theory, probabilistic computation, and semantics. Among many recognitions for this work, he is an ACM Fellow; he was elected as a member of the Academia Europaea, the Royal Holland Society of Science and Humanities, and the North Rhine-Westphalian Academy of Science, Humanities and the Arts; he received an honorary doctorate from Aalborg University. He was awarded an ERC Advanced Grant; he has won best paper, distinguished paper, or test-of-time awards at key conferences such as ETAPS, IEEE SRDS, POPL, CONCUR, and LOPSTR; and he has given keynotes at dozens of major events. He has chaired the Steering Committee of the European Joint Conferences on Theory and Practice of Software (ETAPS) and the TACAS conference; he has been Program Chair, General Chair, or Program Committee member of hundreds of major conferences and workshops, and a board member of key journals; he has served on research boards (such as the EPSRC), doctoral committees, school and university committees, and IFIP working groups; and he coauthored Principles of Model Checking, a highly influential textbook. Throughout his career Joost-Pieter has been a remarkably successful teacher and mentor, supervising students and hosting postdoctoral researchers, many of whom have won awards for their research and advanced to senior positions, and he has collaborated in research and publications with a wide range of scientists. These successes are reflected in the papers contributed to this volume.
Contents:
Programming Languages
Automatic Compositional Checking of Multi-Object TypeState Properties of Software
Sound and Complete Techniques for Reasoning about Termination
Amortized Analysis of Leftist Heaps. Asymptotic Analysis of Probabilistic Programs: When Expectations Do Not Meet Our Expectations
Source-level reasoning for quantifying information leaks
Symbolic Methods for Quantitative Information Flow in Probabilistic Programs
Static Slicing for Probabilistic Programs: An Overview
Polar: An Algebraic Analyzer for (Probabilistic) Loops
Quantum Computing: From Weakest Preconditions to Voltage Pulses
A Unified Framework for Quantitative Analysis of Probabilistic Programs
Neural Programs: Linking Probabilistic and Differential Programming
Towards a Proof System for Probabilistic Dynamic Logic
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
Some Thoughts on Graph Similarity
On Categories of Nested Conditions
Another Look at LTL Modulo Theory over Finite and Infinite Traces.
Notes:
Description based on publisher supplied metadata and other sources.
ISBN:
9783031757839
3031757831
OCLC:
1470856411

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account