{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:17:53Z","timestamp":1743135473893,"version":"3.40.3"},"publisher-location":"Cham","reference-count":91,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549961"},{"type":"electronic","value":"9783030549978"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-54997-8_3","type":"book-chapter","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:11:50Z","timestamp":1597090310000},"page":"54-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reasoning About Shared-Variable Concurrency: Interactions Between Research Threads"],"prefix":"10.1007","author":[{"given":"Cliff B.","family":"Jones","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"3_CR1","unstructured":"Aczel, P.H.G.: On an inference rule for parallel composition (1983). (Private communication) Manuscript, Manchester"},{"issue":"6","key":"3_CR2","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s00165-019-00501-3","volume":"31","author":"K Apt","year":"2019","unstructured":"Apt, K., Olderog, E.R.: Fifty years of Hoare\u2019s logic. Formal Aspects Comput. 31(6), 751\u2013807 (2019)","journal-title":"Formal Aspects Comput."},{"issue":"4","key":"3_CR3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"KR Apt","year":"1981","unstructured":"Apt, K.R.: Ten years of Hoare\u2019s logic: a survey\u2013part I. ACM Trans. Program. Lang. Syst. 3(4), 431\u2013483 (1981)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1\u20132","key":"3_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(83)90066-X","volume":"28","author":"KR Apt","year":"1983","unstructured":"Apt, K.R.: Ten years of Hoare\u2019s logic: a survey\u2013part II: nondeterminism. Theoret. Comput. Sci. 28(1\u20132), 83\u2013109 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR5","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4376-0","volume-title":"Verification of Sequential and Concurrent Programs","author":"KR Apt","year":"1991","unstructured":"Apt, K.R., Olderog, E.R.: Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer, New York (1991). https:\/\/doi.org\/10.1007\/978-1-4757-4376-0"},{"key":"3_CR6","unstructured":"Ashcroft, E.A., Manna, Z.: Formalization of properties of parallel programs. Technical report AIM-110, Stanford Artificial Intelligence Project, February 1970. Published as [7]"},{"key":"3_CR7","first-page":"17","volume-title":"Machine Intelligence","author":"EA Ashcroft","year":"1971","unstructured":"Ashcroft, E.A., Manna, Z.: Formalization of Properties of Parallel Programs. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 6, pp. 17\u201341. Edinburgh University Press, Edinburgh (1971)"},{"issue":"1","key":"3_CR8","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0022-0000(75)80018-3","volume":"10","author":"EA Ashcroft","year":"1975","unstructured":"Ashcroft, E.A.: Proving assertions about parallel programs. J. Comput. Syst. Sci. 10(1), 110\u2013135 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"JCM Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge University Press, Cambridge (1990)"},{"key":"3_CR10","series-title":"Prentice Hall International Series in Computer Science","volume-title":"Principles of Concurrent and Distributed Programming","author":"M Ben-Ari","year":"1990","unstructured":"Ben-Ari, M.: Principles of Concurrent and Distributed Programming. Prentice Hall International Series in Computer Science. Prentice Hall, Upper Saddle River (1990)"},{"key":"3_CR11","series-title":"Monographs in Theoretical Computer Science An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04457-5","volume-title":"Petri Net Algebra","author":"E Best","year":"2001","unstructured":"Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Monographs in Theoretical Computer Science An EATCS Series. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04457-5"},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00165-009-0141-8","volume":"22","author":"R Bornat","year":"2010","unstructured":"Bornat, R., Amjad, H.: Inter-process buffers in separation logic with rely-guarantee. Formal Aspects Comput. 22(6), 735\u2013772 (2010). https:\/\/doi.org\/10.1007\/s00165-009-0141-8","journal-title":"Formal Aspects Comput."},{"issue":"6","key":"3_CR13","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1007\/s00165-011-0213-4","volume":"25","author":"R Bornat","year":"2013","unstructured":"Bornat, R., Amjad, H.: Explanation of two non-blocking shared-variable communication algorithms. Formal Aspects Comput. 25(6), 893\u2013931 (2013)","journal-title":"Formal Aspects Comput."},{"issue":"3","key":"3_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2984450.2984457","volume":"3","author":"S Brookes","year":"2016","unstructured":"Brookes, S., O\u2019Hearn, P.W.: Concurrent separation logic. ACM SIGLOG News 3(3), 47\u201365 (2016)","journal-title":"ACM SIGLOG News"},{"key":"3_CR15","unstructured":"Burton, J.I., Jones, C.B.: Atomicity in system design and execution. J. Univ. Comput. Sci. 11(5), 634\u2013635 (2005). http:\/\/www.jucs.org\/jucs_11_5\/atomicity_in_system_design\/managing.html"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of Model Checking","author":"EM Clarke","year":"2018","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R.: Handbook of Model Checking, vol. 10. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8"},{"issue":"3","key":"3_CR17","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BF00288686","volume":"1","author":"M Clint","year":"1972","unstructured":"Clint, M., Hoare, C.A.R.: Program proving: jumps and functions. Acta Informatica 1(3), 214\u2013224 (1972)","journal-title":"Acta Informatica"},{"key":"3_CR18","unstructured":"Coleman, J.W., Jones, C.B.: Atomicity: a unifying concept in computer science. J. Univ. Comput. Sci. 13(8), 1042\u20131043 (2007). https:\/\/eprints.ncl.ac.uk\/file_store\/production\/161042\/DCEAA1B2-B87B-4B2D-8227-31DAE51FC776.pdf"},{"key":"3_CR19","unstructured":"Coleman, J.W.: Constructing a tractable reasoning framework upon a fine-grained structural operational semantics. Ph.D. thesis, Newcastle University School of Computer Science, January 2008"},{"key":"3_CR20","volume-title":"Concurrency Verification: Introduction to Compositional and Noncompositional Methods","author":"WP De Roever","year":"2001","unstructured":"De Roever, W.P., et al.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge University Press, Cambridge (2001)"},{"issue":"6","key":"3_CR21","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s00165-019-00500-4","volume":"31","author":"N Dershowitz","year":"2019","unstructured":"Dershowitz, N., Waldinger, R.: Zohar Manna (1939\u20132018). Formal Aspects Comput. 31(6), 643\u2013660 (2019)","journal-title":"Formal Aspects Comput."},{"key":"3_CR22","unstructured":"Dingel, J.: Systematic parallel programming. Ph.D. thesis, Carnegie Mellon University (2000). cMU-CS-99-172"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M., Yang, H.: Views: compositional reasoning for concurrent programs. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 287\u2013300. ACM (2013)","DOI":"10.1145\/2480359.2429104"},{"issue":"8","key":"3_CR24","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/3338112","volume":"62","author":"D Distefano","year":"2019","unstructured":"Distefano, D., F\u00e4hndrich, M., Logozzo, F., O\u2019Hearn, P.W.: Scaling static analyses at Facebook. CACM 62(8), 62\u201370 (2019)","journal-title":"CACM"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-00590-9_26","volume-title":"Programming Languages and Systems","author":"M Dodds","year":"2009","unstructured":"Dodds, M., Feng, X., Parkinson, M., Vafeiadis, V.: Deny-guarantee reasoning. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 363\u2013377. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_26"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Feng, X.: Local rely-guarantee reasoning. In: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, New York, NY, USA, pp. 315\u2013327. ACM (2009). https:\/\/doi.org\/10.1145\/1480881.1480922","DOI":"10.1145\/1480881.1480922"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-71316-6_13","volume-title":"Programming Languages and Systems","author":"X Feng","year":"2007","unstructured":"Feng, X., Ferreira, R., Shao, Z.: On the relationship between concurrent separation logic and assume-guarantee reasoning. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 173\u2013188. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_13"},{"key":"3_CR28","doi-asserted-by":"crossref","DOI":"10.1002\/9781119991472","volume-title":"An Introduction to Practical Formal Methods Using Temporal Logic","author":"M Fisher","year":"2011","unstructured":"Fisher, M.: An Introduction to Practical Formal Methods Using Temporal Logic. Wiley, Chichester (2011)"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Assigning meanings to programs. In: Proceedings of Symposium in Applied Mathematics. Mathematical Aspects of Computer Science, vol. 19, pp. 19\u201332. American Mathematical Society (1967)","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"3_CR30","unstructured":"Goldstine, H.H., von Neumann, J.: Planning and coding of problems for an electronic computing instrument. Technical report, Institute of Advanced Studies, Princeton (1947)"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-319-30734-3_16","volume-title":"Theory and Practice of Formal Methods","author":"S de Gouw","year":"2016","unstructured":"de Gouw, S., Rot, J.: Effectively eliminating auxiliaries. In: \u00c1brah\u00e1m, E., Bonsangue, M., Johnsen, E.B. (eds.) Theory and Practice of Formal Methods. LNCS, vol. 9660, pp. 226\u2013241. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30734-3_16"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-02928-9_1","volume-title":"Engineering Trustworthy Software Systems","author":"IJ Hayes","year":"2018","unstructured":"Hayes, I.J., Jones, C.B.: A guide to rely\/guarantee thinking. In: Bowen, J.P., Liu, Z., Zhang, Z. (eds.) SETSS 2017. LNCS, vol. 11174, pp. 1\u201338. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02928-9_1"},{"issue":"10","key":"3_CR33","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"3_CR34","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/BFb0059696","volume-title":"Symposium on Semantics of Algorithmic Languages","author":"CAR Hoare","year":"1971","unstructured":"Hoare, C.A.R.: Procedures and parameters: an axiomatic approach. In: Engeler, E. (ed.) Symposium on Semantics of Algorithmic Languages. LNM, vol. 188, pp. 102\u2013116. Springer, Heidelberg (1971). https:\/\/doi.org\/10.1007\/BFb0059696"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.: Proof of a program: FIND. Commun. ACM 14(1), 39\u201345 (1971). https:\/\/doi.org\/10.1145\/362452.362489","DOI":"10.1145\/362452.362489"},{"key":"3_CR36","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21, 666\u2013677 (1978)","journal-title":"Commun. ACM"},{"key":"3_CR37","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)"},{"issue":"2","key":"3_CR38","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00264034","volume":"3","author":"CAR Hoare","year":"1974","unstructured":"Hoare, C.A.R., Lauer, P.E.: Consistent and complementary formal theories of the semantics of programming languages. Acta Informatica 3(2), 135\u2013153 (1974). https:\/\/doi.org\/10.1007\/BF00264034","journal-title":"Acta Informatica"},{"key":"3_CR39","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-1-4757-3472-0_6","volume-title":"The Origin of Concurrent Programming","author":"CAR Hoare","year":"1972","unstructured":"Hoare, C.A.R.: Towards a theory of parallel programming. In: Hansen, P.B. (ed.) The Origin of Concurrent Programming, pp. 231\u2013244. Springer, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4757-3472-0_6"},{"issue":"1","key":"3_CR40","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/942578.807083","volume":"7","author":"CB Jones","year":"1972","unstructured":"Jones, C.B.: Formal development of correct algorithms: an example based on Earley\u2019s recogniser. SIGPLAN Notices 7(1), 150\u2013169 (1972)","journal-title":"SIGPLAN Notices"},{"key":"3_CR41","unstructured":"Jones, C.B.: Operations and formal development. Technical report TN 9004, IBM Laboratory, Hursley, September 1972"},{"key":"3_CR42","unstructured":"Jones, C.B.: Software Development: A Rigorous Approach. Prentice Hall International, Englewood Cliffs (1980). http:\/\/portal.acm.org\/citation.cfm?id=539771"},{"key":"3_CR43","unstructured":"Jones, C.B.: Development methods for computer programs including a notion of interference. Ph.D. thesis, Oxford University, June 1981. Printed as: Programming Research Group, Technical Monograph 25"},{"key":"3_CR44","unstructured":"Jones, C.B.: Specification and design of (parallel) programs. In: Proceedings of IFIP 1983, North-Holland, pp. 321\u2013332 (1983)"},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Jones, C.B.: Tentative steps toward a development method for interfering programs. Trans. Program. Lang. Syst. 5(4), 596\u2013619 (1983). https:\/\/doi.org\/10.1145\/69575.69577 . https:\/\/doi.acm.org\/10.1145\/69575.69577","DOI":"10.1145\/69575.69577"},{"issue":"2","key":"3_CR46","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00122417","volume":"8","author":"CB Jones","year":"1996","unstructured":"Jones, C.B.: Accommodating interference in the formal design of concurrent object-based programs. Formal Methods Syst. Des. 8(2), 105\u2013122 (1996). https:\/\/doi.org\/10.1007\/BF00122417","journal-title":"Formal Methods Syst. Des."},{"issue":"1\u20133","key":"3_CR47","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2006.12.029","volume":"375","author":"CB Jones","year":"2007","unstructured":"Jones, C.B.: Splitting atoms safely. Theoret. Comput. Sci. 375(1\u20133), 109\u2013119 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2006.12.029","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Jones, C.B., Lomet, D., Romanovsky, A., Weikum, G.: The atomic manifesto. J. Univ. Comput. Sci. 11(5), 636\u2013650 (2005). https:\/\/doi.org\/10.3217\/jucs-011-05-0636 . http:\/\/www.jucs.org\/jucs_11_5\/the_atomic_manifesto","DOI":"10.3217\/jucs-011-05-0636"},{"key":"3_CR49","doi-asserted-by":"publisher","unstructured":"Jones, C.B.: The early search for tractable ways of reasoning about programs. IEEE Ann. Hist. Comput. 25(2), 26\u201349 (2003). https:\/\/doi.org\/10.1109\/MAHC.2003.1203057 . https:\/\/doi.ieeecomputer.society.org\/10.1109\/MAHC.2003.1203057","DOI":"10.1109\/MAHC.2003.1203057"},{"key":"3_CR50","unstructured":"Jones, C.B., Astarte, T.K.: An Exegesis of four formal descriptions of ALGOL 60. Technical report CS-TR-1498, Newcastle University School of Computer Science, September 2016"},{"key":"3_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2016.01.002","author":"CB Jones","year":"2016","unstructured":"Jones, C.B., Hayes, I.J.: Possible values: exploring a concept for concurrency. J. Log. Algebr. Methods Program. (2016). https:\/\/doi.org\/10.1016\/j.jlamp.2016.01.002","journal-title":"J. Log. Algebr. Methods Program."},{"key":"3_CR52","doi-asserted-by":"publisher","unstructured":"Jones, C.B., Pierce, K.G.: Splitting atoms with rely\/guarantee conditions coupled with data reification. In: B\u00f6rger, E., Butler, M., Bowen, J.P., Boca, P. (eds.) ABZ 2008. LNCS, vol. 5238, pp. 360\u2013377. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87603-8_47 . http:\/\/www.springerlink.com\/content\/d63746175654u503\/fulltext.pdf","DOI":"10.1007\/978-3-540-87603-8_47"},{"key":"3_CR53","doi-asserted-by":"publisher","unstructured":"Jones, C.B., Pierce, K.G.: Elucidating concurrent algorithms via layers of abstraction and reification. Formal Aspects Comput. 23(3), 289\u2013306 (2011). https:\/\/doi.org\/10.1007\/s00165-010-0156-1 . http:\/\/www.springerlink.com\/content\/e52509k41r31g880\/","DOI":"10.1007\/s00165-010-0156-1"},{"key":"3_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-22969-0_1","volume-title":"Software Engineering and Formal Methods","author":"CB Jones","year":"2015","unstructured":"Jones, C.B., Yatapanage, N.: Reasoning about separation using abstraction and reification. In: Calinescu, R., Rumpe, B. (eds.) SEFM 2015. LNCS, vol. 9276, pp. 3\u201319. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22969-0_1"},{"key":"3_CR55","doi-asserted-by":"publisher","unstructured":"Jones, C.B., Yatapanage, N.: Investigating the limits of rely\/guarantee relations based on a concurrent garbage collector example. Formal Aspects Comput. 31(3), 353\u2013374 (2019). https:\/\/doi.org\/10.1007\/s00165-019-00482-3 . Online April 2018","DOI":"10.1007\/s00165-019-00482-3"},{"key":"3_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-47666-6_25","volume-title":"Automata, Languages, and Programming","author":"O Lahav","year":"2015","unstructured":"Lahav, O., Vafeiadis, V.: Owicki-Gries reasoning for weak memory models. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 311\u2013323. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_25"},{"key":"3_CR57","volume-title":"Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers","author":"L Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley Longman Publishing Co., Inc., Boston (2002)"},{"key":"3_CR58","unstructured":"Liang, H.: Refinement verification of concurrent programs and its applications. Ph.D. thesis, USTC, China (2014)"},{"key":"3_CR59","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0066-4138(69)90005-6","volume":"6","author":"P Lucas","year":"1969","unstructured":"Lucas, P., Walk, K.: On the formal description of PL\/I. Ann. Rev. Autom. Program. 6, 105\u2013182 (1969)","journal-title":"Ann. Rev. Autom. Program."},{"key":"3_CR60","volume-title":"State Models and Java Programs","author":"J Magee","year":"1999","unstructured":"Magee, J., Kramer, J.: State Models and Java Programs. Wiley, Hoboken (1999)"},{"key":"3_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"Temporal Logic of Reactive Systems","author":"Z Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: Temporal Logic of Reactive Systems. Springer, New York (1991). https:\/\/doi.org\/10.1007\/978-1-4612-0931-7"},{"key":"3_CR62","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems","author":"Z Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4612-4222-2"},{"issue":"1\u20132","key":"3_CR63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(70)90002-0","volume":"1","author":"Z Manna","year":"1970","unstructured":"Manna, Z.: The correctness of nondeterministic programs. Artif. Intell. 1(1\u20132), 1\u201326 (1970)","journal-title":"Artif. Intell."},{"key":"3_CR64","unstructured":"Middelburg, C.A.: Syntax and semantics of VVSL: a language for structured VDM specifications. Ph.D. thesis, PTT Research, Leidschendam, Department of Applied Computer Science, September 1990"},{"key":"3_CR65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inf. Comput. 100, 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"3_CR66","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle Rive (1989)"},{"key":"3_CR67","volume-title":"Programming from Specifications","author":"C Morgan","year":"1990","unstructured":"Morgan, C.: Programming from Specifications. Prentice-Hall, Upper Saddle River (1990)"},{"key":"3_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-15670-4_6","volume-title":"Seminar on Concurrency","author":"B Moszkowski","year":"1985","unstructured":"Moszkowski, B.: Executing temporal logic programs. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.) CONCURRENCY 1984. LNCS, vol. 197, pp. 111\u2013130. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-15670-4_6"},{"issue":"4","key":"3_CR69","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/BF01966091","volume":"6","author":"P Naur","year":"1966","unstructured":"Naur, P.: Proof of algorithms by general snapshots. BIT Numer. Math. 6(4), 310\u2013316 (1966)","journal-title":"BIT Numer. Math."},{"issue":"1\u20133","key":"3_CR70","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.tcs.2006.12.035","volume":"375","author":"PW O\u2019Hearn","year":"2007","unstructured":"O\u2019Hearn, P.W.: Resources, concurrency and local reasoning. Theoret. Comput. Sci. 375(1\u20133), 271\u2013307 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR71","volume-title":"Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship","author":"ER Olderog","year":"2005","unstructured":"Olderog, E.R.: Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship, vol. 23. Cambridge University Press, Cambridge (2005)"},{"key":"3_CR72","unstructured":"Owicki, S.S.: Axiomatic proof techniques for parallel programs. Ph.D. thesis, Department of Computer Science, Cornell University (1975). Published as technical report 75\u2013251"},{"key":"3_CR73","doi-asserted-by":"crossref","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 Informatica 6, 319\u2013340 (1976)","journal-title":"Acta Informatica"},{"key":"3_CR74","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-15057-9_12","volume-title":"Verified Software: Theories, Tools, Experiments","author":"M Parkinson","year":"2010","unstructured":"Parkinson, M.: The next 700 separation logics. In: Leavens, G.T., O\u2019Hearn, P., Rajamani, S.K. (eds.) VSTTE 2010. LNCS, vol. 6217, pp. 169\u2013182. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15057-9_12"},{"key":"3_CR75","unstructured":"Pierce, K.: Enhancing the useability of rely-guaranteee conditions for atomicity refinement. Ph.D. thesis, Newcastle University (2009)"},{"key":"3_CR76","unstructured":"Prensa Nieto, L.: Verification of parallel programs with the Owicki-Gries and rely-guarantee methods in Isabelle\/HOL. Ph.D. thesis, Institut f\u00fcr Informatic der Technischen Universit\u00e4t M\u00fcnchen (2001)"},{"key":"3_CR77","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"2012","unstructured":"Reisig, W.: Petri Nets: An Introduction, vol. 4. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"key":"3_CR78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33278-4","volume-title":"Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies","author":"W Reisig","year":"2013","unstructured":"Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-33278-4"},{"key":"3_CR79","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of 17th LICS, pp. 55\u201374. IEEE (2002)"},{"key":"3_CR80","volume-title":"Data Refinement: Model-Oriented Proof Methods and Their Comparison","author":"WP de Roever","year":"1999","unstructured":"de Roever, W.P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and Their Comparison. Cambridge University Press, Cambridge (1999)"},{"key":"3_CR81","volume-title":"The $$\\pi $$-calculus: A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"issue":"1\u20133","key":"3_CR82","doi-asserted-by":"crossref","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."},{"key":"3_CR83","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1830-2","volume-title":"On Concurrent Programming","author":"FB Schneider","year":"1997","unstructured":"Schneider, F.B.: On Concurrent Programming. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-1-4612-1830-2"},{"key":"3_CR84","volume-title":"Formal Language Description Languages for Computer Programming","author":"TB Steel","year":"1966","unstructured":"Steel, T.B.: Formal Language Description Languages for Computer Programming. North-Holland, Vienna (1966)"},{"key":"3_CR85","unstructured":"St\u00f8len, K.: Development of parallel programs on shared data-structures. Ph.D. thesis, Manchester University (1990). Published as technical report UMCS-91-1-1"},{"key":"3_CR86","unstructured":"Turing, A.M.: Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines, pp. 67\u201369. University Mathematical Laboratory, Cambridge, June 1949"},{"key":"3_CR87","unstructured":"Vafeiadis, V.: Modular fine-grained concurrency verification. Ph.D. thesis, University of Cambridge (2007)"},{"key":"3_CR88","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-74407-8_18","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"V Vafeiadis","year":"2007","unstructured":"Vafeiadis, V., Parkinson, M.: A marriage of rely\/guarantee and separation logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 256\u2013271. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74407-8_18"},{"issue":"1","key":"3_CR89","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/BF01939551","volume":"6","author":"A van Wijngaarden","year":"1966","unstructured":"van Wijngaarden, A.: Numerical analysis as an independent science. BIT Numer. Math. 6(1), 66\u201381 (1966)","journal-title":"BIT Numer. Math."},{"key":"3_CR90","unstructured":"Windsor, M.: Starling: a framework for automated concurrency verification. Ph.D. thesis, University of York (2019)"},{"key":"3_CR91","unstructured":"Xu, Q.: A theory of state-based parallel programming. Ph.D. thesis, Oxford University (1992)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54997-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,28]],"date-time":"2021-03-28T03:51:29Z","timestamp":1616903489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54997-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549961","9783030549978"],"references-count":91,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54997-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","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":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=84","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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)"}}]}}