10 research outputs found
PrIC3: Property Directed Reachability for MDPs
IC3 has been a leap forward in symbolic model checking. This paper proposes
PrIC3 (pronounced pricy-three), a conservative extension of IC3 to symbolic
model checking of MDPs. Our main focus is to develop the theory underlying
PrIC3. Alongside, we present a first implementation of PrIC3 including the key
ingredients from IC3 such as generalization, repushing, and propagation
Programming Languages and Systems
This open access book constitutes the proceedings of the 30th European Symposium on Programming, ESOP 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 24 papers included in this volume were carefully reviewed and selected from 79 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems
Exact Bayesian Inference for Loopy Probabilistic Programs
We present an exact Bayesian inference method for inferring posterior
distributions encoded by probabilistic programs featuring possibly unbounded
looping behaviors. Our method is built on an extended denotational semantics
represented by probability generating functions, which resolves semantic
intricacies induced by intertwining discrete probabilistic loops with
conditioning (for encoding posterior observations). We implement our method in
a tool called Prodigy; it augments existing computer algebra systems with the
theory of generating functions for the (semi-)automatic inference and
quantitative verification of conditioned probabilistic programs. Experimental
results show that Prodigy can handle various infinite-state loopy programs and
outperforms state-of-the-art exact inference tools over benchmarks of loop-free
programs