Zobrazeno 1 - 10
of 207
pro vyhledávání: '"Matheja, P"'
Markov decision processes (MDPs) with rewards are a widespread and well-studied model for systems that make both probabilistic and nondeterministic choices. A fundamental result about MDPs is that their minimal and maximal expected rewards satisfy Be
Externí odkaz:
http://arxiv.org/abs/2411.16564
Probabilistic programming (PP) is a programming paradigm that allows for writing statistical models like ordinary programs, performing simulations by running those programs, and analyzing and refining their statistical behavior using powerful inferen
Externí odkaz:
http://arxiv.org/abs/2406.11883
Partially observable Markov Decision Processes (POMDPs) are a standard model for agents making decisions in uncertain environments. Most work on POMDPs focuses on synthesizing strategies based on the available capabilities. However, system designers
Externí odkaz:
http://arxiv.org/abs/2405.10768
Autor:
Schröer, Philipp, Batz, Kevin, Kaminski, Benjamin Lucien, Katoen, Joost-Pieter, Matheja, Christoph
This paper presents a quantitative program verification infrastructure for discrete probabilistic programs. Our infrastructure can be viewed as the probabilistic analogue of Boogie: its central components are an intermediate verification language (IV
Externí odkaz:
http://arxiv.org/abs/2309.07781
Autor:
Batz, Kevin, Kaminski, Benjamin Lucien, Katoen, Joost-Pieter, Matheja, Christoph, Verscht, Lena
We develop a weakest-precondition-style calculus \`a la Dijkstra for reasoning about amortized expected runtimes of randomized algorithms with access to dynamic memory - the $\textsf{aert}$ calculus. Our calculus is truly quantitative, i.e. instead o
Externí odkaz:
http://arxiv.org/abs/2211.12923
Autor:
Batz, Kevin, Chen, Mingshuai, Junges, Sebastian, Kaminski, Benjamin Lucien, Katoen, Joost-Pieter, Matheja, Christoph
Essential tasks for the verification of probabilistic programs include bounding expected outcomes and proving termination in finite expected runtime. We contribute a simple yet effective inductive synthesis approach for proving such quantitative reac
Externí odkaz:
http://arxiv.org/abs/2205.06152
Autor:
Batz, Kevin, Fesefeldt, Ira, Jansen, Marvin, Katoen, Joost-Pieter, Keßler, Florian, Matheja, Christoph, Noll, Thomas
Quantitative separation logic (QSL) is an extension of separation logic (SL) for the verification of probabilistic pointer programs. In QSL, formulae evaluate to real numbers instead of truth values, e.g., the probability of memory-safe termination i
Externí odkaz:
http://arxiv.org/abs/2201.11464
Refinement transforms an abstract system model into a concrete, executable program, such that properties established for the abstract model carry over to the concrete implementation. Refinement has been used successfully in the development of substan
Externí odkaz:
http://arxiv.org/abs/2110.13559
Autor:
Batz, Kevin, Chen, Mingshuai, Kaminski, Benjamin Lucien, Katoen, Joost-Pieter, Matheja, Christoph, Schröer, Philipp
We revisit two well-established verification techniques, $k$-induction and bounded model checking (BMC), in the more general setting of fixed point theory over complete lattices. Our main theoretical contribution is latticed $k$-induction, which (i)
Externí odkaz:
http://arxiv.org/abs/2105.14100
We study a syntax for specifying quantitative "assertions" - functions mapping program states to numbers - for probabilistic program verification. We prove that our syntax is expressive in the following sense: Given any probabilistic program $C$, if
Externí odkaz:
http://arxiv.org/abs/2010.14548