{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:25:26Z","timestamp":1759991126987},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540347507"},{"type":"electronic","value":"9783540347521"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11768173_1","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T12:02:49Z","timestamp":1150891369000},"page":"1-17","source":"Crossref","is-referenced-by-count":8,"title":["Retrospective and Prospective for Unifying Theories of Programming"],"prefix":"10.1007","author":[{"given":"Eric","family":"Hehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement Calculus: a Systematic Introduction","author":"R.-J.R. Back","year":"1998","unstructured":"Back, R.-J.R., von Wright, J.: Refinement Calculus: a Systematic Introduction. Springer, Heidelberg (1998)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Caspi, P., Halbwachs, N., Pilaud, D., Plaice, J.A.: LUSTRE: a declarative language for programming synchronous systems. In: 14th ACM Symposium on Principles of Programming Languages, pp. 178\u2013189 (1987)","DOI":"10.1145\/41625.41641"},{"key":"1_CR3","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)"},{"issue":"2-3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-6423(02)00024-2","volume":"43","author":"I.J. Hayes","year":"2002","unstructured":"Hayes, I.J.: Reasoning about real-time repetitions, terminating and nonterminating. Science of Computer Programming\u00a043(2-3), 161\u2013192 (2002)","journal-title":"Science of Computer Programming"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1007\/3-540-48118-4_29","volume-title":"FM\u201999 - Formal Methods","author":"E.C.R. Hehner","year":"1999","unstructured":"Hehner, E.C.R., Gravell, A.M.: Refinement semantics and loop rules. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol.\u00a01709, pp. 1497\u20131510. Springer, Heidelberg (1999)"},{"key":"1_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8596-5","volume-title":"A Practical Theory of Programming","author":"E.C.R. Hehner","year":"1993","unstructured":"Hehner, E.C.R.: A Practical Theory of Programming, 1st edn. Springer, Heidelberg (1993), www.cs.utoronto.ca\/~hehner\/aPToP","edition":"1"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-27764-4_10","volume-title":"Mathematics of Program Construction","author":"E.C.R. Hehner","year":"2004","unstructured":"Hehner, E.C.R.: Probabilistic predicative programming. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 169\u2013185. Springer, Heidelberg (2004)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-51305-1_3","volume-title":"Mathematics of Program Construction","author":"E.C.R. Hehner","year":"1989","unstructured":"Hehner, E.C.R.: Termination is timing. In: van de Snepscheut, J.L.A. (ed.) MPC 1989. LNCS, vol.\u00a0375, pp. 36\u201347. Springer, Heidelberg (1989)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(89)90175-0","volume":"30","author":"E.C.R. Hehner","year":"1989","unstructured":"Hehner, E.C.R.: Real-time programming. Information Processing Letters\u00a030, 51\u201356 (1989)","journal-title":"Information Processing Letters"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00268842","volume":"25","author":"E.C.R. Hehner","year":"1988","unstructured":"Hehner, E.C.R., Malton, A.J.: Termination conventions and comparative semantics. Acta Informatica\u00a025, 1\u201314 (1988)","journal-title":"Acta Informatica"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/69610.357988","volume":"27","author":"E.C.R. Hehner","year":"1984","unstructured":"Hehner, E.C.R.: Predicative programming. Communications ACM\u00a027(2), 134\u2013151 (1984)","journal-title":"Communications ACM"},{"key":"1_CR12","unstructured":"Hehner, E.C.R.: The Logic of Programming. In: Hoare, C.A.R. (ed.). International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1984)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(83)90081-6","volume":"26","author":"E.C.R. Hehner","year":"1983","unstructured":"Hehner, E.C.R., Hoare, C.A.R.: A more complete model of communicating processes. Theoretical Computer Science\u00a026, 105\u2013120 (1983); Also as University of Toronto Technical Report CSRG-134 (September 1981)","journal-title":"Theoretical Computer Science"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00289091","volume":"11","author":"E.C.R. Hehner","year":"1979","unstructured":"Hehner, E.C.R.: Do considered od: a contribution to the programming calculus. Acta Informatica\u00a011, 287\u2013304 (1979)","journal-title":"Acta Informatica"},{"key":"1_CR15","volume-title":"Unifying Theories of Programming","author":"C.A.R. Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)"},{"issue":"10","key":"1_CR16","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. Communications ACM\u00a012(10), 576\u2013580, 583 (1969)","journal-title":"Communications ACM"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"Hoare, C.A.R.: A proof of correctness of data representations. Acta Informatica\u00a01(4), 271\u2013282 (1972)","journal-title":"Acta Informatica"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C.C. Morgan","year":"1996","unstructured":"Morgan, C.C., McIver, A.K., Seidel, K., Sanders, J.W.: Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems\u00a018(3), 325\u2013353 (1996)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11768173_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:46Z","timestamp":1619507566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11768173_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540347507","9783540347521"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11768173_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}