A storm is coming: A modern probabilistic model checker
We launch the new probabilistic model checker S torm. It features the analysis of discrete-
and continuous-time variants of both Markov chains and MDPs. It supports the P rism and …
and continuous-time variants of both Markov chains and MDPs. It supports the P rism and …
Episimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks
Preventing and controlling outbreaks of infectious diseases such as pandemic influenza is a
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …
Probabilistic program analysis with martingales
A Chakarov, S Sankaranarayanan - … , Saint Petersburg, Russia, July 13-19 …, 2013 - Springer
We present techniques for the analysis of infinite state probabilistic programs to synthesize
probabilistic invariants and prove almost-sure termination. Our analysis is based on the …
probabilistic invariants and prove almost-sure termination. Our analysis is based on the …
[图书][B] Foundations of quantum programming
M Ying - 2024 - books.google.com
Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …
available computer systems. Quantum computing offers great promise in a wide variety of …
Weakest precondition reasoning for expected run–times of probabilistic programs
This paper presents a wp–style calculus for obtaining bounds on the expected run–time of
probabilistic programs. Its application includes determining the (possibly infinite) expected …
probabilistic programs. Its application includes determining the (possibly infinite) expected …
Bounded expectations: resource analysis for probabilistic programs
VC Ngo, Q Carbonneaux, J Hoffmann - ACM SIGPLAN Notices, 2018 - dl.acm.org
This paper presents a new static analysis for deriving upper bounds on the expected
resource consumption of probabilistic programs. The analysis is fully automatic and derives …
resource consumption of probabilistic programs. The analysis is fully automatic and derives …
Probabilistic termination: Soundness, completeness, and compositionality
LM Ferrer Fioriti, H Hermanns - Proceedings of the 42nd Annual ACM …, 2015 - dl.acm.org
We propose a framework to prove almost sure termination for probabilistic programs with
real valued variables. It is based on ranking supermartingales, a notion analogous to …
real valued variables. It is based on ranking supermartingales, a notion analogous to …
JANI: quantitative model and tool interaction
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 …
and tools. The variety of incompatible formats and tools however poses a significant …
Termination analysis of probabilistic programs through Positivstellensatz's
We consider nondeterministic probabilistic programs with the most basic liveness property of
termination. We present efficient methods for termination analysis of nondeterministic …
termination. We present efficient methods for termination analysis of nondeterministic …
Stochastic invariants for probabilistic termination
Termination is one of the basic liveness properties, and we study the termination problem for
probabilistic programs with real-valued variables. Previous works focused on the qualitative …
probabilistic programs with real-valued variables. Previous works focused on the qualitative …