Synthesizing Probabilistic Invariants via Doob’s Decomposition-Reference-Cited by-同舟云学术

Synthesizing Probabilistic Invariants via Doob’s Decomposition

Published:2016 Issue: Volume: Page:43-61
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Barthe Gilles,Espitau Thomas,Ferrer Fioriti Luis María,Hsu Justin

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-41528-4_3

Reference33 articles.

1. Allen, J.R., Kennedy, K., Porterfield, C., Warren, J.: Conversion of control dependence to data dependence. In: ACM Symposium on Principles of Programming Languages (POPL), Austin, Texas, pp. 177–189. ACM, New York (1983). ISBN 0-89791-090-7

2. Ammarguellat, Z., Harrison III, W.L.: Automatic recognition of induction variables and recurrence relations by abstract interpretation. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), White Plains, New York, pp. 283–295 (1990)

3. Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008). ISBN 978-0-262-02649-9

4. Lecture Notes in Computer Science;G Barthe,2011

5. Lecture Notes in Computer Science;O Bournez,2005

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

1. Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions;Proceedings of the ACM on Programming Languages;2024-04-29

2. Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs;Proceedings of the ACM on Programming Languages;2024-04-29

3. Newtonian Program Analysis of Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-04-29

4. Inference of Probabilistic Programs with Moment-Matching Gaussian Mixtures;Proceedings of the ACM on Programming Languages;2024-01-05

5. Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs;Proceedings of the ACM on Programming Languages;2024-01-05