Formalising Semantics for Expected Running Time of Probabilistic Programs
DOI10.1007/978-3-319-43144-4_30zbMATH Open1478.68138OpenAlexW2494065672MaRDI QIDQ2829281FDOQ2829281
Publication date: 27 October 2016
Published in: Interactive Theorem Proving (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-43144-4_30
Recommendations
- Computing expected runtimes for constant probability programs
- Weakest precondition reasoning for expected run-times of probabilistic programs
- Fine-grained semantics for probabilistic programs
- Probabilistic semantics and program analysis
- Probabilistic semantics of terminating programs
- scientific article
- Reasoning about probabilistic sequential programs
- Runtime analysis of probabilistic programs with unbounded recursion
- Runtime analysis of probabilistic programs with unbounded recursion
- Application ofComputable Distributions to the Semantics of Probabilistic Programs
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Formalization of mathematics in connection with theorem provers (68V20)
Cites Work
- Abstraction, Refinement and Proof for Probabilistic Systems
- Proofs of randomized algorithms in Coq
- Title not available (Why is that?)
- Probabilistic guarded commands mechanized in HOL
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
Cited In (4)
Uses Software
This page was built for publication: Formalising Semantics for Expected Running Time of Probabilistic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829281)
