{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T09:05:21Z","timestamp":1726045521129},"publisher-location":"Cham","reference-count":40,"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_4","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T19:03:06Z","timestamp":1569178986000},"page":"62-79","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connecting Fixpoints of Computations with Strict Progress"],"prefix":"10.1007","author":[{"given":"Walter","family":"Guttmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(94)00195-5","volume":"53","author":"CJ Aarts","year":"1995","unstructured":"Aarts, C.J., et al.: Fixed-point calculus. Inf. Process. Lett. 53(3), 131\u2013136 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2016-1321","volume":"144","author":"A Alexandru","year":"2016","unstructured":"Alexandru, A., Ciobanu, G.: Abstract interpretations in the framework of invariant sets. Fundamenta Informaticae 144(1), 1\u201322 (2016)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s002360050163","volume":"36","author":"RJR Back","year":"1999","unstructured":"Back, R.J.R., von Wright, J.: Reasoning algebraically about loops. Acta Inf. 36(4), 295\u2013334 (1999)","journal-title":"Acta Inf."},{"key":"4_CR4","unstructured":"de Bakker, J.W.: Semantics and termination of nondeterministic recursive programs. In: Michaelson, S., Milner, R. (eds.) ICALP 1976, pp. 435\u2013477. Edinburgh University Press (1976)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BFb0014683","volume-title":"Program Construction","author":"M Broy","year":"1979","unstructured":"Broy, M., Gnatz, R., Wirsing, M.: Semantics of nondeterministic and noncontinuous constructs. In: Bauer, F.L., Broy, M. (eds.) Program Construction. LNM, vol. 69, pp. 553\u2013592. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/BFb0014683"},{"key":"4_CR6","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"},{"key":"4_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)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: An abstract interpretation framework for termination. In: POPL 2012, pp. 245\u2013257. ACM (2012)","DOI":"10.1145\/2103621.2103687"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Dunne, S.: Recasting Hoare and He\u2019s Unifying Theory of Programs in the context of general correctness. In: Butterfield, A., Strong, G., Pahl, C. (eds.) 5th Irish Workshop on Formal Methods. Electronic Workshops in Computing. The British Computer Society (2001)","DOI":"10.14236\/ewic\/IWFM2001.1"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-35705-3_7","volume-title":"Unifying Theories of Programming","author":"S Dunne","year":"2013","unstructured":"Dunne, S.: Conscriptions: a new relational model for sequential computations. In: Wolff, B., Gaudel, M.-C., Feliachi, A. (eds.) UTP 2012. LNCS, vol. 7681, pp. 144\u2013163. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35705-3_7"},{"key":"4_CR12","unstructured":"Egli, H.: A mathematical model for non-deterministic computations. Technical report, Forschungsinstitut f\u00fcr Mathematik ETH Z\u00fcrich (1975)"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","volume":"11","author":"M Fitting","year":"1991","unstructured":"Fitting, M.: Bilattices and the semantics of logic programming. J. Logic Program. 11(2), 91\u2013116 (1991)","journal-title":"J. Logic Program."},{"key":"4_CR14","unstructured":"Freyd, P.J., \u0160\u010dedrov, A.: Categories, Allegories, North-Holland Mathematical Library, vol. 39. Elsevier Science Publishers (1990)"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1111\/j.1467-8640.1988.tb00280.x","volume":"4","author":"ML Ginsberg","year":"1988","unstructured":"Ginsberg, M.L.: Multivalued logics: a uniform approach to reasoning in artificial intelligence. Comput. Intell. 4(3), 265\u2013316 (1988)","journal-title":"Comput. Intell."},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6228-2","volume-title":"The Denotational Description of Programming Languages","author":"MJC Gordon","year":"1979","unstructured":"Gordon, M.J.C.: The Denotational Description of Programming Languages. Springer, New York (1979)"},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00236-012-0162-2","volume":"49","author":"W Guttmann","year":"2012","unstructured":"Guttmann, W.: Algebras for iteration and infinite computations. Acta Inf. 49(5), 343\u2013359 (2012)","journal-title":"Acta Inf."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-06251-8_9","volume-title":"Relational and Algebraic Methods in Computer Science","author":"W Guttmann","year":"2014","unstructured":"Guttmann, W.: Extended conscriptions algebraically. In: H\u00f6fner, P., Jipsen, P., Kahl, W., M\u00fcller, M.E. (eds.) RAMICS 2014. LNCS, vol. 8428, pp. 139\u2013156. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06251-8_9"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jlap.2014.02.008","volume":"83","author":"W Guttmann","year":"2014","unstructured":"Guttmann, W.: Multirelations with infinite computations. J. Logical Algebraic Methods Program. 83(2), 194\u2013211 (2014)","journal-title":"J. Logical Algebraic Methods Program."},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.jlamp.2014.08.001","volume":"84","author":"W Guttmann","year":"2015","unstructured":"Guttmann, W.: Infinite executions of lazy and strict computations. J. Logical Algebraic Methods Program. 84(3), 326\u2013340 (2015)","journal-title":"J. Logical Algebraic Methods Program."},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.jlamp.2015.11.009","volume":"85","author":"W Guttmann","year":"2016","unstructured":"Guttmann, W.: An algebraic approach to computations with progress. J. Logical Algebraic Methods Program. 85(4), 520\u2013539 (2016)","journal-title":"J. Logical Algebraic Methods Program."},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jlap.2009.07.002","volume":"79","author":"W Guttmann","year":"2010","unstructured":"Guttmann, W., M\u00f6ller, B.: Normal design algebra. J. Logic Algebraic Program. 79(2), 144\u2013173 (2010)","journal-title":"J. Logic Algebraic Program."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13321-3_12","volume-title":"Mathematics of Program Construction","author":"IJ Hayes","year":"2010","unstructured":"Hayes, I.J., Dunne, S.E., Meinicke, L.: Unifying theories of programming that distinguish nontermination and abort. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol. 6120, pp. 178\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13321-3_12"},{"issue":"11","key":"4_CR24","doi-asserted-by":"publisher","first-page":"2086","DOI":"10.1016\/j.scico.2012.07.010","volume":"78","author":"IJ Hayes","year":"2013","unstructured":"Hayes, I.J., Dunne, S.E., Meinicke, L.A.: Linking unifying theories of program refinement. Sci. Comput. Program. 78(11), 2086\u20132107 (2013)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(89)90175-0","volume":"30","author":"ECR Hehner","year":"1989","unstructured":"Hehner, E.C.R.: Real-time programming. Inf. Process. Lett. 30(1), 51\u201356 (1989)","journal-title":"Inf. Process. Lett."},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-51305-1_3","volume-title":"Mathematics of Program Construction","author":"ECR Hehner","year":"1989","unstructured":"Hehner, E.C.R.: Termination is timing. In: van de Snepscheut, J.L.A. (ed.) MPC 1989. LNCS, vol. 375, pp. 36\u201347. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51305-1_3"},{"key":"4_CR27","unstructured":"Hehner, E.C.R.: Abstractions of time. In: Roscoe, A.W. (ed.) A Classical Mind, chap. 12, pp. 191\u2013210. Prentice Hall (1994)"},{"key":"4_CR28","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall Europe (1998)"},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jlap.2008.08.005","volume":"78","author":"P H\u00f6fner","year":"2009","unstructured":"H\u00f6fner, P., M\u00f6ller, B.: An algebra of hybrid systems. J. Logic Algebraic Program. 78(2), 74\u201397 (2009)","journal-title":"J. Logic Algebraic Program."},{"key":"4_CR30","unstructured":"Kleene, S.C.: Introduction to Metamathematics. North-Holland Publishing Company (1952)"},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"4_CR32","volume-title":"Mathematical Theory of Computation","author":"Z Manna","year":"1974","unstructured":"Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974)"},{"issue":"2","key":"4_CR33","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.scico.2006.01.010","volume":"65","author":"B M\u00f6ller","year":"2007","unstructured":"M\u00f6ller, B.: Kleene getting lazy. Sci. Comput. Program. 65(2), 195\u2013214 (2007)","journal-title":"Sci. Comput. Program."},{"key":"4_CR34","series-title":"Advances in Computing Sciences","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-7091-6510-2_3","volume-title":"Relational Methods in Computer Science","author":"G Schmidt","year":"1997","unstructured":"Schmidt, G., Hattensperger, C., Winter, M.: Heterogeneous relation algebra. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science. ACS, pp. 39\u201353. Springer, Vienna (1997). https:\/\/doi.org\/10.1007\/978-3-7091-6510-2_3"},{"key":"4_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83608-4","volume-title":"Relationen und Graphen","author":"G Schmidt","year":"1989","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relationen und Graphen. Springer, Heidelberg (1989)"},{"key":"4_CR36","unstructured":"Shinwell, M.R.: The fresh approach: functional programming with names and binders. Ph.D. thesis, University of Cambridge (2005). Available as Technical report UCAM-CL-TR-618, Computer Laboratory, University of Cambridge"},{"key":"4_CR37","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"JE Stoy","year":"1977","unstructured":"Stoy, J.E.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge (1977)"},{"issue":"2","key":"4_CR38","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"issue":"3","key":"4_CR39","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/S0022-0000(74)80048-6","volume":"9","author":"Jean Vuillemin","year":"1974","unstructured":"Vuillemin, J.: Correct and optimal implementations of recursion in a simple programming language. Technical report 24, IRIA (1973). Also in J. Comput. Syst. Sci. 9(3), 332\u2013354 (1974)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\u20132","key":"4_CR40","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(1\u20132), 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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T13:55:11Z","timestamp":1575726911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31038-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310370","9783030310387"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31038-7_4","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)"}}]}}