| Gradient-Descent for Randomized Controllers Under Partial Observability. | 0 | 0.34 | 2022 |
| The probabilistic model checker Storm | 1 | 0.36 | 2022 |
| Inductive synthesis of finite-state controllers for POMDPs. | 0 | 0.34 | 2022 |
| Towards Concurrent Quantitative Separation Logic | 0 | 0.34 | 2022 |
| The complexity of reachability in parametric Markov decision processes | 1 | 0.35 | 2021 |
| Automated Termination Analysis of Polynomial Probabilistic Programs | 0 | 0.34 | 2021 |
| Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions | 2 | 0.37 | 2021 |
| Inductive Synthesis for Probabilistic Programs Reaches New Horizons. | 0 | 0.34 | 2021 |
| Fine-Tuning the Odds in Bayesian Networks | 0 | 0.34 | 2021 |
| Explaining Boolean-Logic Driven Markov Processes using GSPNs | 1 | 0.36 | 2020 |
| Generative Datalog with Continuous Distributions | 1 | 0.37 | 2020 |
| Generating Functions for Probabilistic Programs | 0 | 0.34 | 2020 |
| Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination | 3 | 0.37 | 2020 |
| IC3 software model checking | 0 | 0.34 | 2020 |
| On the hardness of analyzing probabilistic programs | 6 | 0.40 | 2019 |
| Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems. | 1 | 0.35 | 2019 |
| Synergizing Reliability Modeling Languages: BDMPs without Repairs and DFTs | 1 | 0.36 | 2019 |
| Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification. | 1 | 0.35 | 2019 |
| Safety analysis for vehicle guidance systems with dynamic fault trees. | 3 | 0.41 | 2019 |
| Parameter Synthesis for Markov Models. | 1 | 0.35 | 2019 |
| On the Complexity of Reachability in Parametric Markov Decision Processes. | 0 | 0.34 | 2019 |
| Conditioning in Probabilistic Programming. | 6 | 0.43 | 2018 |
| Abstraktions-basierte Verifikation von POMDPs im Motion-Planning-Kontext. | 0 | 0.34 | 2018 |
| Machine Learning and Model Checking Join Forces (Dagstuhl Seminar 18121). | 0 | 0.34 | 2018 |
| Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs. | 0 | 0.34 | 2018 |
| How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times. | 2 | 0.37 | 2018 |
| Fast Dynamic Fault Tree Analysis by Model Checking Techniques. | 13 | 0.59 | 2018 |
| Sound Value Iteration | 1 | 0.34 | 2018 |
| Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation. | 2 | 0.36 | 2017 |
| The Probabilistic Model Checker Storm (Extended Abstract). | 3 | 0.37 | 2016 |
| Reasoning about Recursive Probabilistic Programs. | 24 | 0.74 | 2016 |
| Advancing Dynamic Fault Tree Analysis. | 1 | 0.34 | 2016 |
| Probabilistic Model Checking for Complex Cognitive Tasks - A case study in human-robot interaction. | 0 | 0.34 | 2016 |
| Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs | 29 | 0.93 | 2016 |
| Inferring Covariances For Probabilistic Programs | 4 | 0.40 | 2016 |
| The Probabilistic Model Checking Landscape. | 27 | 0.86 | 2016 |
| Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems | 0 | 0.34 | 2015 |
| A Statistical Approach for Timed Reachability in AADL Models | 2 | 0.37 | 2015 |
| Model Checking of Open Interval Markov Chains | 4 | 0.44 | 2015 |
| Verifying pointer programs using graph grammars. | 0 | 0.34 | 2015 |
| GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components. | 5 | 0.40 | 2014 |
| Analysis of Timed and Long-Run Objectives for Markov Automata. | 13 | 0.54 | 2014 |
| Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard. | 0 | 0.34 | 2014 |
| Parametric LTL on Markov Chains. | 2 | 0.38 | 2014 |
| A compositional modelling and analysis framework for stochastic hybrid systems | 45 | 1.26 | 2013 |
| High-Level counterexamples for probabilistic automata | 12 | 0.45 | 2013 |
| Smt-Based Bisimulation Minimisation Of Markov Models | 4 | 0.38 | 2013 |
| Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems | 18 | 0.79 | 2013 |
| Layered reasoning for randomized distributed algorithms | 4 | 0.41 | 2012 |
| Minimal Critical Subsystems as Counterexamples for omega-Regular DTMC Properties. | 5 | 0.41 | 2012 |
