Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs-Reference-Cited by-同舟云学术

Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs

Published:2005 Issue: Volume: Page:107-122
ISSN:0302-9743
Container-title:FM 2005: Formal Methods
language:
Short-container-title:

Author:

Celiku Orieta,McIver Annabelle

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11526841_9.pdf

Reference17 articles.

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

2. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

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

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

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

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automated Expected Value Analysis of Recursive Programs;Proceedings of the ACM on Programming Languages;2023-06-06

2. Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

3. On continuation-passing transformations and expected cost analysis;Proceedings of the ACM on Programming Languages;2021-08-22

4. A modular cost analysis for probabilistic programs;Proceedings of the ACM on Programming Languages;2020-11-13

5. Analysis of Bayesian Networks via Prob-Solvable Loops;Theoretical Aspects of Computing – ICTAC 2020;2020