{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:32Z","timestamp":1780994492279,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642288685","type":"print"},{"value":"9783642288692","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28869-2_9","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:44:36Z","timestamp":1332449076000},"page":"169-193","source":"Crossref","is-referenced-by-count":64,"title":["Probabilistic Abstract Interpretation"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Cousot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Monerau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Camporesi, F., Feret, J., Koeppl, H., Petrov, T.: Automatic reduction of stochastic rules-based models in a nutshell. Amer. Inst. of Physics, AIP\u00a01281(2) (2010)","DOI":"10.1063\/1.3497965"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-85361-9_23","volume-title":"CONCUR 2008 - Concurrency Theory","author":"R. Chadha","year":"2008","unstructured":"Chadha, R., Viswanathan, M., Viswanathan, R.: Least Upper Bounds for Probability Measures and Their Applications to Abstractions. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 264\u2013278. Springer, Heidelberg (2008)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Coletta, A., Gori, R., Levi, F.: Approximating probabilistic behaviors of biological systems using abstract interpretation \u00a0229(1), 165\u2013182 (2009)","DOI":"10.1016\/j.entcs.2009.02.011"},{"issue":"1-2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(00)00313-3","volume":"277","author":"P. Cousot","year":"2002","unstructured":"Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. TCS\u00a0277(1-2), 47\u2013103 (2002)","journal-title":"TCS"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL, pp. 269\u2013282 (1979)","DOI":"10.1145\/567752.567778"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Logic and Comp.\u00a02(4), 511\u2013547 (1992)","journal-title":"J. Logic and Comp."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Programming Language Implementation and Logic Programming","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois Connection and Widening\/Narrowing Approaches to Abstract Interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, pp. 269\u2013295. Springer, Heidelberg (1992)"},{"issue":"3","key":"9_CR9","first-page":"229","volume":"35","author":"P. Cousot","year":"2009","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Rival, X.: Why does Astr\u00e9e scale up? FMSD\u00a035(3), 229\u2013264 (2009)","journal-title":"FMSD"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45605-8_5","volume-title":"Process Algebra and Probabilistic Methods. Performance Modeling and Verification","author":"P.R. D\u2019Argenio","year":"2002","unstructured":"D\u2019Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and Refinement Strategies for Probabilistic Analysis. In: Hermanns, H., Segala, R. (eds.) PAPM-PROBMIV 2002. LNCS, vol.\u00a02399, pp. 57\u201376. Springer, Heidelberg (2002)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-21455-4_3","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"V. Forejt","year":"2011","unstructured":"Forejt, V., Kwiatkowska, M., Norman, G., Parker, D.: Automated Verification Techniques for Probabilistic Systems. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol.\u00a06659, pp. 53\u2013113. Springer, Heidelberg (2011)"},{"issue":"5","key":"9_CR12","first-page":"512","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. FAC\u00a06(5), 512\u2013535 (1994)","journal-title":"FAC"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-27764-4_10","volume-title":"Mathematics of Program Construction","author":"E. Hehner","year":"2004","unstructured":"Hehner, E.: Probabilistic Predicative Programming. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 169\u2013185. Springer, Heidelberg (2004)"},{"issue":"4","key":"9_CR14","first-page":"391","volume":"23","author":"E. Hehner","year":"2011","unstructured":"Hehner, E.: A probability perspective. FAC\u00a023(4), 391\u2013419 (2011)","journal-title":"FAC"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-15769-1_24","volume-title":"Static Analysis","author":"J.-P. Katoen","year":"2010","unstructured":"Katoen, J.-P., McIver, A.K., Meinicke, L.A., Morgan, C.C.: Linear-Invariant Generation for Probabilistic Programs: Automated Support for Proof-Based Methods. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol.\u00a06337, pp. 390\u2013406. Springer, Heidelberg (2010)"},{"key":"9_CR16","volume-title":"Probability Theory: A Comprehensive Course","author":"A. Klenke","year":"2007","unstructured":"Klenke, A.: Probability Theory: A Comprehensive Course. Springer, Heidelberg (2007)"},{"key":"9_CR17","first-page":"328","volume":"22","author":"D. Kozen","year":"1981","unstructured":"Kozen, D.: Semantics of probabilistic programs. JCSS\u00a022, 328\u2013350 (1981)","journal-title":"JCSS"},{"issue":"4","key":"9_CR18","first-page":"14","volume":"35","author":"M. Kwiatkowska","year":"2008","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Using probabilistic model checking in systems biology. PER\u00a035(4), 14\u201321 (2008)","journal-title":"PER"},{"key":"9_CR19","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"A. McIver","year":"2005","unstructured":"McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer, Heidelberg (2005)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Meyn, S.: Control Techniques for Complex Networks. CUP (2007)","DOI":"10.1017\/CBO9780511804410"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-45099-3_17","volume-title":"Static Analysis","author":"D. Monniaux","year":"2000","unstructured":"Monniaux, D.: Abstract Interpretation of Probabilistic Semantics. In: SAS 2000. LNCS, vol.\u00a01824, pp. 322\u2013340. Springer, Heidelberg (2000)"},{"issue":"1\u20132","key":"9_CR22","first-page":"179","volume":"58","author":"D. Monniaux","year":"2005","unstructured":"Monniaux, D.: Abstract interpretation of programs as Markov decision processes. SCP\u00a058(1\u20132), 179\u2013205 (2005)","journal-title":"SCP"},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C. Morgan","year":"1996","unstructured":"Morgan, C., McIver, A., Seidel, K., Sanders, J.: Probabilistic predicate transformers. TOPLAS\u00a018(3), 325\u2013353 (1996)","journal-title":"TOPLAS"},{"issue":"2","key":"9_CR24","first-page":"159","volume":"15","author":"A. Pierro Di","year":"2005","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Probabilistic lambda-calculus and quantitative program analysis. JLC\u00a015(2), 159\u2013179 (2005)","journal-title":"JLC"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Wiklicky, H.: Concurrent constraint programming: towards probabilistic abstract interpretation. In: PPDP, pp. 127\u2013138. ACM (2000)","DOI":"10.1145\/351268.351284"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45605-8_15","volume-title":"Process Algebra and Probabilistic Methods. Performance Modeling and Verification","author":"A. Pierro Di","year":"2002","unstructured":"Di Pierro, A., Wiklicky, H.: Probabilistic Abstract Interpretation and Statistical Testing (Extended Abstract). In: Hermanns, H., Segala, R. (eds.) PAPM-PROBMIV 2002. LNCS, vol.\u00a02399, pp. 211\u2013212. Springer, Heidelberg (2002)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Roy, P., Parker, D., Norman, G., de Alfaro, L.: Symbolic magnifying lens abstraction in Markov decision processes. In: QEST 2008, pp. 103\u2013112. IEEE (2008)","DOI":"10.1109\/QEST.2008.41"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Smith, M.: Probabilistic abstract interpretation of imperative programs using truncated normal distributions 220(3), 43\u201359 (2008)","DOI":"10.1016\/j.entcs.2008.11.018"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-11319-2_26","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B. Wachter","year":"2010","unstructured":"Wachter, B., Zhang, L.: Best Probabilistic Transformers. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol.\u00a05944, pp. 362\u2013379. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28869-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:13:45Z","timestamp":1620126825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28869-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288685","9783642288692"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28869-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}