{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:11:48Z","timestamp":1743120708079,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031666728"},{"type":"electronic","value":"9783031666735"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-66673-5_4","type":"book-chapter","created":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:04:18Z","timestamp":1725451458000},"page":"56-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Relational Basis of\u00a0Early R\/G Work"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0196-4229","authenticated-orcid":false,"given":"Jos\u00e9 N.","family":"Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,4]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aarts, C., Backhouse, R.C., Hoogendijk, P., Voermans, E., van\u00a0der Woude, J.: A relational theory of datatypes, Deceber 1992. http:\/\/www.cs.nott.ac.uk\/~rcb","DOI":"10.1007\/3-540-57499-9_15"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/BFb0022462","volume-title":"Semantics of Concurrent Computation","author":"JR Abrial","year":"1979","unstructured":"Abrial, J.R., Schuman, S.A.: Non-deterministic system specification. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol. 70, pp. 34\u201350. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/BFb0022462"},{"key":"4_CR3","unstructured":"Backhouse, R.C.: Mathematics of Program Construction. Unpublished book draft, 608 p. University of Nottingham (2004). http:\/\/www.cs.nott.ac.uk\/~rcb"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Berghammer, R., Neumann, F.: RelView - an OBDD-based computer algebra system for relations. In: CASC\u201905, pp. 40\u201351 (2005). https:\/\/doi.org\/10.1007\/11555964_4","DOI":"10.1007\/11555964_4"},{"key":"4_CR5","unstructured":"Bird, R., de\u00a0Moor, O.:\u00a0Algebra of Programming. Prentice Hall Europe (1997). ISBN 978-0-13-507245-5"},{"key":"4_CR6","unstructured":"de\u00a0Bakker, J., de\u00a0Roever, W.P.: A calculus for recursive program schemes. Stichting Mathematisch Centrum Technical report 131\/72, Amsterdam (1972). https:\/\/ir.cwi.nl\/pub\/9145"},{"key":"4_CR7","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976). ISBN 0-13-215871-X"},{"key":"4_CR8","unstructured":"Dijkstra, E.W.: Indirect equality enriched (2001). Technical note EWD 1315-0"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Feferman, S.: Tarski\u2019s influence on computer science. Log. Methods Comput. Sci. 2(1), 1\u201313 (2006). https:\/\/doi.org\/10.2168\/LMCS-2(3:6)2006","DOI":"10.2168\/LMCS-2(3:6)2006"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Floyd, R.W.: Assigning meanings to programs. In: Schwartz, J.T. (ed.) Mathematical Aspects of Computer Science, vol. 19, pp. 19\u201332. AMS (1967). https:\/\/doi.org\/10.1090\/psapm\/019","DOI":"10.1090\/psapm\/019"},{"key":"4_CR11","unstructured":"Freyd, P.J., Scedrov, A.: Categories, Allegories. Mathematical Library, vol. 39. North-Holland (1990). ISBN 9780444703682"},{"issue":"1\u20132","key":"4_CR12","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0304-3975(99)00343-6","volume":"254","author":"MF Frias","year":"2001","unstructured":"Frias, M.F., Maddux, R.D.: Completeness of a relational calculus for program schemes. Theor. Comput. Sci. 254(1\u20132), 543\u2013556 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00343-6","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11784180_14","volume-title":"Algebraic Methodology and Software Technology","author":"WL Harrison","year":"2006","unstructured":"Harrison, W.L.: The essence of multitasking. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 158\u2013172. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11784180_14"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1017\/S0960129510000551","volume":"21","author":"I Hasuo","year":"2011","unstructured":"Hasuo, I., Jacobs, B.: Traces for coalgebraic components. MSCS 21, 267\u2013320 (2011). https:\/\/doi.org\/10.1017\/S0960129510000551","journal-title":"MSCS"},{"issue":"6","key":"4_CR15","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. FAoC 28(6), 1057\u20131078 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0384-0","journal-title":"FAoC"},{"key":"4_CR16","unstructured":"Hayes, I.J., Jones, C.B., Colvin, R.J.: Refining rely-guarantee thinking. Technical report CS-TR-1334, Newcastle University (2012)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-031-40436-8_5","volume-title":"Theories of Programming and Formal Methods","author":"IJ Hayes","year":"2023","unstructured":"Hayes, I.J., Jones, C.B., Meinicke, L.A.: Specifying and reasoning about shared-variable concurrency. In: Bowen, J.P., Li, Q., Xu, Q. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 14080, pp. 110\u2013135. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40436-8_5"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. CACM 12(10), 576\u2013580, 583 (1969). https:\/\/doi.org\/10.1145\/363235.363259","DOI":"10.1145\/363235.363259"},{"key":"4_CR19","unstructured":"ISO: ISO\/IEC 13568:2002. Information Technology\u2014Z Formal Specification Notation: Syntax, Type System and Semantics, 196 p. (2002). https:\/\/www.iso.org\/standard\/21573.html. Accessed 1 July 2002"},{"key":"4_CR20","unstructured":"Jackson, D.: Software Abstractions: Logic, Language, and Analysis, Revised edn. The MIT Press, Cambridge (2012). ISBN 0-262-01715-2"},{"key":"4_CR21","unstructured":"Jones, C.B.: Software Development\u2014A Rigorous Approach. Prentice-Hall, London (1980). ISBN 0138218846"},{"key":"4_CR22","unstructured":"Jones, C.B.: Development Methods for Computer Programs including a Notion of Interference. Ph.D. thesis, Oxford University, June 1981. Printed as: PRG, Tech. Monograph 25. http:\/\/www.cs.ox.ac.uk\/files\/9025\/PRG-25.pdf"},{"key":"4_CR23","unstructured":"Jones, C.B.: Interference resumed. Technical report UMCS-91-5-1, Department of Computer Science, U. Manchester, May 1991"},{"key":"4_CR24","unstructured":"Jones, C.B.: Interference resumed. In: Bailes, P. (ed.) Engineering Safe Software, pp. 31\u201356. Australian Computer Society (1991). http:\/\/search.informit.com.au\/documentSummary;dn=546299491532331;res=IELENG"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MAHC.2003.1203057","volume":"25","author":"CB Jones","year":"2003","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","journal-title":"IEEE Ann. Hist. Comput."},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00165-014-0310-2","volume":"27","author":"CB Jones","year":"2015","unstructured":"Jones, C.B., Hayes, I.J., Colvin, R.J.: Balancing expressiveness in formal approaches to concurrency. FAoC 27(3), 475\u2013497 (2015). https:\/\/doi.org\/10.1007\/s00165-014-0310-2","journal-title":"FAoC"},{"key":"4_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4721-8","volume-title":"Categories for the Working Mathematician","author":"S MacLane","year":"1971","unstructured":"MacLane, S.: Categories for the Working Mathematician. Springer, New York (1971). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Milner, R.: Processes: a mathematical model of computing agents. In: Logic Colloq.\u201973, pp. 157\u2013173. North-Holland (1975). ISBN 0444106421","DOI":"10.1016\/S0049-237X(08)71948-7"},{"issue":"3","key":"4_CR29","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/44501.44503","volume":"10","author":"C Morgan","year":"1988","unstructured":"Morgan, C.: The specification statement. ACM ToPLAS 10(3), 403\u2013419 (1988). https:\/\/doi.org\/10.1145\/44501.44503","journal-title":"ACM ToPLAS"},{"issue":"2\u20133","key":"4_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6423(90)90024-8","volume":"14","author":"C Morgan","year":"1990","unstructured":"Morgan, C., Vickers, T.: Types and invariants in the refinement calculus. Sci. Comput. Program. 14(2\u20133), 281\u2013304 (1990). https:\/\/doi.org\/10.1016\/0167-6423(90)90024-8","journal-title":"Sci. Comput. Program."},{"issue":"6","key":"4_CR31","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.jlap.2012.05.003","volume":"81","author":"S-C Mu","year":"2012","unstructured":"Mu, S.-C., Oliveira, J.N.: Programming from Galois connections. JLAP 81(6), 680\u2013704 (2012). https:\/\/doi.org\/10.1016\/j.jlap.2012.05.003","journal-title":"JLAP"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-03153-3_5","volume-title":"Language Engineering and Rigorous Software Development","author":"JN Oliveira","year":"2009","unstructured":"Oliveira, J.N.: Extended static checking by calculation using the pointfree transform. In: Bove, A., Barbosa, L.S., Pardo, A., Pinto, J.S. (eds.) LerNet 2008. LNCS, vol. 5520, pp. 195\u2013251. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03153-3_5"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-031-43345-0_2","volume-title":"WADT 2022","author":"JN Oliveira","year":"2023","unstructured":"Oliveira, J.N.: Why adjunctions matter\u2014a functional programmer perspective. In: Madeira, A., Martins, M.A. (eds.) WADT 2022. Lecture Notes in Computer Science, vol. 13710, pp. 25\u201359. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43345-0_2"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/3-540-10007-5_47","volume-title":"Abstract Software Specifications","author":"D Park","year":"1980","unstructured":"Park, D.: On the semantics of fair parallelism. In: Bj\u00f8orner, D. (ed.) Abstract Software Specifications. LNCS, vol. 86, pp. 504\u2013526. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10007-5_47"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.entcs.2014.10.015","volume":"308","author":"M Pir\u00f3g","year":"2014","unstructured":"Pir\u00f3g, M., Gibbons, J.: The coinductive resumption monad. ENTCS 308, 273\u2013288 (2014). https:\/\/doi.org\/10.1016\/j.entcs.2014.10.015","journal-title":"ENTCS"},{"issue":"3","key":"4_CR36","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G Plotkin","year":"1976","unstructured":"Plotkin, G.: A powerdomain construction. SIAM J. Comput. 5(3), 452\u2013489 (1976). https:\/\/doi.org\/10.1137\/0205035","journal-title":"SIAM J. Comput."},{"key":"4_CR37","unstructured":"Schmidt, G.: Relational Mathematics"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"Staden, S.: On rely-guarantee reasoning. In: MPC 2015, pp. 30\u201349 (2015). https:\/\/doi.org\/10.1007\/978-3-319-19797-5_2","DOI":"10.1007\/978-3-319-19797-5_2"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Tarski, A., Givant, S.: A Formalization of Set Theory without Variables. AMS, vol. 41. AMS Colloquium Publications (1987). ISBN 0821810413","DOI":"10.1090\/coll\/041"},{"key":"4_CR40","unstructured":"Wirth, N.: Algorithms + Data Structures = Programs. Prentice-Hall, Hoboken (1976). ISBN 978-0-13-022418-7"},{"issue":"2","key":"4_CR41","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01211617","volume":"9","author":"Q Xu","year":"1997","unstructured":"Xu, Q., de Roever, W.-P., He, J.: The rely-guarantee method for verifying shared variable concurrent programs. FAoC 9(2), 149\u2013174 (1997). https:\/\/doi.org\/10.1007\/BF01211617","journal-title":"FAoC"}],"container-title":["Lecture Notes in Computer Science","The Practice of Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66673-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:07:22Z","timestamp":1725451642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66673-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031666728","9783031666735"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66673-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"4 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}