This paper presents a quantitative program verification infrastructure f...
We present an exact Bayesian inference method for inferring posterior
di...
This paper marries two state-of-the-art controller synthesis methods for...
This paper addresses the ϵ-close parameter tuning problem for
Bayesian N...
Probabilistic pushdown automata (pPDA) are a natural operational model f...
We present a new proof rule for verifying lower bounds on quantities of
...
Probabilistic programs are typically normal-looking programs describing
...
We develop a weakest-precondition-style calculus à la Dijkstra for
reaso...
A barrier certificate often serves as an inductive invariant that isolat...
This paper surveys the analysis of parametric Markov models whose transi...
In this paper, we develop a novel verification technique to reason about...
A desired property of randomized systems, represented by probabilistic
p...
We study discrete probabilistic programs with potentially unbounded loop...
We present a novel learning framework to obtain finite-state controllers...
We study weighted programming, a programming paradigm for specifying
mat...
Fault trees are a key model in reliability analysis. Classical static fa...
Quantitative separation logic (QSL) is an extension of separation logic ...
We consider the problem: is the optimal expected total reward to reach a...
We consider parametric Markov decision processes (pMDPs) that are augmen...
Randomization is a powerful technique to create robust controllers, in
p...
Probabilistic pushdown automata (pPDA) are a standard operational model ...
We describe the Amber tool for proving and refuting the termination of a...
This paper presents a Hoare-style calculus for formal reasoning about
re...
Probabilistic model checking aims to prove whether a Markov decision pro...
This paper proposes various new analysis techniques for Bayes networks i...
A barrier certificate often serves as an inductive invariant that isolat...
We revisit two well-established verification techniques, k-induction and...
This paper outlines two approaches|based on counterexample-guided abstra...
This paper presents a novel method for the automated synthesis of
probab...
Statistical models of real world data typically involve continuous
proba...
We present a new, simple technique to reduce state space sizes in
probab...
We study a syntax for specifying quantitative "assertions" - functions
m...
This paper presents an efficient procedure for multi-objective model che...
The termination behavior of probabilistic programs depends on the outcom...
This article presents the complexity of reachability decision problems f...
This paper applies probabilistic model checking techniques for discrete
...
This paper investigates the usage of generating functions (GFs) encoding...
The verification problem in MDPs asks whether, for any policy resolving ...
We present a semantics of a probabilistic while-language with soft
condi...
We study turn-based stochastic zero-sum games with lexicographic prefere...
IC3 has been a leap forward in symbolic model checking. This paper propo...
A Boolean logic driven Markov process (BDMP) is a dependability analysis...
This paper reports on our experiences with verifying automotive C code b...
We present the probabilistic model checker Storm. Storm supports the ana...
Arguing for the need to combine declarative and probabilistic programmin...
We consider Markov decision processes (MDPs) in which the transition
pro...
We consider the verification of multiple expected reward objectives at o...
This paper presents a simple algorithm to check whether reachability
pro...
In industrial model-based development (MBD) frameworks, requirements are...
Probabilistic programs are key to deal with uncertainty in e.g. controll...