Abstract
Whereas the semantics of probabilistic languages has been extensively studied, specification languages for their properties have received less attention---with the notable exception of recent and on-going efforts by Joost-Pieter Katoen and collaborators. In this paper, we revisit probabilistic dynamic logic (pDL), a specification logic for programs in the probabilistic guarded command language (pGCL) of McIver and Morgan. Building on dynamic logic, pDL can express both first-order state properties and probabilistic reachability properties. In this paper, we report on work in progress towards a deductive proof system for pDL. This proof system, in line with verification systems for dynamic logic such as KeY, is based on forward reasoning by means of symbolic execution.
Original language | English |
---|---|
Title of host publication | Towards a Proof System for Probabilistic Dynamic Logic |
Volume | 15260 |
Publisher | Springer Nature Switzerland |
Publication date | 2024 |
Pages | 322-338 |
DOIs | |
Publication status | Published - 2024 |
Event | Colloquium on Principles of Verification: Cycling the Probabilistic Landscape: Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday - University of Aachen, Aachen, Germany Duration: 7 Nov 2024 → … |
Other
Other | Colloquium on Principles of Verification: Cycling the Probabilistic Landscape |
---|---|
Location | University of Aachen |
Country/Territory | Germany |
City | Aachen |
Period | 07/11/2024 → … |
Keywords
- Dynamic logic
- Probabilistic programs
- Deductive verification