Compositional specification and analysis of cost-based properties in probabilistic programs

DOI10.1007/11526841_9MaRDI QIDQ5716917zbMATH OpenOpenAlexFDO

Authors Orieta Celiku, Annabelle McIver

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b27882

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2147036
• Verification of Probabilistic Programs
• Probabilistic analysis of programs: a weak limit approach
• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
• Validation of Stochastic Systems

Cited in

(11)

• Performance analysis of probabilistic action systems
• Moment-based analysis of Bayesian network properties
• Weakest precondition reasoning for expected run-times of probabilistic programs
• Constructive development of probabilistic programs
• The Complexity of Synthesis from Probabilistic Components
• Long-run cost analysis by approximation of linear operators over dioids
• scientific article; zbMATH DE number 2147036 (Why is no real title available?)
• Semantic foundations for cost analysis of pipeline-optimized programs
• Quantum weakest preconditions for reasoning about expected runtimes of quantum programs
• Quantum weakest preconditions for reasoning about expected runtimes of quantum programs
• Algebraic reasoning for probabilistic action systems and while-loops

This page was built for publication: Compositional specification and analysis of cost-based properties in probabilistic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716917)