Bram Kohlen
YOU?
Author Swipe
View article: A Formally Verified IEEE 754 Floating-Point Implementation of Interval Iteration for MDPs
A Formally Verified IEEE 754 Floating-Point Implementation of Interval Iteration for MDPs Open
We present an efficiently executable, formally verified implementation of interval iteration for MDPs. Our correctness proofs span the entire development from the high-level abstract semantics of MDPs to a low-level implementation in LLVM …
View article: A Formally Verified IEEE 754 Floating-Point Implementation of Interval Iteration for MDPs
A Formally Verified IEEE 754 Floating-Point Implementation of Interval Iteration for MDPs Open
We present an efficiently executable, formally verified implementation of interval iteration for MDPs. Our correctness proofs span the entire development from the high-level abstract semantics of MDPs to a low-level implementation in LLVM …
View article: Efficient Formally Verified Maximal End Component Decomposition for MDPs
Efficient Formally Verified Maximal End Component Decomposition for MDPs Open
Identifying a Markov decision process’s maximal end components is a prerequisite for applying sound probabilistic model checking algorithms. In this paper, we present the first mechanized correctness proof of a maximal end component decomp…
View article: Backwards Reachability for Probabilistic Timed Automata: A Replication Report
Backwards Reachability for Probabilistic Timed Automata: A Replication Report Open
Backwards reachability is an efficient zone-based approach for model checking probabilistic timed automata w.r.t. PTCTL properties. Current implementations, however, are restricted to maximum probabilities of reachability properties. In th…