{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:12:43Z","timestamp":1725732763971},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44124-4_2","type":"book-chapter","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T15:20:39Z","timestamp":1408461639000},"page":"10-32","source":"Crossref","is-referenced-by-count":4,"title":["Generic Weakest Precondition Semantics from Monads Enriched with Order"],"prefix":"10.1007","author":[{"given":"Ichiro","family":"Hasuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-0021-0","volume-title":"Toposes, Triples and Theories","author":"M Barr","year":"1985","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Berlin (1985)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45694-5_25","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S Cattani","year":"2002","unstructured":"Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"2_CR3","unstructured":"Cheung, L.: Reconciling nondeterministic and probabilistic choices. Ph.D. thesis, Radboud Univ. Nijmegen (2006)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-54830-7_28","volume-title":"Foundations of Software Science and Computation Structures","author":"C C\u00eerstea","year":"2014","unstructured":"C\u00eerstea, C.: A coalgebraic approach to linear-time logics. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol. 8412, pp. 426\u2013440. Springer, Heidelberg (2014)"},{"key":"2_CR5","volume-title":"A Discipline of Programming","author":"EW Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Upper Saddle River (1976)"},{"issue":"10","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1007\/BF02283036","volume":"24","author":"DJ Foulis","year":"1994","unstructured":"Foulis, D.J., Bennett, M.K.: Effect algebras and unsharp quantum logics. Found. Physics 24(10), 1331\u20131352 (1994)","journal-title":"Found. Physics"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Giry, M.: A categorical approach to probability theory. In: Proceedings of the Categorical Aspects of Topology and Analysis. Lecture Notes in Mathematics, vol. 915, pp. 68\u201385 (1982)","DOI":"10.1007\/BFb0092872"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.entcs.2004.02.028","volume":"106","author":"HH Hansen","year":"2004","unstructured":"Hansen, H.H., Kupke, C.: A coalgebraic perspective on monotone modal logic. Electr. Notes Theor. Comput. Sci. 106, 121\u2013143 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-5(2:2)2009","volume":"5","author":"HH Hansen","year":"2009","unstructured":"Hansen, H.H., Kupke, C., Pacuit, E.: Neighbourhood structures: Bisimilarity and basic model theory. Log. Methods Comput. Sci. 5(2), 1\u201332 (2009)","journal-title":"Log. Methods Comput. Sci."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-15375-4_31","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I Hasuo","year":"2010","unstructured":"Hasuo, I.: Generic forward and backward simulations II: probabilistic simulation. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 447\u2013461. Springer, Heidelberg (2010)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Hoshino, N.: Semantics of higher-order quantum computation via geometry of interaction. In: LICS. pp. 237\u2013246. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.26"},{"issue":"4:11","key":"2_CR13","first-page":"1","volume":"3","author":"I Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4:11), 1\u201336 (2007)","journal-title":"Log. Methods Comput. Sci."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM, 12, 576\u2013580, 583 (1969)","DOI":"10.1145\/363235.363259"},{"key":"2_CR15","volume-title":"Categorical Logic and Type Theory","author":"B Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. North Holland, Amsterdam (1999)"},{"key":"2_CR16","unstructured":"Jacobs, B.: New directions in categorical logic, for classical, probabilistic and quantum logic. http:\/\/arxiv.org\/abs\/1205.3940"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Measurable spaces and their effect logic. In: LICS. pp. 83\u201392. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.13"},{"key":"2_CR18","unstructured":"Jones, C.: Probabilistic non-determinism. Ph.D. thesis, Univ. Edinburgh (1990)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.ic.2012.10.014","volume":"222","author":"S Katsumata","year":"2013","unstructured":"Katsumata, S.: Relating computational effects by $$\\top \\top $$ -lifting. Inf. Comput. 222, 228\u2013246 (2013)","journal-title":"Inf. Comput."},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-37075-5_10","volume-title":"Foundations of Software Science and Computation Structures","author":"S Katsumata","year":"2013","unstructured":"Katsumata, S., Sato, T.: Preorders on monads and coalgebraic simulations. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol. 7794, pp. 145\u2013160. Springer, Heidelberg (2013)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-03741-2_7","volume-title":"Algebra and Coalgebra in Computer Science","author":"C Kissig","year":"2009","unstructured":"Kissig, C., Venema, Y.: Complementation of coalgebra automata. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 81\u201396. Springer, Heidelberg (2009)"},{"key":"2_CR23","unstructured":"Kock, A.: Monads and extensive quantities (2011). arXiv:1103.6009"},{"issue":"3","key":"2_CR24","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. 22(3), 328\u2013350 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"38","key":"2_CR25","doi-asserted-by":"publisher","first-page":"5070","DOI":"10.1016\/j.tcs.2011.04.023","volume":"412","author":"C Kupke","year":"2011","unstructured":"Kupke, C., Pattinson, D.: Coalgebraic semantics of modal logics: an overview. Theor. Comput. Sci. 412(38), 5070\u20135094 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(4:10)2008","volume":"4","author":"C Kupke","year":"2008","unstructured":"Kupke, C., Venema, Y.: Coalgebraic automata theory: basic results. Log. Methods Comput. Sci. 4(4), 1\u201343 (2008)","journal-title":"Log. Methods Comput. Sci."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45187-7_14","volume-title":"CONCUR 2003 - Concurrency Theory","author":"NA Lynch","year":"2003","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Compositionality for probabilistic automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 208\u2013221. Springer, Heidelberg (2003)"},{"key":"2_CR28","volume-title":"Categories for the Working Mathematician","author":"S Lane","year":"1998","unstructured":"Lane, S.: Categories for the Working Mathematician, 2nd edn. Springer, Berlin (1998)","edition":"2"},{"issue":"1","key":"2_CR29","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. Inf. Comp. 93(1), 55\u201392 (1991)","journal-title":"Inf. Comp."},{"key":"2_CR30","volume-title":"Programming from Specifications","author":"C Morgan","year":"1990","unstructured":"Morgan, C.: Programming from Specifications. Prentice-Hall, London (1990)"},{"issue":"3","key":"2_CR31","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.: Probabilistic predicate transformers. ACM Trans. Program. Lang. Syst. 18(3), 325\u2013353 (1996)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45315-6_1","volume-title":"Foundations of Software Science and Computation Structures","author":"G Plotkin","year":"2001","unstructured":"Plotkin, G., Power, J.: Adequacy for algebraic effects. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 1\u201324. Springer, Heidelberg (2001)"},{"key":"2_CR33","unstructured":"Sokolova, A.: Coalgebraic analysis of probabilistic systems. Ph.D. thesis, Techn. Univ. Eindhoven (2005)"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.entcs.2004.06.063","volume":"129","author":"R Tix","year":"2005","unstructured":"Tix, R., Keimel, K., Plotkin, G.D.: Semantic domains for combining probability and non-determinism. Elect. Notes Theor. Comput. Sci. 129, 1\u2013104 (2005)","journal-title":"Elect. Notes Theor. Comput. Sci."},{"issue":"1","key":"2_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1017\/S0960129505005074","volume":"16","author":"D Varacca","year":"2006","unstructured":"Varacca, D., Winskel, G.: Distributing probabililty over nondeterminism. Math. Struct. Comp. Sci. 16(1), 87\u2013113 (2006)","journal-title":"Math. Struct. Comp. Sci."},{"key":"2_CR36","unstructured":"Venema, Y., Kissig, C.: Game bisimulations between basic positions. Talk at Highlights of Logic, Games and Automata, Paris (2013)"},{"key":"2_CR37","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages","author":"G Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages. MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44124-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T13:27:19Z","timestamp":1598189239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44124-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44124-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}