Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
- 1 January 2016
- book chapter
- Published by Springer Nature
- p. 364-389
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Probabilistic Program Analysis with Martingales2013
- A general framework for sound and complete Floyd-Hoare logicsACM Transactions on Computational Logic, 2009
- Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs2005
- Formal Development and Verification of Approximation Algorithms Using Auxiliary VariablesLecture Notes in Computer Science, 2004
- A Formal Approach to Probabilistic TerminationLecture Notes in Computer Science, 2002
- Formalization of Time and SpaceFormal Aspects of Computing, 1998
- Automating program analysisJournal of the ACM, 1988
- A hoare-like proof system for analysing the computation time of programsScience of Computer Programming, 1987
- Semantics of probabilistic programsJournal of Computer and System Sciences, 1981
- An axiomatic basis for computer programmingCommunications of the ACM, 1969