Proofs of randomized algorithms in Coq-Reference-Cited by-同舟云学术

Proofs of randomized algorithms in Coq

Published:2009-06 Issue:8 Volume:74 Page:568-589
ISSN:0167-6423
Container-title:Science of Computer Programming
language:en
Short-container-title:Science of Computer Programming

Author:

Audebaud Philippe,Paulin-Mohring Christine

Publisher

Elsevier BV

Subject

Software

Reference26 articles.

1. Proofs of randomized algorithms in Coq;Audebaud,2006

2. M. Escardó, A. Simpson, A universal characterization of the closed euclidean interval (extended abstract), in: Proc. of 16th Ann. IEEE Symp. on Logic in Computer Science, LICS 2001 Boston, MA, June 2001, IEEE CS Press, Los Alamitos, CA, pp. 115–125

3. The Why Verification Tool;Filliâtre,2002

4. Verification of non-functional programs using interpretations in type theory;Filliâtre;J. Funct. Programming,2003

5. Constructive reals in Coq: Axioms and categoricity;Geuvers,2002

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

1. Lower Bounds for Possibly Divergent Probabilistic Programs;Proceedings of the ACM on Programming Languages;2023-04-06

2. Semantics of Probabilistic Programs using s-Finite Kernels in Coq;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

3. Experimenting with an Intrinsically-Typed Probabilistic Programming Language in Coq;Programming Languages and Systems;2023

4. A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory;Journal of Automated Reasoning;2022-01-15

5. Model Checking Temporal Properties of Recursive Probabilistic Programs;Lecture Notes in Computer Science;2022