{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:39Z","timestamp":1740099519508,"version":"3.37.3"},"publisher-location":"Cham","reference-count":38,"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_9","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T19:03:06Z","timestamp":1569178986000},"page":"176-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Developing an Algebra for Rely\/Guarantee Concurrency: Design Decisions and Challenges"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3649-392X","authenticated-orcid":false,"given":"Ian J.","family":"Hayes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5272-820X","authenticated-orcid":false,"given":"Larissa A.","family":"Meinicke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"unstructured":"Aczel, P.H.G.: On an inference rule for parallel composition. Private communication to Cliff Jones (1983). http:\/\/homepages.cs.ncl.ac.uk\/cliff.jones\/publications\/MSs\/PHGA-traces.pdf","key":"9_CR1"},{"unstructured":"Back, R.-J.R.: Correctness preserving program refinements: proof theory and applications. Tract 131, Mathematisch Centrum, Amsterdam (1980)","key":"9_CR2"},{"key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement Calculus: A Systematic Introduction","author":"R-JR Back","year":"1998","unstructured":"Back, R.-J.R., von Wright, J.: Refinement Calculus: A Systematic Introduction. Springer, New York (1998)"},{"issue":"1\u20133","key":"9_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2006.12.034","volume":"375","author":"S Brookes","year":"2007","unstructured":"Brookes, S.: A semantics for concurrent separation logic. Theoret. Comput. Sci. 375(1\u20133), 227\u2013270 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/10722010_4","volume-title":"Mathematics of Program Construction","author":"E Cohen","year":"2000","unstructured":"Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45\u201359. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722010_4"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1093\/logcom\/exm030","volume":"17","author":"JW Coleman","year":"2007","unstructured":"Coleman, J.W., Jones, C.B.: A structural proof of the soundness of rely\/guarantee rules. J. Log. Comput. 17(4), 807\u2013841 (2007)","journal-title":"J. Log. Comput."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00165-017-0416-4","volume":"29","author":"RJ Colvin","year":"2016","unstructured":"Colvin, R.J., Hayes, I.J., Meinicke, L.A.: Designing a semantic model for a wide-spectrum language with concurrency. Formal Aspects Comput. 29, 853\u2013875 (2016)","journal-title":"Formal Aspects Comput."},{"key":"9_CR8","volume-title":"Concurrency Verification: Introduction to Compositional and Noncompositional Methods","author":"W-P Roever de","year":"2001","unstructured":"de Roever, W.-P.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge University Press, Cambridge (2001)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"EW Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, nondeterminacy, and a formal derivation of programs. CACM 18, 453\u2013458 (1975)","journal-title":"CACM"},{"key":"9_CR10","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":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s001650200032","volume":"14","author":"J Dingel","year":"2002","unstructured":"Dingel, J.: A refinement calculus for shared-variable parallel and distributed programming. Formal Aspects Comput. 14(2), 123\u2013197 (2002)","journal-title":"Formal Aspects Comput."},{"doi-asserted-by":"crossref","unstructured":"Dongol, B., Hayes, I.J., Meinicke, L.A., Struth, G.: Cylindric kleene lattices for program construction. In: Hutton, G. (ed.) Mathematics of Program Construction 2019. LNCS. Springer, Cham, October 2019 (2019)","key":"9_CR12","DOI":"10.1007\/978-3-030-33636-3_8"},{"issue":"6","key":"9_CR13","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s00165-016-0384-0","volume":"28","author":"IJ Hayes","year":"2016","unstructured":"Hayes, I.J.: Generalised rely-guarantee concurrency: an algebraic foundation. Formal Aspects Comput. 28(6), 1057\u20131078 (2016)","journal-title":"Formal Aspects Comput."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-48989-6_22","volume-title":"FM 2016: Formal Methods","author":"IJ Hayes","year":"2016","unstructured":"Hayes, I.J., Colvin, R.J., Meinicke, L.A., Winter, K., Velykis, A.: An algebra of synchronous atomic steps. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 352\u2013369. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48989-6_22"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-95582-7_13","volume-title":"Formal Methods","author":"IJ Hayes","year":"2018","unstructured":"Hayes, I.J., Meinicke, L.A.: Encoding fairness in a synchronous concurrent program algebra. In: Havelund, K., Peleska, J., Roscoe, B., de Vink, E. (eds.) Formal Methods. Lecture Notes in Computer Science, pp. 222\u2013239. Springer International Publishing, Cham (2018)"},{"doi-asserted-by":"crossref","unstructured":"Hayes, I.J.: Some challenges of specifying concurrent program components. In: Derrick, J., Dongol, B., Reeves, S. (eds.), Proceedings 18th Refinement Workshop, Electronic Proceedings in Theoretical Computer Science, Oxford, UK, 18th July 2018, vol. 282, pp. 10\u201322. Open Publishing Association, October 2018","key":"9_CR16","DOI":"10.4204\/EPTCS.282.0"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00165-018-0464-4","volume":"31","author":"IJ Hayes","year":"2019","unstructured":"Hayes, I.J., Meinicke, L.A., Winter, K., Colvin, R.J.: A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. Formal Aspects Comput. 31(2), 133\u2013163 (2019)","journal-title":"Formal Aspects Comput."},{"key":"9_CR18","series-title":"Studies in logic and the foundations of mathematics","volume-title":"Cylindric Algebras, Part I","author":"L Henkin","year":"1971","unstructured":"Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras, Part I. Studies in logic and the foundations of mathematics, vol. 64. North-Holland Pub. Co., New York (1971)"},{"issue":"10","key":"9_CR19","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580, 583 (1969)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Towards a theory of parallel programming. In: Operating System Techniques, pp. 61\u201371. Academic Press (1972)","key":"9_CR20","DOI":"10.1007\/978-1-4757-3472-0_6"},{"issue":"8","key":"9_CR21","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/27651.27653","volume":"30","author":"CAR Hoare","year":"1987","unstructured":"Hoare, C.A.R., et al.: Laws of programming. Commun. ACM 30(8), 672\u2013686 (1987). Corrigenda: CACM 30(9), 770","journal-title":"Commun. ACM"},{"key":"9_CR22","volume-title":"Unifying Theories of Programming","author":"CAR Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall, London (1998)"},{"issue":"6","key":"9_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"CAR Hoare","year":"2011","unstructured":"Hoare, C.A.R., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. J. Log. Algebr. Program. 80(6), 266\u2013296 (2011)","journal-title":"J. Log. Algebr. Program."},{"unstructured":"Jones, C.B.: Development methods for computer programs including a notion of interference. Ph.D. thesis, Oxford University, June 1981. Available as: Oxford University Computing Laboratory (now Computer Science) Technical Monograph PRG-25","key":"9_CR24"},{"unstructured":"Jones, C.B.: Specification and design of (parallel) programs. In: Proceedings of IFIP 1983, pp. 321\u2013332, North-Holland (1983)","key":"9_CR25"},{"issue":"4","key":"9_CR26","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 ToPLaS 5(4), 596\u2013619 (1983)","journal-title":"ACM ToPLaS"},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Prog. Lang. Sys. 19(3), 427\u2013443 (1997)","journal-title":"ACM Trans. Prog. Lang. Sys."},{"unstructured":"Meinicke, L.A., Hayes, I.J.: Handling localisation in rely\/guarantee concurrency: an algebraic approach. arXiv:1907.04005 [cs.LO] (2019)","key":"9_CR28"},{"key":"9_CR29","volume-title":"Communication and Concurrency","author":"AJRG Milner","year":"1989","unstructured":"Milner, A.J.R.G.: Communication and Concurrency. Prentice-Hall, Upper Saddle River (1989)"},{"issue":"3","key":"9_CR30","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoret. Comput. Sci. 25(3), 267\u2013310 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"9_CR31","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/44501.44503","volume":"10","author":"CC Morgan","year":"1988","unstructured":"Morgan, C.C.: The specification statement. ACM Trans. Prog. Lang. Sys. 10(3), 403\u2013419 (1988)","journal-title":"ACM Trans. Prog. Lang. Sys."},{"key":"9_CR32","volume-title":"Programming from Specifications","author":"CC Morgan","year":"1994","unstructured":"Morgan, C.C.: Programming from Specifications, 2nd edn. Prentice Hall, Upper Saddle River (1994)","edition":"2"},{"issue":"3","key":"9_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0167-6423(87)90011-6","volume":"9","author":"JM Morris","year":"1987","unstructured":"Morris, J.M.: A theoretical basis for stepwise refinement and the programming calculus. Sci. Comput. Program. 9(3), 287\u2013306 (1987)","journal-title":"Sci. Comput. Program."},{"key":"9_CR34","volume-title":"Executing Temporal Logic Programs","author":"BC Moszkowski","year":"1986","unstructured":"Moszkowski, B.C.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)"},{"issue":"7","key":"9_CR35","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.jlap.2010.07.009","volume":"79","author":"C Prisacariu","year":"2010","unstructured":"Prisacariu, C.: Synchronous Kleene algebra. J. Log. Algebr. Program. 79(7), 608\u2013635 (2010)","journal-title":"J. Log. Algebr. Program."},{"issue":"1\u20133","key":"9_CR36","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10472-013-9389-z","volume":"71","author":"G Schellhorn","year":"2014","unstructured":"Schellhorn, G., Tofan, B., Ernst, G., Pf\u00e4hler, J., Reif, W.: RGITL: a temporal logic framework for compositional reasoning about interleaved programs. Ann. Math. Artif. Intell. 71(1\u20133), 131\u2013174 (2014)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"9_CR37","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1093\/comjnl\/20.2.151","volume":"20","author":"J Schwarz","year":"1977","unstructured":"Schwarz, J.: Generic commands\u2013a tool for partial correctness formalisms. Comput. J. 20(2), 151\u2013155 (1977)","journal-title":"Comput. J."},{"key":"9_CR38","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2003.09.002","volume":"51","author":"J Wright von","year":"2004","unstructured":"von Wright, J.: Towards a refinement algebra. Sci. Comput. Program. 51, 23\u201345 (2004)","journal-title":"Sci. Comput. Program."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T13:55:18Z","timestamp":1575726918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31038-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310370","9783030310387"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31038-7_9","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)"}}]}}