{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:03:32Z","timestamp":1725563012058},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148071"},{"type":"electronic","value":"9783642148088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14808-8_1","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T09:52:01Z","timestamp":1282384321000},"page":"1-14","source":"Crossref","is-referenced-by-count":1,"title":["Invariants and Well-Foundedness in Program Algebra"],"prefix":"10.1007","author":[{"given":"Ian J.","family":"Hayes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book: Assigning Programs to Meanings","author":"J.-R. Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"1_CR2","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_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s002360050163","volume":"36","author":"R.-J.R. Back","year":"1999","unstructured":"Back, R.-J.R., von Wright, J.: Reasoning algebraically about loops. Acta Informatica\u00a036, 295\u2013334 (1999)","journal-title":"Acta Informatica"},{"key":"1_CR4","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.\u00a01837, pp. 45\u201359. Springer, Heidelberg (2000)"},{"key":"1_CR5","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Boca Raton (1971)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-14521-6_5","volume-title":"Unifying Theories of Programming 2008","author":"S.E. Dunne","year":"2010","unstructured":"Dunne, S.E., Hayes, I.J., Galloway, A.J.: Reasoning about loops in total and general correctness. In: Butterfield, A. (ed.) UTP 2008. LNCS, vol.\u00a05713, pp. 62\u201381. Springer, Heidelberg (2010)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/APSEC.2000.896678","volume-title":"Proceedings 7th Asia-Pacific Software Engineering Conference (APSEC 2000)","author":"I.J. Hayes","year":"2000","unstructured":"Hayes, I.J.: Reasoning about real-time programs using idle-invariant assertions. In: Dong, J.S., He, J., Purvis, M. (eds.) Proceedings 7th Asia-Pacific Software Engineering Conference (APSEC 2000), pp. 16\u201323. IEEE Computer Society, Los Alamitos (2000)"},{"issue":"2-3","key":"1_CR8","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_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-0-387-21798-7_6","volume-title":"Programming Methodology","author":"I.J. Hayes","year":"2003","unstructured":"Hayes, I.J.: A predicative semantics for real-time refinement. In: McIver, A., Morgan, C.C. (eds.) Programming Methodology, pp. 109\u2013133. Springer, Heidelberg (2003)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11768173_9","volume-title":"Unifying Theories of Programming","author":"I.J. Hayes","year":"2006","unstructured":"Hayes, I.J.: Termination of real-time programs: definitely, definitely not or maybe. In: Dunne, S.E., Stoddart, W.J. (eds.) UTP 2006. LNCS, vol.\u00a04010, pp. 141\u2013154. Springer, Heidelberg (2006)"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/PL00013311","volume":"37","author":"I.J. Hayes","year":"2001","unstructured":"Hayes, I.J., Utting, M.: A sequential real-time refinement calculus. Acta Informatica\u00a037(6), 385\u2013448 (2001)","journal-title":"Acta Informatica"},{"key":"1_CR12","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 (MPC)","author":"I.J. 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.\u00a06120, pp. 178\u2013194. Springer, Heidelberg (2010)"},{"key":"1_CR13","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)"},{"key":"1_CR14","volume-title":"Systematic Software Development Using VDM","author":"C.B. Jones","year":"1990","unstructured":"Jones, C.B.: Systematic Software Development Using VDM, 2nd edn. Prentice-Hall, Englewood Cliffs (1990)","edition":"2"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1999","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems\u00a019, 427\u2013443 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR16","volume-title":"Programming from Specifications","author":"C.C. Morgan","year":"1994","unstructured":"Morgan, C.C.: Programming from Specifications, 2nd edn. Prentice Hall, Englewood Cliffs (1994)","edition":"2"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-45442-X_14","volume-title":"Mathematics of Program Construction","author":"J. Wright von","year":"2002","unstructured":"von Wright, J.: From Kleene algebra to refinement algebra. In: M\u00f6ller, B., Boiten, E. (eds.) MPC 2002. LNCS, vol.\u00a02386, pp. 233\u2013262. Springer, Heidelberg (2002)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2003.09.002","volume":"51","author":"J. von Wright","year":"2004","unstructured":"von Wright, J.: Towards a refinement algebra. Sci. of Comp. Prog.\u00a051, 23\u201345 (2004)","journal-title":"Sci. of Comp. Prog."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14808-8_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:57:43Z","timestamp":1606186663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14808-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642148071","9783642148088"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14808-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}