{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:01:54Z","timestamp":1742936514054,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642639708"},{"type":"electronic","value":"9783642594120"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-3-642-59412-0_24","type":"book-chapter","created":{"date-parts":[[2011,10,28]],"date-time":"2011-10-28T06:41:04Z","timestamp":1319784064000},"page":"385-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Proof of Correctness of Data Representations"],"prefix":"10.1007","author":[{"given":"C. A. R.","family":"Hoare","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,21]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/362575.362577","volume":"14","author":"N Wirth","year":"1971","unstructured":"Wirth, N.: The development of programs by stepwise refinement. Comm. ACM. 14, 221\u2013227 (1971).","journal-title":"Comm. ACM"},{"key":"24_CR2","volume-title":"Structured Programming","author":"EW Dijkstra","year":"1972","unstructured":"Dijkstra, E. W.: Notes on structured programming. In Structured Programming. Academic Press (1972)."},{"key":"24_CR3","unstructured":"Hoare, C. A. R.: Notes on data structuring. Ibid."},{"key":"24_CR4","unstructured":"Dahl, O.-J.: Hierachical program structures. Ibid."},{"key":"24_CR5","volume-title":"CS","author":"R Milner","year":"1971","unstructured":"Milner, R.: An algebraic definition of simulation between programs. CS 205 Stanford University, February 1971."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BF01933419","volume":"8","author":"EW Dijkstra","year":"1968","unstructured":"Dijkstra, E. W.: A constructive approach to the problem of program correctness. BIT. 8, 174\u2013186 (1968).","journal-title":"BIT"},{"key":"24_CR7","volume-title":"The SIMULA 67 common base language","author":"O-J Dahl","year":"1970","unstructured":"Dahl, O.-J., Myhrhaug, B., Nygaard, K.: The SIMULA 67 common base language. Norwegian Computing Center, Oslo, Publication No. S-22, 1970."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C. A. R.: An axiomatic approach to computer programming. Comm. ACM. 12, 576\u2013580, 583 (1969).","journal-title":"Comm. ACM."}],"container-title":["Software Pioneers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-59412-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T07:07:30Z","timestamp":1622185650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-59412-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783642639708","9783642594120"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-59412-0_24","relation":{},"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"21 October 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}