{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:14:10Z","timestamp":1752984850976},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540356318"},{"type":"electronic","value":"9783540356325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11783596_6","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T14:35:02Z","timestamp":1151505302000},"page":"49-68","source":"Crossref","is-referenced-by-count":19,"title":["Proofs of Randomized Algorithms in Coq"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Audebaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Paulin-Mohring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1145\/503272.503288","volume-title":"Conf. Record of 29th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2002","author":"N. Ramsey","year":"2002","unstructured":"Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. In: Conf. Record of 29th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2002, pp. 154\u2013165. ACM Press, New York (2002)"},{"key":"6_CR2","unstructured":"The Coq Development Team: The Coq Proof Assistant Reference Manual \u2013 Version V8.0 (2004), \n                    \n                      http:\/\/coq.inria.fr"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D. Kozen","year":"1981","unstructured":"Kozen, D.: Semantics of probabilistic programs. J. of Comput. and Syst. Sci.\u00a022(3), 328\u2013350 (1981)","journal-title":"J. of Comput. and Syst. Sci."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/800061.808758","volume-title":"Proc. of 15th Ann. ACM Symp. on Theory of Computing, STOC 1983","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: A probabilistic PDL. In: Proc. of 15th Ann. ACM Symp. on Theory of Computing, STOC 1983, pp. 291\u2013297. ACM Press, New York (1983)"},{"key":"6_CR5","unstructured":"Morgan, C., McIver, A.: pGCL: formal reasoning for random algorithms. South African Computer J. (1999)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/1040305.1040320","volume-title":"Proc. of 32nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2005","author":"S. Park","year":"2005","unstructured":"Park, S., Pfenning, F., Thrun, S.: A probabilistic language based upon sampling functions. In: Proc. of 32nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2005, pp. 171\u2013182. ACM Press, New York (2005)"},{"key":"6_CR7","series-title":"Electron. Notes in Theor. Comput. Sci.","first-page":"95","volume-title":"Proc. of 2nd Wksh. on Quantitative Aspects of Programming Languages, QAPL 2004","author":"J. Hurd","year":"2005","unstructured":"Hurd, J., McIver, A., Morgan, C.: Probabilistic guarded commands mechanized in HOL. In: Cerone, A., Pierro, A.D. (eds.) Proc. of 2nd Wksh. on Quantitative Aspects of Programming Languages, QAPL 2004. Electron. Notes in Theor. Comput. Sci., vol.\u00a0112, pp. 95\u2013111. Elsevier, Amsterdam (2005)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/s10009-004-0140-2","volume":"6","author":"M. Kwiatkowska","year":"2004","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: A hybrid approach. J.\u00a0on Software Tools for Technology Transfer\u00a06(2), 128\u2013142 (2004)","journal-title":"J.\u00a0on Software Tools for Technology Transfer"},{"key":"6_CR9","unstructured":"Hurd, J.: Formal Verification of Probabilistic Algorithms. PhD thesis, Univ. of Cambridge (2002)"},{"issue":"1-2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S1567-8326(02)00065-6","volume":"50","author":"J. Hurd","year":"2003","unstructured":"Hurd, J.: Verification of the Miller-Rabin probabilistic primality test. J. of Logic and Algebraic Program.\u00a050(1-2), 3\u201321 (2003)","journal-title":"J. of Logic and Algebraic Program."},{"key":"6_CR11","unstructured":"Jones, C.: Probabilistic Non-determinism. PhD thesis, Univ. of Edinburgh (1989)"},{"key":"6_CR12","first-page":"186","volume-title":"Proc. of 4th Ann. IEEE Symp. on Logic in Computer Science, LICS 1989","author":"C. Jones","year":"1989","unstructured":"Jones, C., Plotkin, G.: A probabilistic powerdomain of evaluations. In: Proc. of 4th Ann. IEEE Symp. on Logic in Computer Science, LICS 1989, pp. 186\u2013195. IEEE Comput. Soc. Press, Los Alamitos (1989)"},{"key":"6_CR13","volume-title":"Monographs in Computer Science","author":"A. McIver","year":"2005","unstructured":"McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. In: Monographs in Computer Science. Springer, Heidelberg (2005)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inform. and Comput.\u00a093(1), 55\u201392 (1991)","journal-title":"Inform. and Comput."},{"issue":"4","key":"6_CR15","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1017\/S0960129501003322","volume":"11","author":"F. Pfenning","year":"2001","unstructured":"Pfenning, F., Davies, R.: A judgmental reconstruction of modal logic. Math. Struct. in Comput. Sci.\u00a011(4), 511\u2013540 (2001)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-45842-5_6","volume-title":"Types for Proofs and Programs","author":"H. Geuvers","year":"2002","unstructured":"Geuvers, H., Niqui, M.: Constructive reals in coq: Axioms and categoricity. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol.\u00a02277, pp. 79\u201395. Springer, Heidelberg (2002)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/LICS.2001.932488","volume-title":"Proc. of 16th Ann. IEEE Symp. on Logic in Computer Science, LICS 2001","author":"M. Escard\u00f3","year":"2001","unstructured":"Escard\u00f3, M., Simpson, A.: A universal characterization of the closed euclidean interval (extended abstract). In: Proc. of 16th Ann. IEEE Symp. on Logic in Computer Science, LICS 2001, pp. 115\u2013125. IEEE Comput. Soc. Press, Los Alamitos (2001)"},{"key":"6_CR18","unstructured":"Paulin-Mohring, C.: A library for reasoning on randomized algorithms in Coq: description of a Coq contribution, Univ. Paris Sud (2006), \n                    \n                      http:\/\/www.lri.fr\/~paulin\/ALEA\/library.pdf"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45685-6_16","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Hurd","year":"2002","unstructured":"Hurd, J.: A formal approach to probabilistic termination. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 230\u2013245. Springer, Heidelberg (2002)"},{"issue":"4","key":"6_CR20","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1017\/S095679680200446X","volume":"13","author":"J.C. Filli\u00e2tre","year":"2003","unstructured":"Filli\u00e2tre, J.C.: Verification of non-functional programs using interpretations in type theory. J. of Funct. Program.\u00a013(4), 709\u2013745 (2003)","journal-title":"J. of Funct. Program."},{"key":"6_CR21","unstructured":"Filli\u00e2tre, J.C.: The why verification tool (2002), \n                    \n                      http:\/\/why.lri.fr\/"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:55Z","timestamp":1605643675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11783596_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}