Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments-Reference-Cited by-同舟云学术

Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments

Published:2019 Issue: Volume: Page:135-153
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Kura Satoshi,Urabe Natsuki,Hasuo Ichiro

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-17465-1_8

Reference36 articles.

1. Agrawal, S., Chatterjee, K., Novotný, P.: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. PACMPL 2(POPL), 34:1–34:32 (2018)

2. Lecture Notes in Computer Science;K Batz,2018

3. Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press, Oxford (2013)

4. Lecture Notes in Computer Science;A Chakarov,2013

5. Chatterjee, K., Fu, H.: Termination of nondeterministic recursive probabilistic programs. CoRR, abs/1701.02944 (2017)

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

1. Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System;Proceedings of the ACM on Programming Languages;2024-08-15

2. Equivalence and Similarity Refutation for Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-06-20

3. Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving;Proceedings of the ACM on Programming Languages;2024-06-20

4. Quantitative Bounds on Resource Usage of Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-04-29

5. Positive Almost-Sure Termination: Complexity and Proof Rules;Proceedings of the ACM on Programming Languages;2024-01-05