Principles of Verification: Cycling the Probabilistic Landscape Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, Part I /

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: SpringerLink (Online service)
Weitere Verfasser: Jansen, Nils (HerausgeberIn), Junges, Sebastian (HerausgeberIn), Kaminski, Benjamin Lucien (HerausgeberIn), Matheja, Christoph (HerausgeberIn), Noll, Thomas (HerausgeberIn), Quatmann, Tim (HerausgeberIn), Stoelinga, Mariëlle (HerausgeberIn), Volk, Matthias (HerausgeberIn)
Format: Elektronisch E-Book
Sprache:Englisch
Veröffentlicht: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Ausgabe:1st ed. 2025.
Schriftenreihe:Lecture Notes in Computer Science, 15260
Schlagworte:
Online-Zugang:https://doi.org/10.1007/978-3-031-75783-9
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Inhaltsangabe:
  • 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.