Disintegration and Bayesian inversion via string diagrams

K Cho, B Jacobs - Mathematical Structures in Computer Science, 2019 - cambridge.org
The notions of disintegration and Bayesian inversion are fundamental in conditional
probability theory. They produce channels, as conditional probabilities, from a joint state, or …

JANI: quantitative model and tool interaction

CE Budde, C Dehnert, EM Hahn, A Hartmanns… - … 2017, Held as Part of the …, 2017 - Springer
The formal analysis of critical systems is supported by a vast space of modelling formalisms
and tools. The variety of incompatible formats and tools however poses a significant …

Fifty years of Hoare's logic

KR Apt, ER Olderog - Formal Aspects of Computing, 2019 - Springer
Fifty years of Hoare’s logic | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Search Cart 1.Home 2.Formal Aspects of …

Advanced weakest precondition calculi for probabilistic programs

BL Kaminski - 2019 - discovery.ucl.ac.uk
Wir studieren die quantitative Analyse probabilistischer Programme. Dabei untersuchen wir
vornehmlich zwei Aspekte: Die Analysetechniken selbst, sowie die komplexitäts-bzw …

Conditioning in probabilistic programming

F Olmedo, F Gretz, N Jansen, BL Kaminski… - ACM Transactions on …, 2018 - dl.acm.org
This article investigates the semantic intricacies of conditioning, a main feature in
probabilistic programming. Our study is based on an extension of the imperative …

Positive Almost-Sure Termination: Complexity and Proof Rules

R Majumdar, VR Sathiyanarayana - Proceedings of the ACM on …, 2024 - dl.acm.org
We study the recursion-theoretic complexity of Positive Almost-Sure Termination (PAST) in
an imperative programming language with rational variables, bounded nondeterministic …

Model checking finite-horizon Markov chains with probabilistic inference

S Holtzen, S Junges, M Vazquez-Chanlatte… - … on Computer Aided …, 2021 - Springer
We revisit the symbolic verification of Markov chains with respect to finite horizon
reachability properties. The prevalent approach iteratively computes step-bounded state …

The 10,000 facets of MDP model checking

C Baier, H Hermanns, JP Katoen - … and Software Science: State of the Art …, 2019 - Springer
This paper presents a retrospective view on probabilistic model checking. We focus on
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …

Lower bounds for possibly divergent probabilistic programs

S Feng, M Chen, H Su, BL Kaminski… - Proceedings of the …, 2023 - dl.acm.org
We present a new proof rule for verifying lower bounds on quantities of probabilistic
programs. Our proof rule is not confined to almost-surely terminating programs--as is the …

Behavioural artificial intelligence: an agenda for systematic empirical studies of artificial inference

T Pedersen, C Johansen - AI & SOCIETY, 2020 - Springer
Artificial intelligence (AI) receives attention in media as well as in academe and business. In
media coverage and reporting, AI is predominantly described in contrasted terms, either as …