{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:17:02Z","timestamp":1784837822784,"version":"3.55.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319431437","type":"print"},{"value":"9783319431444","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43144-4_30","type":"book-chapter","created":{"date-parts":[[2016,8,6]],"date-time":"2016-08-06T00:24:16Z","timestamp":1470443056000},"page":"475-482","source":"Crossref","is-referenced-by-count":10,"title":["Formalising Semantics for Expected Running Time of Probabilistic Programs"],"prefix":"10.1007","author":[{"given":"Johannes","family":"H\u00f6lzl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,7]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. Sci. Comput. Prog. 74(8), 568\u2013589 (2009)","DOI":"10.1016\/j.scico.2007.09.002"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Cock, D.: Verifying probabilistic correctness in Isabelle with pGCL. In: SSV 2012. EPTCS, vol. 102, pp. 167\u2013178 (2012)","DOI":"10.4204\/EPTCS.102.15"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.peva.2013.11.004","volume":"73","author":"F Gretz","year":"2014","unstructured":"Gretz, F., Katoen, J., McIver, A.: Operational versus weakest pre-expectation semantics for the probabilistic guarded command language. Perform. Eval. 73, 110\u2013132 (2014)","journal-title":"Perform. Eval."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"H\u00f6lzl, J.: Markov chains and Markov decision processes in Isabelle\/HOL. Submitted to JAR in December 2015. http:\/\/in.tum.de\/~hoelzl\/mdptheory","DOI":"10.1007\/s10817-016-9401-5"},{"key":"30_CR5","unstructured":"H\u00f6lzl, J.: Construction and Stochastic Applications of Measure Spaces in Higher-Order Logic. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2013)"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"H\u00f6lzl, J., Nipkow, T.: Interactive verification of Markov chains: two distributed protocol case studies. In: QFM 2012. EPTCS, vol. 103 (2012)","DOI":"10.4204\/EPTCS.103.2"},{"key":"30_CR7","unstructured":"Hurd, J.: Formal Verification of Probabilistic Algorithms. Ph.D. thesis (2002)"},{"issue":"1","key":"30_CR8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tcs.2005.08.005","volume":"346","author":"J Hurd","year":"2005","unstructured":"Hurd, J., McIver, A., Morgan, C.: Probabilistic guarded commands mechanized in HOL. Theoret. Comput. Sci. 346(1), 96\u2013112 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-662-49498-1_15","volume-title":"Programming Languages and Systems","author":"BL Kaminski","year":"2016","unstructured":"Kaminski, B.L., Katoen, J.-P., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected run\u2013times of probabilistic programs. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 364\u2013389. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49498-1_15"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Kaminski, B.L., Katoen, J., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected run-times of probabilistic programs. CoRR abs\/1601.01001v1 (Extended version) (2016)","DOI":"10.1007\/978-3-662-49498-1_15"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-49498-1_20","volume-title":"Programming Languages and Systems","author":"A Lochbihler","year":"2016","unstructured":"Lochbihler, A.: Probabilistic functions and cryptographic oracles in higher order logic. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 503\u2013531. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49498-1_20"},{"key":"30_CR12","unstructured":"McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43144-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T03:37:38Z","timestamp":1568259458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43144-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319431437","9783319431444"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43144-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}