{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:36:58Z","timestamp":1725896218958},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307287"},{"type":"electronic","value":"9783642307294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30729-4_14","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T04:49:46Z","timestamp":1340772586000},"page":"191-205","source":"Crossref","is-referenced-by-count":7,"title":["A UTP Semantics of pGCL as a Homogeneous Relation"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Bresciani","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Butterfield","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Bresciani, R., Butterfield, A.: Towards a UTP-style framework to deal with probabilities. Technical Report TCD-CS-2011-09, FMG, Trinity College Dublin, Ireland (August 2011)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-14521-6_3","volume-title":"Unifying Theories of Programming","year":"2010","unstructured":"Butterfield, A. (ed.): UTP 2008. LNCS, vol.\u00a05713, pp. 22\u201341. Springer, Heidelberg (2010)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-642-05089-3_30","volume-title":"FM 2009: Formal Methods","author":"Y. Chen","year":"2009","unstructured":"Chen, Y., Sanders, J.W.: Unifying Probability with Nondeterminism. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 467\u2013482. Springer, Heidelberg (2009)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. Logical Methods in Computer Science\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:4)2008"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11768173_14","volume-title":"Unifying Theories of Programming","year":"2006","unstructured":"Dunne, S., Stoddart, B. (eds.): UTP 2006. LNCS, vol.\u00a04010, pp. 236\u2013256. Springer, Heidelberg (2006)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Freitas, L., Woodcock, J., Butterfield, A.: Posix and the verification grand challenge: A roadmap. In: 13th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2008, March 31-April 3, pp. 153\u2013162 (2008)","DOI":"10.1109\/ICECCS.2008.35"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-05089-3_29","volume-title":"FM 2009: Formal Methods","author":"P. Gancarski","year":"2009","unstructured":"Gancarski, P., Butterfield, A.: The Denotational Semantics of slotted-Circus. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 451\u2013466. Springer, Heidelberg (2009)"},{"key":"14_CR8","unstructured":"He, J.: A probabilistic BPEL-like language. In: Qin [22], pp. 74\u2013100"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"He, J., Sanders, J.W.: Unifying probability. In: Dunne and Stoddart [5], pp. 173\u2013199","DOI":"10.1007\/11768173_11"},{"issue":"2-3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6423(96)00019-6","volume":"28","author":"J. He","year":"1997","unstructured":"He, J., Seidel, K., McIver, A.: Probabilistic models for the guarded command language. Science of Computer Programming\u00a028(2-3), 171\u2013192 (1997); Formal Specifications: Foundations, Methods, Tools and Applications","journal-title":"Science of Computer Programming"},{"key":"14_CR11","first-page":"141","volume-title":"Proceedings of a Discussion Meeting of the Royal Society of London on Mathematical Logic and Programming Languages","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Programs are predicates. In: Proceedings of a Discussion Meeting of the Royal Society of London on Mathematical Logic and Programming Languages, pp. 141\u2013155. Prentice-Hall, Upper Saddle River (1985)"},{"key":"14_CR12","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall International Series in Computer Science (1998)"},{"issue":"3","key":"14_CR13","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. Comput. Syst. Sci.\u00a022(3), 328\u2013350 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(85)90012-1","volume":"30","author":"D. Kozen","year":"1985","unstructured":"Kozen, D.: A probabilistic pdl. J. Comput. Syst. Sci.\u00a030(2), 162\u2013178 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR15","volume-title":"Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)","author":"A. McIver","year":"2004","unstructured":"McIver, A., Morgan, C.: Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science). Springer, Heidelberg (2004)"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1059816.1059824","volume":"32","author":"A. McIver","year":"2005","unstructured":"McIver, A., Morgan, C.: Abstraction and refinement in probabilistic systems. SIGMETRICS Performance Evaluation Review\u00a032(4), 41\u201347 (2005)","journal-title":"SIGMETRICS Performance Evaluation Review"},{"key":"14_CR17","unstructured":"Morgan, C., McIver, A.: A probabilistic temporal calculus based on expectations. Technical Report PRG-TR-13-97, Oxford University Computing Laboratory (1997)"},{"issue":"6","key":"14_CR18","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/BF01213492","volume":"8","author":"C. Morgan","year":"1996","unstructured":"Morgan, C., McIver, A., Seidel, K., Sanders, J.W.: Refinement-oriented probability for CSP. Formal Asp. Comput.\u00a08(6), 617\u2013647 (1996)","journal-title":"Formal Asp. Comput."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Ndukwu, U., McIver, A.: An expectation transformer approach to predicate abstraction and data independence for probabilistic programs. CoRR (2010)","DOI":"10.4204\/EPTCS.28.9"},{"key":"14_CR20","series-title":"CRPIT","first-page":"35","volume-title":"Fifteenth Computing: The Australasian Theory Symposium (CATS 2009)","author":"U. Ndukwu","year":"2009","unstructured":"Ndukwu, U., Sanders, J.W.: Reasoning about a distributed probabilistic system. In: Downey, R., Manyem, P. (eds.) Fifteenth Computing: The Australasian Theory Symposium (CATS 2009). CRPIT, vol.\u00a094, pp. 35\u201342. ACS, Wellington (2009)"},{"issue":"1-2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00165-007-0052-5","volume":"21","author":"M. Oliveira","year":"2009","unstructured":"Oliveira, M., Cavalcanti, A., Woodcock, J.: A UTP semantics for Circus. Formal Asp. Comput.\u00a021(1-2), 3\u201332 (2009)","journal-title":"Formal Asp. Comput."},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-16690-7_9","volume-title":"Unifying Theories of Programming","year":"2010","unstructured":"Qin, S. (ed.): UTP 2010. LNCS, vol.\u00a06445, pp. 188\u2013206. Springer, Heidelberg (2010)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-36103-0_62","volume-title":"Formal Methods and Software Engineering","author":"A. Sherif","year":"2002","unstructured":"Sherif, A., Kleinberg, R.D.: Towards a Time Model for Circus. In: George, C.W., Miao, H. (eds.) ICFEM 2002. LNCS, vol.\u00a02495, pp. 613\u2013624. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30729-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:28:53Z","timestamp":1620113333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30729-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307287","9783642307294"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30729-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}