跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.12761 · v1

A Hoare Logic for Continuous-Time Stochastic Processes

连续时间随机过程的霍尔逻辑

首次提交 2026-11-10 01:38
版本更新 2026-11-10 01:38
雷达观测 2026-11-10 15:22
arXiv ↗PDF ↗

摘要

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\mathrm{pWhile}^{\mathrm{dt}} 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\mathrm{pWhile}^{\mathrm{dt}}, including variants of Brownian motion and a stochastic hybrid system.

AI 论文解读

基于摘要 · 非全文审阅

作者提出用程序验证的思路处理连续时间随机过程:为概率命令式语言 pWhile^dt 定义连续语义,并给出基于循环不变式与递减函数的霍尔式逻辑。

正在读取账号与研究记录…

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-10 01:38 · 最新观测版本

A Hoare Logic for Continuous-Time Stochastic Processes

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\mathrm{pWhile}^{\mathrm{dt}} 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\mathrm{pWhile}^{\mathrm{dt}}, including variants of Brownian motion and a stochastic hybrid system.

查看此版本解读 →查看此版本原文 ↗