{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:34:50Z","timestamp":1725878090331},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319522272"},{"type":"electronic","value":"9783319522289"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-52228-9_1","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T04:23:43Z","timestamp":1484022223000},"page":"1-25","source":"Crossref","is-referenced-by-count":4,"title":["A Discrete Geometric Model of Concurrent Program Execution"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"M\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony","family":"Hoare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin E.","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10703-012-0161-5","volume":"41","author":"J Alglave","year":"2012","unstructured":"Alglave, J.: A formal hierarchy of weak memory models. Formal Methods Syst. Des. 41(2), 178\u2013210 (2012)","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-319-06410-9_6","volume-title":"FM 2014: Formal Methods","author":"A Armstrong","year":"2014","unstructured":"Armstrong, A., Gomes, V.B.F., Struth, G.: Algebraic principles for rely-guarantee style concurrency verification tools. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 78\u201393. Springer, Cham (2014)"},{"issue":"2","key":"1_CR3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s00165-015-0343-1","volume":"28","author":"A Armstrong","year":"2016","unstructured":"Armstrong, A., Gomes, V.B.F., Struth, G.: Building program construction and verification tools from algebraic principles. Formal Aspects Comput. 28(2), 265\u2013293 (2016)","journal-title":"Formal Aspects Comput."},{"issue":"2","key":"1_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01196091","volume":"30","author":"C Brink","year":"1993","unstructured":"Brink, C.: Power structures. Algebra Univ. 30(2), 177\u2013216 (1993)","journal-title":"Algebra Univ."},{"key":"1_CR5","volume-title":"A Paradigm for Program Semantics: Power Structures and Duality","author":"C Brink","year":"2001","unstructured":"Brink, C., Rewitzky, I.: A Paradigm for Program Semantics: Power Structures and Duality. CSLI Publications, Stanford (2001)"},{"key":"1_CR6","doi-asserted-by":"crossref","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, 227\u2013270 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR7","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"issue":"1","key":"1_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1011227529550","volume":"19","author":"W Damm","year":"2001","unstructured":"Damm, W., Harel, D.: LSCs - breathing life into message sequence charts. Formal Methods Syst. Des. 19(1), 45\u201380 (2001)","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-319-19797-5_7","volume-title":"Mathematics of Program Construction","author":"B Dongol","year":"2015","unstructured":"Dongol, B., Gomes, V.B.F., Struth, G.: A program construction and verification tool for separation logic. In: Hinze, R., Voigtl\u00e4nder, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 137\u2013158. Springer, Cham (2015)"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01988052","volume":"443","author":"N Gautam","year":"1957","unstructured":"Gautam, N.: The validity of equations of complex algebras. Arch. Math. Logik Grundl. Mat. 443, 117\u2013124 (1957)","journal-title":"Arch. Math. Logik Grundl. Mat."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0168-0072(89)90032-8","volume":"44","author":"R Goldblatt","year":"1989","unstructured":"Goldblatt, R.: Varieties of complex algebras. Ann. Pure Appl. Logic 44, 173\u2013242 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR12","unstructured":"Gomes, V.B.F., Struth, G.: Program construction and verification components based on Kleene algebra. Archive of Formal Proofs (2016)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-319-48989-6_19","volume-title":"FM 2016: Formal Methods","author":"VBF Gomes","year":"2016","unstructured":"Gomes, V.B.F., Struth, G.: Modal Kleene algebra applied to program correctness. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 310\u2013325. Springer, Heidelberg (2016)"},{"key":"1_CR14","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)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/978-3-642-23217-6_17","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"CAR Hoare","year":"2011","unstructured":"Hoare, C.A.R., Hussain, A., M\u00f6ller, B., O\u2019Hearn, P.W., Petersen, R.L., Struth, G.: On locality and the exchange law for concurrent processes. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 250\u2013264. Springer, Heidelberg (2011)"},{"key":"1_CR16","unstructured":"Hoare, T., M\u00f6ller, B., M\u00fcller, M.: Tracelets and Specifications. Dept of Informatics, University of Augsburg (2016). No. 2017-01"},{"issue":"6","key":"1_CR17","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"T Hoare","year":"2011","unstructured":"Hoare, T., 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."},{"issue":"4","key":"1_CR18","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.jlamp.2015.09.012","volume":"85","author":"T Hoare","year":"2016","unstructured":"Hoare, T., van Staden, S., M\u00f6ller, B., Struth, G., Zhu, H.: Developments in concurrent Kleene algebra. J. Log. Algebr. Meth. Program. 85(4), 617\u2013636 (2016)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"1_CR19","unstructured":"Horn, A., Alglave, J.: Concurrent Kleene Algebra of partial strings. arXiv.org , July 2014"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Main, M.: A powerdomain primer \u2013 a tutorial for the bulletin of the EATCS 33. Technical report CU-CS-375-87 (1987). Paper 360, Univ. Colorado at Boulder, Dept of Computer Science (1987). http:\/\/scholar.colorado.edu\/csci_techreports\/360","DOI":"10.21236\/ADA462121"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Isabelle\/HOL \u2013 A Proof Assistant for Higher-Order Logic","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL \u2013 A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)"},{"issue":"3","key":"1_CR22","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.jlamp.2014.08.002","volume":"84","author":"PW O\u2019Hearn","year":"2015","unstructured":"O\u2019Hearn, P.W., Petersen, R.L., Villard, J., Hussain, A.: On the relation between concurrent separation logic and concurrent Kleene algebra. J. Log. Algebr. Meth. Program. 84(3), 285\u2013302 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"1_CR23","unstructured":"Petri, C.A.: Communication with automata. Technical report RADC TR 65-377, RADC, Research and Technology Division, New York (1966)"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(85)90037-4","volume":"36","author":"G Winskel","year":"1985","unstructured":"Winskel, G.: On power domains and modality. Theoret. Comput. Sci. 36, 127\u2013137 (1985)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52228-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T09:56:50Z","timestamp":1568714210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52228-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319522272","9783319522289"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52228-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}