VPHL: a verified partial-correctness logic for probabilistic programs

DOI10.1016/j.entcs.2015.12.021zbMath1351.68080WikidataQ113317720 ScholiaQ113317720MaRDI QIDQ5971408

No author found.

Publication date: 16 December 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2015.12.021

zbMATH Keywords

formal verification; Hoare logic; probabilistic programming; Coq; non-termination

Mathematics Subject Classification ID

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

03B70: Logic in computer science

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Uses Software

• Coq
• EasyCrypt
• pGCL
• ALEA