default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEssays Dedicated Joost-Pieter Katoen 2024 - Part I
- Nils Jansen
, Sebastian Junges, Benjamin Lucien Kaminski, Christoph Matheja, Thomas Noll, Tim Quatmann, Mariëlle Stoelinga, Matthias Volk:
Principles of Verification: Cycling the Probabilistic Landscape - Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, Part I. Lecture Notes in Computer Science 15260, Springer 2024, ISBN 978-3-031-75782-2
Programming Languages
- Radu Grigore, Dino Distefano, Nikos Tzevelekos:
Automatic Compositional Checking of Multi-object TypeState Properties of Software. 3-40 - Rupak Majumdar, V. R. Sathiyanarayana:
Sound and Complete Techniques for Reasoning About Termination. 41-72 - Berry Schoenmakers:
Amortized Analysis of Leftist Heaps. 73-84 - Michal Ajdarów, Antonín Kucera, Petr Novotný:
Asymptotic Analysis of Probabilistic Programs: When Expectations Do Not Meet Our Expectations. 85-97 - Chris Chen, Annabelle McIver, Carroll Morgan:
Source-Level Reasoning for Quantifying Information Leaks. 98-127 - Philipp Schröer, Francesca Randone, Raúl Pardo, Andrzej Wasowski:
Symbolic Quantitative Information Flow for Probabilistic Programs. 128-154 - Federico Olmedo:
Static Slicing for Probabilistic Programs: An Overview. 155-178 - Marcel Moosbrugger, Julian Müllner, Ezio Bartocci, Laura Kovács:
Polar: An Algebraic Analyzer for (Probabilistic) Loops. 179-200 - Thomas Noll, Christina Gehnen, Roy Hermanns:
Quantum Computing: From Weakest Preconditions to Voltage Pulses. 201-229 - Shenghua Feng, Tengshun Yang, Mingshuai Chen, Naijun Zhan:
A Unified Framework for Quantitative Analysis of Probabilistic Programs. 230-254 - Kevin Batz, Benjamin Lucien Kaminski, Christoph Matheja, Tobias Winkler:
J-P: MDP. FP. PP - Characterizing Total Expected Rewards in Markov Decision Processes as Least Fixed Points with an Application to Operational Semantics of Probabilistic Programs. 255-302 - Radu Grosu:
Neural Programs: Linking Probabilistic and Differential Programming. 303-321 - Einar Broch Johnsen, Eduard Kamburjan, Raúl Pardo, Erik Voogd, Andrzej Wasowski:
Towards a Proof System for Probabilistic Dynamic Logic. 322-338 - Jan-Christoph Kassing, Jürgen Giesl:
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting. 339-366
Theory
- Martin Grohe:
Some Thoughts on Graph Similarity. 369-392 - Arend Rensink, Andrea Corradini:
On Categories of Nested Conditions. 393-418 - Alberto Bombardelli, Alessandro Cimatti, Alberto Griggio, Stefano Tonetta:
Another Look at LTL Modulo Theory over Finite and Infinite Traces. 419-443
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-27 20:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
