{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:51Z","timestamp":1740099531364,"version":"3.37.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030310370"},{"type":"electronic","value":"9783030310387"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31038-7_8","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T19:03:06Z","timestamp":1569178986000},"page":"157-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Inner and Outer Algebras of Unified Concurrency"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2337-2101","authenticated-orcid":false,"given":"Andrew","family":"Butterfield","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-54430-5_84","volume-title":"CONCUR \u201991","author":"FS Boer de","year":"1991","unstructured":"de Boer, F.S., Kok, J.N., Palamidessi, C., Rutten, J.J.M.M.: The failure of failures in a paradigm for asynchronous communication. In: Baeten, J.C.M., Groote, J.F. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 111\u2013126. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3-540-54430-5_84"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1006\/inco.1996.0056","volume":"127","author":"SD Brookes","year":"1996","unstructured":"Brookes, S.D.: Full abstraction for a shared-variable parallel language. Inf. Comput. 127(2), 145\u2013163 (1996). \n                      https:\/\/doi.org\/10.1006\/inco.1996.0056","journal-title":"Inf. Comput."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-16690-7_6","volume-title":"Unifying Theories of Programming","author":"A Butterfield","year":"2010","unstructured":"Butterfield, A.: Saoith\u00edn: a theorem prover for UTP. In: Qin, S. (ed.) UTP 2010. LNCS, vol. 6445, pp. 137\u2013156. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16690-7_6"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-35705-3_6","volume-title":"Unifying Theories of Programming","author":"A Butterfield","year":"2013","unstructured":"Butterfield, A.: The logic of U\n                      \n                        \n                      \n                      $$\\cdot $$\n                    (TP)\n                      \n                        \n                      \n                      $$^{2}$$\n                    . In: Wolff, B., Gaudel, M.-C., Feliachi, A. (eds.) UTP 2012. LNCS, vol. 7681, pp. 124\u2013143. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-35705-3_6"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-52228-9_10","volume-title":"Unifying Theories of Programming","author":"A Butterfield","year":"2017","unstructured":"Butterfield, A.: UTPCalc\u2014a calculator for UTP predicates. In: Bowen, J.P., Zhu, H. (eds.) UTP 2016. LNCS, vol. 10134, pp. 197\u2013216. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-52228-9_10"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-70848-5_16","volume-title":"Formal Methods: Foundations and Applications","author":"A Butterfield","year":"2017","unstructured":"Butterfield, A.: UTCP: compositional semantics for shared-variable concurrency. In: Cavalheiro, S., Fiadeiro, J. (eds.) SBMF 2017. LNCS, vol. 10623, pp. 253\u2013270. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-70848-5_16"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-73210-5_5","volume-title":"Integrated Formal Methods","author":"A Butterfield","year":"2007","unstructured":"Butterfield, A., Sherif, A., Woodcock, J.: Slotted-circus. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol. 4591, pp. 75\u201397. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-73210-5_5"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Calcagno, C., O\u2019Hearn, P.W., Yang, H.: Local action and abstract separation logic. In: Proceedings of 22nd IEEE Symposium on Logic in Computer Science, LICS 2007, Wroclaw, Poland, 10\u201312 July 2007, pp. 366\u2013378. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.30"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/2480359.2429104","volume":"48","author":"Thomas Dinsdale-Young","year":"2013","unstructured":"Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M.J., Yang, H.: Views: compositional reasoning for concurrent programs. In: Giacobazzi, R., Cousot, R. (eds.) The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, 23\u201325 January 2013, pp. 287\u2013300. ACM (2013). \n                      https:\/\/doi.org\/10.1145\/2480359.2429104","journal-title":"ACM SIGPLAN Notices"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ipl.2018.02.017","volume":"135","author":"S Foster","year":"2018","unstructured":"Foster, S., Cavalcanti, A., Woodcock, J., Zeyda, F.: Unifying theories of time with generalised reactive processes. Inf. Process. Lett. 135, 47\u201352 (2018). \n                      https:\/\/doi.org\/10.1016\/j.ipl.2018.02.017","journal-title":"Inf. Process. Lett."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-030-02149-8_13","volume-title":"Relational and Algebraic Methods in Computer Science","author":"S Foster","year":"2018","unstructured":"Foster, S., Ye, K., Cavalcanti, A., Woodcock, J.: Calculational verification of reactive programs with reactive relations and Kleene algebra. In: Desharnais, J., Guttmann, W., Joosten, S. (eds.) RAMiCS 2018. LNCS, vol. 11194, pp. 205\u2013224. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-02149-8_13"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-14806-9_2","volume-title":"Unifying Theories of Programming","author":"S Foster","year":"2015","unstructured":"Foster, S., Zeyda, F., Woodcock, J.: Isabelle\/UTP: a mechanised theory engineering framework. In: Naumann, D. (ed.) UTP 2014. LNCS, vol. 8963, pp. 21\u201341. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-14806-9_2"},{"key":"8_CR13","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. 5850, pp. 451\u2013466. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-05089-3_29"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-14808-8_7","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2010","author":"P Gancarski","year":"2010","unstructured":"Gancarski, P., Butterfield, A.: Prioritized slotted-Circus. In: Cavalcanti, A., Deharbe, D., Gaudel, M.-C., Woodcock, J. (eds.) ICTAC 2010. LNCS, vol. 6255, pp. 91\u2013105. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14808-8_7"},{"key":"8_CR15","volume-title":"Unifying Theories of Programming","author":"CAR Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Upper Saddle River (1998)"},{"issue":"6","key":"8_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"Tony Hoare","year":"2011","unstructured":"Hoare, C.A.R., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. J. Logic Algebraic Program. 80(6), 266\u2013296 (2011). \n                      https:\/\/doi.org\/10.1016\/j.jlap.2011.04.005\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1567832611000166\n                      \n                    . Relations and Kleene Algebras in Computer Science","journal-title":"The Journal of Logic and Algebraic Programming"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"CB Jones","year":"1983","unstructured":"Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4), 596\u2013619 (1983). \n                      https:\/\/doi.org\/10.1145\/69575.69577","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR18","series-title":"NATO ASI Series (Series F: Computer and Systems Sciences)","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-82453-1_4","volume-title":"Logics and Models of Concurrent Systems","author":"L Lamport","year":"1985","unstructured":"Lamport, L.: An axiomatic semantics of concurrent programming languages. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 13, pp. 77\u2013122. Springer, Heidelberg (1985). \n                      https:\/\/doi.org\/10.1007\/978-3-642-82453-1_4"},{"issue":"1\u20132","key":"8_CR19","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 Aspects Comput. 21(1\u20132), 3\u201332 (2009). \n                      https:\/\/doi.org\/10.1007\/s00165-007-0052-5","journal-title":"Formal Aspects Comput."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"SS Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Inf. 6, 319\u2013340 (1976). \n                      https:\/\/doi.org\/10.1007\/BF00268134","journal-title":"Acta Inf."},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s13347-018-0312-8","volume":"32","author":"David Pym","year":"2018","unstructured":"Pym, D., Spring, J.M., O\u2019Hearn, P.: Why separation logic works. Philos. Technol. (2018). \n                      https:\/\/doi.org\/10.1007\/s13347-018-0312-8","journal-title":"Philosophy & Technology"},{"key":"8_CR22","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., Jifeng, H.: Towards a time model for Circus. In: George, C., Miao, H. (eds.) ICFEM 2002. LNCS, vol. 2495, pp. 613\u2013624. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-36103-0_62"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-14806-9_4","volume-title":"Unifying Theories of Programming","author":"S Staden","year":"2015","unstructured":"Staden, S.: Constructing the views framework. In: Naumann, D. (ed.) UTP 2014. LNCS, vol. 8963, pp. 62\u201383. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-14806-9_4"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-36103-0_5","volume-title":"Formal Methods and Software Engineering","author":"J Woodcock","year":"2002","unstructured":"Woodcock, J., Hughes, A.: Unifying theories of parallel programming. In: George, C., Miao, H. (eds.) ICFEM 2002. LNCS, vol. 2495, pp. 24\u201337. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-36103-0_5"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00165-014-0309-8","volume":"27","author":"H Zhu","year":"2015","unstructured":"Zhu, H., He, J., Qin, S., Brooke, P.J.: Denotational semantics and its algebraic derivation for an event-driven system-level language. Formal Aspects Comput. 27(1), 133\u2013166 (2015). \n                      https:\/\/doi.org\/10.1007\/s00165-014-0309-8","journal-title":"Formal Aspects Comput."},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-16690-7_15","volume-title":"Unifying Theories of Programming","author":"H Zhu","year":"2010","unstructured":"Zhu, H., Yang, F., He, J.: Generating denotational semantics from algebraic semantics for event-driven system-level language. In: Qin, S. (ed.) UTP 2010. LNCS, vol. 6445, pp. 286\u2013308. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16690-7_15"}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31038-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T19:23:22Z","timestamp":1569180202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31038-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310370","9783030310387"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31038-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UTP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Unifying Theories of Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"utp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.york.ac.uk\/circus\/utp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}