default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrinciples of Formal Quantitative Analysis - Essays Dedicated to Christel Baier on the Occasion of Her 60th Birthday, 2025
- Nathalie Bertrand
, Clemens Dubslaff, Sascha Klüppelholz:
Principles of Formal Quantitative Analysis - Essays Dedicated to Christel Baier on the Occasion of Her 60th Birthday. Lecture Notes in Computer Science 15760, Springer 2025, ISBN 978-3-031-97438-0 - Joost-Pieter Katoen:
The Optimal Strategy to Meet the Deadline: Ask Christel! 1-14 - Hubert Garavel, Holger Hermanns:
Nondeterminism in Interactive Markov Chains, with Application to the Erlangen Mainframe. 15-69 - Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier, Pierre Vandenhove:
Decisiveness for Countable MDPs and Insights for NPLCSs and POMDPs. 70-98 - Pablo F. Castro, Pedro R. D'Argenio:
Polytopal Stochastic Games. 99-117 - Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala, James Worrell:
Algorithmic Applications of Schanuel's Conjecture. 118-138 - Sascha Klüppelholz, Jakob Piribauer:
Stop Gambling! It Just Takes Too Long. 139-157 - Marta Kwiatkowska, Gethin Norman, David Parker:
Probabilistic Model Checking: Applications and Trends. 158-173 - Erika Ábrahám, Nils Jansen, Simon Jantsch:
Probabilistic Counterexamples Through the Ages. 174-196 - Antonín Kucera:
PCTL Satisfiability for Infinite Binary Trees. 197-206 - Mishel Carelli, Orna Grumberg:
CTL* Verification and Synthesis Using Existential Horn Clauses. 207-233 - Clemens Dubslaff:
Featured Message Sequence Graphs. 234-252 - Martin Leucker:
A Note on Runtime Verification of Concurrent Systems. 253-265 - Klaus Havelund, Moran Omer, Doron Peled:
Embedding Monitoring of First-Order Temporal Logic in a Programming Language. 266-283 - Chengzi Huang, Behnam Khodabandeloo, Duc Anh Nguyen, Wang Yi, Jie An, Zhang Zhenya:
Causality Monitoring for MIMOS. 284-300 - Frank S. de Boer, Hans-Dieter A. Hiep:
Beyond Concurrent Separation Logic: Who is Afraid of Completeness Proofs? 301-319 - Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen, Kai-Min Chung, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Fang-Yi Lo, Wei-Lun Tsai:
On the Verification of Quantum Circuits (Research Challenges and Opportunities). 320-341 - Ali Mehrani, Fatemeh Ghassemi, Marjan Sirjani, Farhad Arbab:
Efficient Join Order for Constraint Automata Through LLM-Generated Heuristics. 342-359 - Åsmund Aqissiaq Arild Kløvstad, Paul Kobialka, Riccardo Sieve, Andrea Pferscher, Laura Slaughter, Silvia Lizeth Tapia Tarifa, Einar Broch Johnsen:
What-If Scenarios for the BedreFlyt Digital Twin. 360-381 - Lisa Willemsen, Anne Remke, Boudewijn R. Haverkort, Johann L. Hurink:
Running.Christel: A Stochastic Hybrid Case-Study Optimizing Battery Pack Usage. 382-407 - Mouhammad Sakr, Marcus Völp:
Termination in Extended Probabilistic Threshold Automata. 408-424
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 2026-01-29 23:10 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:
