Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference51 articles.
1. Affeldt, R., Hagiwara, M., Sénizergues, J.: Formalization of Shannon’s theorems. J. Autom. Reason. 53(1), 63–103 (2014)
2. Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74(8), 568–589 (2009). (Special Issue on Mathematics of Program Construction (MPC 2006))
3. Avigad, J., Hölzl, J., Serafin, L.: A formally verified proof of the central limit theorem. CoRR arxiv:1405.7012 (2014)
4. Backhouse, R.C.: Galois connections and fixed point calculus. In: Backhouse, R.C., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, LNCS, vol. 2297, pp. 89–148 (2000)
5. Baier, C.: On the algorithmic verification of probabilistic systems. Habilitation, Universität Mannheim (1998)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Formally Verified Maximal End Component Decomposition for MDPs;Lecture Notes in Computer Science;2024-09-11
2. Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09
3. Fast Verified SCCs for Probabilistic Model Checking;Automated Technology for Verification and Analysis;2023
4. CertRL: formalizing convergence proofs for value and policy iteration in Coq;Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs;2021-01-17
5. ENHANCED MOEA/D FOR TRAJECTORY PLANNING IMPROVEMENT OF ROBOT MANIPULATOR;International Journal of Robotics and Automation;2021