Ranking and repulsing supermartingales for reachability in probabilistic programs

DOI10.1007/978-3-030-01090-4_28zbMath1517.68084arXiv1805.10749MaRDI QIDQ6109604

Toru Takisaka, Yuichiro Oyabu, Natsuki Urabe, Ichiro Hasuo

Publication date: 28 July 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.10749

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Relational Differential Dynamic Logic ⋮ Automated termination analysis of polynomial probabilistic programs

This page was built for publication: Ranking and repulsing supermartingales for reachability in probabilistic programs