Termination Analysis of Probabilistic Programs Through Positivstellensatz’s-Reference-Cited by-同舟云学术

Termination Analysis of Probabilistic Programs Through Positivstellensatz’s

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

Author:

Chatterjee Krishnendu,Fu Hongfei,Goharshady Amir Kafshdar

Publisher

Springer International Publishing

Link

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

Reference50 articles.

1. SeDuMi 1.3 (2008). http://sedumi.ie.lehigh.edu/

2. IBM ILOG CPLEX Optimizer Interactive Optimizer Community Edition 12.6.3.0 (2010). http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/

3. SOSTOOLS v3.00 (2013). http://www.cds.caltech.edu/sostools/

4. Babic, D., Cook, B., Hu, A.J., Rakamaric, Z.: Proving termination of nonlinear command sequences. Form. Asp. Comput. 25(3), 389–403 (2013)

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

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

1. Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic;Lecture Notes in Computer Science;2024-09-11

2. Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs;Lecture Notes in Computer Science;2024-09-11

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

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

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