Article

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

Authors:

Annabelle McIverAuthors Info & Claims

FM'05: Proceedings of the 2005 international conference on Formal Methods

Pages 107 - 122

https://doi.org/10.1007/11526841_9

Published: 18 July 2005 Publication History

Abstract

We introduce a formal framework for reasoning about performance-style properties of probabilistic programs at the level of program code. Drawing heavily on the refinement-style of program verification, our approach promotes abstraction and proof re-use. The theory and proof tools to facilitate the verification have been implemented in HOL.

References

[1]

O. Celiku and A. McIver. Cost-based analysis of probabilistic programs mechanised in HOL. Nordic Journal of Computing, 11(2):102-128, 2004.

Digital Library

[2]

E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.

Digital Library

[3]

Erlangen-Twente Markov Chain Checker. http://www.informatik.uni-erlangen. de/etmcc/.

[4]

C. J. Fidge and C. Shankland. But what if I don't want to wait forever? Formal Aspects of Computing, 15(2-3):258-279, 2003.

[5]

M. J. C. Gordon and T. F. Melham. Introduction to HOL (A theorem-proving environment for higher order logic). Cambridge University Press, 1993.

Digital Library

[6]

J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.

Digital Library

[7]

J. Hurd. Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge, 2002.

[8]

J. Hurd, A. McIver, and C. Morgan. Probabilistic guarded commands mechanized in HOL. In Proc. of QAPL 2004, Mar. 2004.

[9]

Institute of Electrical and Electronics Engineers. IEEE Standard for a High Performance Serial Bus (Ammendment). Std 1394a-2000. June 2000.

[10]

D. E. Knuth and A. C. Yao. The complexity of nonuniform random number generation. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results. Academic Press, 1976.

[11]

D. Kozen. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing, 1983.

Digital Library

[12]

M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Proceedings of TOOLS 2002, volume 2324 of Lecture Notes in Computer Science, pages 200-204. Springer, Apr. 2002.

Digital Library

[13]

A. McIver and C. Morgan. Abstraction, refinement and proof for probabilistic systems. Springer, 2004.

Digital Library

[14]

C. Morgan and A. McIver. pGCL: Formal reasoning for random algorithms. South African Computer Journal, 22:14-27, 1999.

[15]

C. C. Morgan. Programming from Specifications. Prentice-Hall, 1990.

Digital Library

[16]

T. Nipkow. Hoare logics in Isabelle/HOL. In H. Schwichtenberg and R. Steinbr üggen, editors, Proof and System-Reliability, pages 341-367. Kluwer, 2002.

[17]

M. Stoelinga. Fun with FireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol. Formal Aspects of Computing, 4(3):328-337, 2003.

Cited By

Avanzini MMoser GSchaper M(2023)Automated Expected Value Analysis of Recursive ProgramsProceedings of the ACM on Programming Languages10.1145/35912637:PLDI(1050-1072)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591263
Batz KKaminski BKatoen JMatheja CVerscht L(2023)A Calculus for Amortized Expected RuntimesProceedings of the ACM on Programming Languages10.1145/35712607:POPL(1957-1986)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571260
Liu JZhou LBarthe GYing M(2022)Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum ProgramsProceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3531130.3533327(1-13)Online publication date: 2-Aug-2022
https://dl.acm.org/doi/10.1145/3531130.3533327
Show More Cited By

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

Recommendations

Automatic Compositional Verification of Probabilistic Safety Properties for Inter-organisationalWorkflow Processes
SIMULTECH 2016: Proceedings of the 6th International Conference on Simulation and Modeling Methodologies, Technologies and Applications

For many complex systems, it is important to verify formally their correctness; the aim is to guarantee the

reliability and the correctness of such systems before their effective deployment. Several methods have been

proposed to this effect using ...
Specification patterns for probabilistic quality properties
ICSE '08: Proceedings of the 30th international conference on Software engineering

Probabilistic verification techniques are a powerful means to ensure that a software-intensive system fulfills its quality requirements. To apply these techniques an accurate specification of the required properties in a probabilistic temporal logic is ...
Compositional specification and verification of distributed systems

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FM'05: Proceedings of the 2005 international conference on Formal Methods

July 2005

558 pages

ISBN:3540278826

Editors:
John Fitzgerald
School of Computing Science, Newcastle University, Newcastle, UK
,
Ian J. Hayes
School of Information Technology and Electrical Engineering, The University of Queensland, Newcastle, Australia
,
Andrzej Tarlecki
Institute of Computer Science, Polish Academy of Sciences, Newcastle,

Sponsors

FME
SAP
CSR: CSR
BCS-FACS

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 July 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Avanzini MMoser GSchaper M(2023)Automated Expected Value Analysis of Recursive ProgramsProceedings of the ACM on Programming Languages10.1145/35912637:PLDI(1050-1072)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591263
Batz KKaminski BKatoen JMatheja CVerscht L(2023)A Calculus for Amortized Expected RuntimesProceedings of the ACM on Programming Languages10.1145/35712607:POPL(1957-1986)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571260
Liu JZhou LBarthe GYing M(2022)Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum ProgramsProceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3531130.3533327(1-13)Online publication date: 2-Aug-2022
https://dl.acm.org/doi/10.1145/3531130.3533327
Stankovič MBartocci EKovács L(2022)Moment-based analysis of Bayesian network propertiesTheoretical Computer Science10.1016/j.tcs.2021.12.021903:C(113-133)Online publication date: 8-Feb-2022
https://dl.acm.org/doi/10.1016/j.tcs.2021.12.021
Avanzini MBarthe GDal Lago U(2021)On continuation-passing transformations and expected cost analysisProceedings of the ACM on Programming Languages10.1145/34735925:ICFP(1-30)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473592
Avanzini MMoser GSchaper M(2020)A modular cost analysis for probabilistic programsProceedings of the ACM on Programming Languages10.1145/34282404:OOPSLA(1-30)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3428240
Bartocci EKovács LStankovič M(2020)Analysis of Bayesian Networks via Prob-Solvable LoopsTheoretical Aspects of Computing – ICTAC 202010.1007/978-3-030-64276-1_12(221-241)Online publication date: 30-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-64276-1_12
Ngo VCarbonneaux QHoffmann J(2018)Bounded expectations: resource analysis for probabilistic programsACM SIGPLAN Notices10.1145/3296979.319239453:4(496-512)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192394
Kaminski BKatoen JMatheja COlmedo F(2018)Weakest Precondition Reasoning for Expected Runtimes of Randomized AlgorithmsJournal of the ACM10.1145/320810265:5(1-68)Online publication date: 29-Aug-2018
https://dl.acm.org/doi/10.1145/3208102
Ngo VCarbonneaux QHoffmann JFoster JGrossman D(2018)Bounded expectations: resource analysis for probabilistic programsProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3192366.3192394(496-512)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3192366.3192394
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents