A Hoare Logic for Continuous-Time Stochastic Processes
Kei Imada, Justin Hsu
Abstract
Programming language researchers have developed a wide array of tools to reason about probabilistic programs, but it remains unclear how to apply these proof techniques to continuous-time stochastic processes. To bridge this gap, we propose a verification method for properties of continuous-time stochastic processes by reasoning about them as standard programs. To demonstrate our approach, we define a continuous semantics for a probabilistic imperative language pWhiledt by taking the Kuratowski limit of the standard semantics, which collects limit points of the standard program semantics as the time-step approaches zero. Then, we present a Hoare-style logic that uses loop invariants and decreasing functions to verify properties of continuous programs. To establish soundness, we identify a broad class of assertions that are preserved from the standard semantics to the continuous semantics. To demonstrate our approach, we verify properties of ten continuous-time stochastic processes modeled in pWhiledt, including variants of Brownian motion and a stochastic hybrid system.
Create a lesson
Related papers
Hereditary permutations for simple types revisited: A baby case for University Algebra
Thorsten Altenkirch
On the semantics of conditional branching
Fredrik Dahlqvist
Invariance and Expressiveness: Modal Variations
Martin Otto
The Necessity of Acceptance & Rejection in Inferential Reasoning
Khashayar Irani
Burnside Problems for Matrix Semigroup Quotients with Applications to Border Complexity
Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi et al.
The Density of Interpolants in Modal Logic: First Results
Roman Kontchakov, Louwe Kuijer, Frank Wolter