Termination of Nondeterministic Probabilistic Programs-Reference-Cited by-同舟云学术

Termination of Nondeterministic Probabilistic Programs

Published:2019 Issue: Volume: Page:468-490
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fu Hongfei,Chatterjee Krishnendu

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-11245-5_22

Reference57 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;M Avanzini,2018

3. Avanzini, M., Lago, U.D., Yamada, A.: On probabilistic term rewriting. CoRR abs/1802.09774 (2018). http://arxiv.org/abs/1802.09774

4. Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)

5. Barthe, G., Espitau, T., Grégoire, B., Hsu, J., Strub, P.: Proving expected sensitivity of probabilistic programs. PACMPL 2(POPL), 57:1–57:29 (2018)

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

1. Almost-Sure Termination by Guarded Refinement;Proceedings of the ACM on Programming Languages;2024-08-15

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

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

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

5. Lexicographic Ranking Supermartingales with Lazy Lower Bounds;Lecture Notes in Computer Science;2024