{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:10:37Z","timestamp":1725563437903},"publisher-location":"London","reference-count":146,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781848829114"},{"type":"electronic","value":"9781848829121"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-84882-912-1_1","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T12:27:13Z","timestamp":1282307233000},"page":"1-32","source":"Crossref","is-referenced-by-count":2,"title":["Insight, Inspiration and Collaboration"],"prefix":"10.1007","author":[{"given":"C. B.","family":"Jones","sequence":"first","affiliation":[]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,21]]},"reference":[{"key":"1_CR1","first-page":"27","volume":"29","author":"CAR Hoare","year":"1968","unstructured":"Hoare, C.A.R.: Critique of ALGOL 68. ALGOL Bullet. 29, 27\u201329 (November 1968).","journal-title":"ALGOL Bullet."},{"issue":"10","key":"1_CR2","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580, 583 (October 1969).","journal-title":"Commun. ACM"},{"issue":"4","key":"1_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1093\/comjnl\/14.4.391","volume":"14","author":"M Foley","year":"1971","unstructured":"Foley, M., Hoare, C.A.R.: Proof of a recursive program: Quicksort. BCS Comput. J. 14(4), 391\u2013395 (November 1971).","journal-title":"BCS Comput. J."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BFb0059696","volume-title":"Symposium on Semantics of Algorithmic Languages \u2013 Lecture Notes in Mathematics 188","author":"CAR Hoare","year":"1971","unstructured":"Hoare, C.A.R.: Procedures and parameters: An axiomatic approach. In: Engeler, E. (ed.), Symposium on Semantics of Algorithmic Languages \u2013 Lecture Notes in Mathematics 188, pp. 102\u2013116. Springer (1971)."},{"issue":"1","key":"1_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/362452.362489","volume":"14","author":"CAR Hoare","year":"1971","unstructured":"Hoare, C.A.R.: Proof of a program: Find. Commun. ACM 14(1), 39\u201345 (January 1971).","journal-title":"Commun. ACM"},{"volume-title":"Structured Programming","year":"1990","unstructured":"Dahl, O.-J., Dijkstra, E.W., Hoare, C.A.R. (eds.), Structured Programming. Academic (1972). London; San Diego: Academic Press, 1990, 1972.","key":"1_CR6"},{"issue":"3","key":"1_CR7","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF01932305","volume":"12","author":"CAR Hoare","year":"1972","unstructured":"Hoare, C.A.R.: A note on the FOR statement. BIT 12(3), 334\u2013341 (1972).","journal-title":"BIT"},{"key":"1_CR8","first-page":"83","volume-title":"Structured Programming","author":"CAR Hoare","year":"1990","unstructured":"Hoare, C.A.R.: Notes on data structuring. In Dahl, O.-J., Dijkstra, E.W., Hoare, C.A.R. (eds.), Structured Programming, pp. 83\u2013174. Academic (1972). London; SanDiego: Academic Press, 1990, 1972."},{"issue":"4","key":"1_CR9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/comjnl\/15.4.321","volume":"15","author":"CAR Hoare","year":"1972","unstructured":"Hoare, C.A.R.: Proof of a structured program: \u2018The Sieve of Eratosthenes\u2019. BCS, Computer J. 15(4), 321\u2013325 (November 1972).","journal-title":"BCS, Computer J"},{"issue":"4","key":"1_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"CAR Hoare","year":"1972","unstructured":"Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica 1(4), 271\u2013281 (1972).","journal-title":"Acta Informatica"},{"key":"1_CR11","first-page":"61","volume-title":"Towards a theory of parallel programming","author":"CAR Hoare","year":"1972","unstructured":"Hoare, C.A.R.: Towards a theory of parallel programming. In: Operating System Techniques pp. 61\u201371. Academic (1972)."},{"key":"1_CR12","volume-title":"Hints on programming language design","author":"CAR Hoare","year":"1973","unstructured":"Hoare, C.A.R.: Hints on programming language design. Technical Report STAN-CS-73-403, Stanford (October 1973)."},{"issue":"3","key":"1_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1093\/comjnl\/16.3.209","volume":"16","author":"CAR Hoare","year":"1973","unstructured":"Hoare, C.A.R.: A structured paging system. BCS Comput. J. 16(3), 209\u2013215 (August 1973).","journal-title":"BCS Comput. J."},{"issue":"4","key":"1_CR14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289504","volume":"2","author":"CAR Hoare","year":"1973","unstructured":"Hoare, C.A.R., Wirth, N.: An axiomatic definition of the programming language PASCAL. Acta Informatica 2(4), 335\u2013355 (1973).","journal-title":"Acta Informatica"},{"issue":"2","key":"1_CR15","first-page":"135","volume":"3","author":"CAR Hoare","year":"1974","unstructured":"Hoare, C.A.R., Lauer, P.E.: Consistent and complementary formal theories of the semantics of programming languages. Acta Informatica 3(2), 135\u2013153 (1974).","journal-title":"Acta Informatica"},{"issue":"10","key":"1_CR16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/355620.361161","volume":"17","author":"CAR Hoare","year":"1974","unstructured":"Hoare, C.A.R.: Monitors: An operating system structuring concept. Commun. ACM 17(10), 549\u2013557 (October 1974).","journal-title":"Commun. ACM"},{"issue":"2","key":"1_CR17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0096-0551(75)90014-4","volume":"1","author":"CAR Hoare","year":"1975","unstructured":"Hoare, C.A.R.: Parallel programming: An axiomatic approach. Comput. Languages 1(2), 151\u2013160 (June 1975).","journal-title":"Comput. Languages"},{"issue":"3","key":"1_CR18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF00288660","volume":"6","author":"EA Ashcroft","year":"1976","unstructured":"Ashcroft, E.A., Clint, M., Hoare, C.A.R.: Remarks on \u201cprogram proving: Jumps and functions\u201d. Acta Informatica 6(3), 317\u2013318 (1976).","journal-title":"Acta Informatica"},{"issue":"6","key":"1_CR19","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1002\/spe.4380070604","volume":"7","author":"J Welsh","year":"1977","unstructured":"Welsh, J., Sneeringer, W.J., Hoare, C.A.R.: Ambiguities and insecurities in PASCAL. Software Practice Experience 7(6), 685\u201396 (November\u2013December 1977).","journal-title":"Software Practice Experience"},{"issue":"3","key":"1_CR20","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(79)90006-0","volume":"19","author":"N Francez","year":"1979","unstructured":"Francez, N., Hoare, C.A.R., Lehmann, D.J., de Roever, W.P.: Semantics of nondeterminism, concurrency and communication. J. Comput. System Sci. 19(3), 290\u2013308 (December 1979).","journal-title":"J. Comput. System Sci."},{"key":"1_CR21","volume-title":"A theory of communicating sequential processes","author":"CAR Hoare","year":"1981","unstructured":"Hoare, C.A.R., Brookes, S.D., Roscoe, A.W.: A theory of communicating sequential processes. Technical Report PRG 16, Oxford University Computing Laboratory, Programming Research Group (1981)."},{"issue":"1\u20132","key":"1_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6423(81)90005-8","volume":"1","author":"CAR Hoare","year":"1981","unstructured":"Hoare, C.A.R.: A calculus of total correctness for communicating processes. The Sci. Computer Programming 1(1\u20132), 49\u201372 (October 1981).","journal-title":"The Sci. Computer Programming"},{"issue":"2","key":"1_CR23","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/358549.358561","volume":"24","author":"CAR Hoare","year":"1981","unstructured":"Hoare, C.A.R.: The emperor\u2019s old clothes. Commun. ACM 24(2), 75\u201383 (February 1981).","journal-title":"Commun. ACM"},{"key":"1_CR24","volume-title":"Specification-oriented semantics for communicating processes","author":"CAR Hoare","year":"1983","unstructured":"Hoare, C.A.R., Olderog, E.R.: Specification-oriented semantics for communicating processes. In: Automata Languages and Programming 10th Colloquium, vol. 154 of Lecture Notes in Computer Science, pp. 561\u2013572. Springer (1983)."},{"issue":"3","key":"1_CR25","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (July 1984).","journal-title":"J. ACM"},{"key":"1_CR26","first-page":"220","volume-title":"Programs as executable predicates","author":"CAR Hoare","year":"1984","unstructured":"Hoare, C.A.R., Roscoe, A.W.: Programs as executable predicates. In: Proceedings of the International Conference on Fifth Generation Computer Systems, November 6\u20139 1984, Tokyo, Japan, pp. 220\u2013228. ICOT (1984)."},{"key":"1_CR27","isbn-type":"print","first-page":"256","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall (1985). 256 pp., ISBN 0-13-153271-5.","ISBN":"http:\/\/id.crossref.org\/isbn\/0131532715"},{"key":"1_CR28","first-page":"141","volume-title":"Mathematical Logic and Programming Languages","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Programs are predicates. In: Hoare, C.A.R. Shepherdson, J.C. (eds.), Mathematical Logic and Programming Languages, pp. 141\u2013154. Prentice-Hall (1985)."},{"issue":"1","key":"1_CR29","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1986-9104","volume":"9","author":"CAR Hoare","year":"1986","unstructured":"Hoare, C.A.R., He, J.: The weakest prespecification I. Fundamenta Informaticae 9(1), 51\u201384 (March 1986).","journal-title":"Fundamenta Informaticae"},{"key":"1_CR30","volume-title":"ESOP \u201986: Proceedings of the European Symposium on Programming, of Lecture Notes in Computer Science","author":"J He","year":"1986","unstructured":"He, J., Hoare, C.A.R., Sanders, J.W.: Data refinement refined. In Robinet, B., Wilhelm, R. (eds.), ESOP \u201986: Proceedings of the European Symposium on Programming, vol. 213 of Lecture Notes in Computer Science. Springer (1986)."},{"key":"1_CR31","volume-title":"Laws of occam programming","author":"AW Roscoe","year":"1986","unstructured":"Roscoe, A.W., Hoare, C.A.R.: Laws of occam programming. Monograph PRG-53,Oxford University Computing Laboratory, Programming Research Group (February 1986)."},{"issue":"8","key":"1_CR32","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/27651.27653","volume":"30","author":"CAR Hoare","year":"1987","unstructured":"Hoare, C.A.R., Hayes, I.J., He, J., Morgan, C.C., Roscoe, A.W., Sanders, J.W., S\u00f8rensen, I.H., Spivey, J.M., Sufrin, B.A.: The laws of programming. Commun. of the ACM 30(8), 672\u2013687 (August 1987). see Corrigenda in Commun. ACM 30(9), 770. * * * * * * * * * * * * * * * * * * * * *The following is a list of all Hoare\u2019s papers since 1988, complementing the list published in [HJ89].","journal-title":"Commun. of the ACM"},{"key":"1_CR33","first-page":"28","volume-title":"Partial correctness of CMOS switching circuits: An exercise in applied logic","author":"CAR Hoare","year":"1988","unstructured":"Hoare, C.A.R., Gordon, M.J.C.: Partial correctness of CMOS switching circuits: An exercise in applied logic. In: LICS, pp. 28\u201336 (1988)."},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(88)90049-7","volume":"60","author":"AW Roscoe","year":"1988","unstructured":"Roscoe, A.W., Hoare, C.A.R.: The laws of occam programming. Theoret. Comput. Sci. 60, 177\u2013229 (1988).","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR35","first-page":"402","volume-title":"Categorical semantics for programming languages","author":"J He","year":"1989","unstructured":"He, J., Hoare, C.A.R.: Categorical semantics for programming languages. In: Mathematical Foundations of Programming Semantics, pp. 402\u2013417 (1989)."},{"key":"1_CR36","volume-title":"Jones","author":"CAR Hoare","year":"1989","unstructured":"Hoare, C.A.R., Jones, C.B.: Essays in Computing Science. Prentice Hall International, 1989."},{"key":"1_CR37","first-page":"1","volume-title":"The varieties of programming language","author":"CAR Hoare","year":"1989","unstructured":"Hoare, C.A.R.: The varieties of programming language. In: TAPSOFT, Vol.1, pages 1\u201318, 1989."},{"key":"1_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52513-0","volume-title":"VDM \u201990, VDM and Z \u2013 Formal Methods in Software Development","author":"D Bjrner","year":"1990","unstructured":"Bj\u00f8rner, D., Hoare, C.A.R., Langmaack, H.: VDM \u201990, VDM and Z \u2013 Formal Methods in Software Development, Third International Symposium of VDM Europe, Kiel, FRG, April 17\u201321, 1990, Proceedings, vol. 428 of Lecture Notes in Computer Science. Springer (1990)."},{"issue":"3","key":"1_CR39","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(90)90087-E","volume":"34","author":"CAR Hoare","year":"1990","unstructured":"Hoare, C.A.R.: Fixed points of increasing functions. Inf. Process. Lett. 34(3), 111\u2013112 (1990).","journal-title":"Inf. Process. Lett."},{"key":"1_CR40","first-page":"32","volume-title":"Let\u2019s make models (abstract)","author":"CAR Hoare","year":"1990","unstructured":"Hoare, C.A.R.: Let\u2019s make models (abstract). In: CONCUR, p. 32 (1990)."},{"key":"1_CR41","first-page":"18","volume-title":"A theory of conjunction and concurrency. In: PARBASE \/ Architectures","author":"CAR Hoare","year":"1990","unstructured":"Hoare, C.A.R.: A theory of conjunction and concurrency. In: PARBASE \/ Architectures, pp. 18\u201330 (1990)."},{"issue":"1","key":"1_CR42","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(91)90309-P","volume":"90","author":"CAR Hoare","year":"1991","unstructured":"Hoare, C.A.R.: A theory for the derivation of combinational CMOS circuit designs. Theoret. Comput. Sci. 90(1), 235\u2013251 (1991).","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"1_CR43","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1002\/cpe.4330030403","volume":"3","author":"CAR Hoare","year":"1991","unstructured":"Hoare, C.A.R.: The transputer and occam: A personal story. Concurrency Practice Exp., 3(4), 249\u2013264 (1991).","journal-title":"Concurrency Practice Exp."},{"issue":"2","key":"1_CR44","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1017\/S0960129500001262","volume":"1","author":"CE Martin","year":"1991","unstructured":"Martin, C.E., Hoare, C.A.R., He, J.: Pre-adjunctions in order enriched categories. Mathematical Struct. Comput. Sci. 1(2), 141\u2013158 (1991).","journal-title":"Mathematical Struct. Comput. Sci."},{"issue":"5","key":"1_CR45","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Ch Zhou","year":"1991","unstructured":"Zhou, Ch., Hoare, C.A.R., Ravn, A.P.: A calculus of durations. Inf. Process. Lett. 40(5), 269\u2013276 (1991).","journal-title":"Inf. Process. Lett."},{"key":"1_CR46","isbn-type":"print","volume-title":"Mechanised Reasoning and Hardware Design","year":"1992","unstructured":"Hoare, C.A.R., Gordon, M.J.C. (eds.), Mechanised Reasoning and Hardware Design. Prentice Hall International Series in Computer Science. ISBN 0-13-572405-8 (1992).","ISBN":"http:\/\/id.crossref.org\/isbn\/0135724058"},{"key":"1_CR47","first-page":"211","volume-title":"Programs are predicates","author":"CAR Hoare","year":"1992","unstructured":"Hoare, C.A.R.: Programs are predicates. In: FGCS, pp. 211\u2013218 (1992)."},{"issue":"1","key":"1_CR48","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00464355","volume":"1","author":"C Zhou","year":"1992","unstructured":"Zhou, C., Hoare, C.A.R.: A model for synchronous switching circuits and its theory of correctness. Formal Methods System Design 1(1), 7\u201328 (1992).","journal-title":"Formal Methods System Design"},{"issue":"2","key":"1_CR49","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(93)90219-Y","volume":"45","author":"J He","year":"1993","unstructured":"He, J., Hoare, C.A.R.: From algebra to operational semantics. Inf. Process. Lett. 45(2), 75\u201380 (1993).","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"1_CR50","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/BF01191809","volume":"30","author":"CAR Hoare","year":"1993","unstructured":"Hoare, C.A.R., He, J., Sampaio, A.: Normal form approach to compiler design. Acta informatica 30(8), 701\u2013739 (1993).","journal-title":"Acta informatica"},{"key":"1_CR51","first-page":"1","volume-title":"Algebra and models","author":"CAR Hoare","year":"1993","unstructured":"Hoare, C.A.R.: Algebra and models. In: SIGSOFT FSE, pp. 1\u20138 (1993)."},{"key":"1_CR52","first-page":"288","volume-title":"Provably correct systems","author":"J He","year":"1994","unstructured":"He, J., Hoare, C.A.R., Fr\u00e4nzle, M., M\u00fcller-Olm, M., Olderog, E.-R., Schenke, M., Hansen, M.R., Ravn, A.P., Rischel, H.: Provably correct systems. In: FTRTFT, pp. 288\u2013335 (1994)."},{"issue":"3","key":"1_CR53","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1093\/logcom\/4.3.215","volume":"4","author":"CAR Hoare","year":"1994","unstructured":"Hoare, C.A.R.: Editorial. J. Log. Comput. 4(3), 215\u2013216 (1994).","journal-title":"J. Log. Comput."},{"key":"1_CR54","first-page":"49","volume-title":"Hardware and software: The closing gap","author":"CAR Hoare","year":"1994","unstructured":"Hoare, C.A.R., Page, I.: Hardware and software: The closing gap. In: Programming Languages and System Architectures, pp. 49\u201368 (1994)."},{"key":"1_CR55","first-page":"49","volume-title":"Unification of theories: A challenge for computing science","author":"CAR Hoare","year":"1995","unstructured":"Hoare, C.A.R.: Unification of theories: A challenge for computing science. In: COMPASS\/ADT, pp. 49\u201357 (1995)."},{"issue":"3","key":"1_CR56","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(94)00205-D","volume":"53","author":"B Burghard van Karger","year":"1995","unstructured":"Burghard van Karger, B., Hoare, C.A.R.: Sequential calculus. Inf. Process. Lett 53(3), 123\u2013130 (1995).","journal-title":"Inf. Process. Lett"},{"key":"1_CR57","first-page":"1","volume-title":"How did software get so reliable without proof?","author":"CAR Hoare","year":"1996","unstructured":"Hoare, C.A.R.: How did software get so reliable without proof? In: FME, pp. 1\u201317 (1996)."},{"issue":"8\u20139","key":"1_CR58","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/0165-6074(96)00009-9","volume":"41","author":"CAR Hoare","year":"1996","unstructured":"Hoare, C.A.R.: The logic of engineering design. Microprocess. Microprogramm. 41(8-9), 525\u2013539 (1996).","journal-title":"Microprocess. Microprogramm."},{"key":"1_CR59","first-page":"115","volume-title":"Mathematical models for computing science","author":"CAR Hoare","year":"1996","unstructured":"Hoare, C.A.R.: Mathematical models for computing science. In: NATO ASI DPD, pp. 115\u2013164 (1996)."},{"key":"1_CR60","first-page":"233","volume-title":"The role of formal techniques: Past, current and future or how did software get so reliable without proof?","author":"CAR Hoare","year":"1996","unstructured":"Hoare, C.A.R.: The role of formal techniques: Past, current and future or how did software get so reliable without proof? (extended abstract). In: ICSE, pp. 233\u2013234, (1996)."},{"issue":"4es","key":"1_CR61","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/242224.242282","volume":"28","author":"CAR Hoare","year":"1996","unstructured":"Hoare, C.A.R.: Unifying theories: A personal statement. ACM Comput. Surv. 28(4es) 46 (1996).","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"1_CR62","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1145\/365696.365702","volume":"9","author":"N Wirth","year":"1966","unstructured":"Wirth, N., Hoare, C.A.R.: A contribution to the development of ALGOL. Communi. of the ACM 9(6) 413\u2013432 (June 1966).","journal-title":"Communi. of the ACM"},{"key":"1_CR63","first-page":"15","volume-title":"Unifying theories for parallel programming","author":"CAR Hoare","year":"1997","unstructured":"Hoare, C.A.R., He, J.: Unifying theories for parallel programming. In: Euro-Par, pp. 15\u201330 (1997)."},{"key":"1_CR64","volume-title":"Unifying Theories of Programming","author":"CAR Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall (1998)."},{"issue":"3-4","key":"1_CR65","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0020-0255(99)00015-8","volume":"119","author":"J He","year":"1999","unstructured":"He, J., Hoare, C.A.R.: Linking theories in probabilistic programming. Inf. Sci. 119, (3-4) 205\u2013218 (1999).","journal-title":"Inf. Sci."},{"key":"1_CR66","first-page":"1","volume-title":"A trace model for pointers and objects","author":"CAR Hoare","year":"1999","unstructured":"Hoare, C.A.R., He, J.: A trace model for pointers and objects. In: ECOOP, pp. 1\u201317 (1999)."},{"key":"1_CR67","first-page":"3","volume-title":"Theories of programming: Top-down and bottom-up and meeting in the middle","author":"CAR Hoare","year":"1999","unstructured":"Hoare, C.A.R.: Theories of programming: Top-down and bottom-up and meeting in the middle. In: Correct System Design, pp. 3\u201328 (1999)."},{"key":"1_CR68","first-page":"1","volume-title":"Theories of programming: Top-down and bottom-up and meeting in the middle","author":"CAR Hoare","year":"1999","unstructured":"Hoare, C.A.R.: Theories of programming: Top-down and bottom-up and meeting in the middle. In: World Congress on Formal Methods, pp. 1\u201327 (1999)."},{"key":"1_CR69","first-page":"25","volume-title":"A semantics for imprecise exceptions","author":"SL Pyton Jones","year":"1999","unstructured":"P\u00e9yton Jones, S.L., Reid, A., Henderson, F., Hoare, C.A.R., Marlow, S.: A semantics for imprecise exceptions. In: PLDI, pp. 25\u201336 (1999)."},{"key":"1_CR70","first-page":"184","volume-title":"Algebra of logic programming","author":"S Seres","year":"1999","unstructured":"Seres, S., Spivey, M.J., Hoare, C.A.R.: Algebra of logic programming. In: ICLP, pp. 184\u2013199 (1999)."},{"key":"1_CR71","first-page":"70","volume-title":"Unifying theories of healthiness condition","author":"J He","year":"2000","unstructured":"He, J., Hoare, C.A.R.: Unifying theories of healthiness condition. In: APSEC, pp. 70\u2013, 2000."},{"key":"1_CR72","first-page":"77","volume-title":"Algebraic derivation of an operational semantics","author":"CAR Hoare","year":"2000","unstructured":"Hoare, C.A.R., He, J., Sampaio, A.: Algebraic derivation of an operational semantics. In: Proof, Language, and Interaction, pp. 77\u201398 (2000)."},{"key":"1_CR73","first-page":"1","volume-title":"Assertions","author":"CAR Hoare","year":"2000","unstructured":"Hoare, C.A.R.: Assertions. In: IFM, pp. 1\u20132 (2000)."},{"issue":"1\/2","key":"1_CR74","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1010053724918","volume":"13","author":"CAR Hoare","year":"2000","unstructured":"Hoare, C.A.R.: A hard act to follow. Higher-Order and Symbolic Comput 13(1\/2), 71\u201372 (2000).","journal-title":"Higher-Order and Symbolic Comput"},{"key":"1_CR75","first-page":"75","volume-title":"Legacy code","author":"CAR Hoare","year":"2000","unstructured":"Hoare, C.A.R.: Legacy code. In: ICFEM, p. 75 (2000)."},{"key":"1_CR76","first-page":"3","volume-title":"Growing use of assertions","author":"CAR Hoare","year":"2001","unstructured":"Hoare, C.A.R.: Growing use of assertions. In: TOOLS (38), p. 3 (2001)."},{"issue":"2\u20134","key":"1_CR77","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0020-0190(00)00209-X","volume":"77","author":"CAR Hoare","year":"2001","unstructured":"Hoare, C.A.R.: Legacy. Inf. Process. Lett., 77(2-4):123\u2013129, 2001.","journal-title":"Inf. Process. Lett."},{"key":"1_CR78","first-page":"21","volume-title":"memoriam: Edsger w. Dijkstra 1930\u20132002.","author":"RS Boyer","year":"2002","unstructured":"Boyer, R.S., Feijen, W.H.J., Gries, D., Hoare, C.A.R., Misra, J, Moore, J., Richards, H.: In: memoriam: Edsger w. Dijkstra 1930\u20132002. Commun. ACM 45(10):21\u201322 (2002)."},{"key":"1_CR79","first-page":"459","volume-title":"Assertions in modern software engineering practice","author":"CAR Hoare","year":"2002","unstructured":"Hoare, C.A.R.: Assertions in modern software engineering practice. In: COMPSAC, pp. 459\u2013462 (2002)."},{"key":"1_CR80","first-page":"350","volume-title":"Assertions in programming: From scientific theory to engineering practice","author":"CAR Hoare","year":"2002","unstructured":"Hoare, C.A.R.: Assertions in programming: From scientific theory to engineering practice. In: Soft-Ware, pp. 350\u2013351 (2002)."},{"key":"1_CR81","first-page":"151","volume-title":"Towards the verifying compiler","author":"CAR Hoare","year":"2002","unstructured":"Hoare, C.A.R.: Towards the verifying compiler. In: 10th Anniversary Colloquium of UNU\/IIST, pp. 151\u2013160 (2002)."},{"issue":"2","key":"1_CR82","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/MAHC.2003.1203056","volume":"25","author":"CAR Hoare","year":"2003","unstructured":"Hoare, C.A.R.: Assertions: A personal perspective. IEEE Ann. History Comput. 25(2), 14\u201325 (2003).","journal-title":"IEEE Ann. History Comput."},{"issue":"1","key":"1_CR83","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/602382.602403","volume":"50","author":"CAR Hoare","year":"2003","unstructured":"Hoare, C.A.R.: The verifying compiler: A grand challenge for computing research. J. ACM 50(1), 63\u201369 (2003). (This paper also appeared in a number of other publications).","journal-title":"J. ACM"},{"key":"1_CR84","first-page":"133","volume-title":"A trace semantics for long-running transactions","author":"MJ Butler","year":"2004","unstructured":"Butler, M.J., Hoare, C.A.R., Ferreira, C.: A trace semantics for long-running transactions. In: 25 Years Communicating Sequential Processes, pp. 133\u2013150 (2004)."},{"key":"1_CR85","first-page":"242","volume-title":"Stuck-free conformance","author":"C Fournet","year":"2004","unstructured":"Fournet, C., Hoare, C.A.R., Rajamani, S.K., Rehof, J.: Stuck-free conformance. In: CAV, pp. 242\u2013254 (2004)."},{"key":"1_CR86","first-page":"36","volume-title":"Process algebra: A unifying approach","author":"CAR Hoare","year":"2004","unstructured":"Hoare, C.A.R.: Process algebra: A unifying approach. In: 25 Years Communicating Sequential Processes, pp. 36\u201360 (2004)."},{"key":"1_CR87","first-page":"124","volume-title":"Towards the verifying compiler","author":"CAR Hoare","year":"2004","unstructured":"Hoare, C.A.R.: Towards the verifying compiler. In: Essays in Memory of Ole-Johan Dahl, pp. 124\u2013136 (2004)."},{"key":"1_CR88","first-page":"383","volume-title":"Comparing two approaches to compensable flow composition","author":"R Bruni","year":"2005","unstructured":"Bruni, R., Butler, M.J., Ferreira, C., Hoare, C.A.R., Melgratti, H.C., Montanari, U.: Comparing two approaches to compensable flow composition. In CONCUR, pp. 383\u2013397 (2005)."},{"key":"1_CR89","first-page":"303","volume-title":"Linking theories of concurrency","author":"J He","year":"2005","unstructured":"He, J., Hoare, C.A.R.: Linking theories of concurrency. In: ICTAC, pp. 303\u2013317 (2005)."},{"issue":"1","key":"1_CR90","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1093\/comjnl\/bxh065","volume":"48","author":"CAR Hoare","year":"2005","unstructured":"Hoare, C.A.R., Milner, R.: Grand challenges for computing research. Comput. J. 48(1), 49\u201352 (2005).","journal-title":"Comput. J."},{"key":"1_CR91","first-page":"1","volume-title":"Verified software: Theories, tools, experiments vision of a grand challenge project","author":"CAR Hoare","year":"2005","unstructured":"Hoare, C.A.R., Misra, J.: Verified software: Theories, tools, experiments vision of a grand challenge project. In: VSTTE, pp. 1\u201318 (2005)."},{"issue":"6","key":"1_CR92","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/MIS.2006.117","volume":"21","author":"B Beckert","year":"2006","unstructured":"Beckert, B., Hoare, C.A.R., H\u00e4hnle, R., Smith, D.R., Green, C., Ranise, S., Tinelli, C., Ball, T., Rajamani, S.K.: Intelligent systems and formal methods in software engineering. IEEE Intelligent Systems 21(6), 71\u201381 (2006).","journal-title":"IEEE Intelligent Systems"},{"issue":"2","key":"1_CR93","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s00165-005-0079-4","volume":"18","author":"J Bicarregui","year":"2006","unstructured":"Bicarregui, J., Hoare, C.A.R., Woodcock, J.C.P.: The verified software repository: A step towards the verifying compiler. Formal Asp. Comput. 18(2), 143\u2013151(2006).","journal-title":"Formal Asp. Comput"},{"key":"1_CR94","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2009.12.012","volume-title":"CSP is a retract of CCS","author":"J He","year":"2006","unstructured":"He, J., Hoare, C.A.R.: CSP is a retract of CCS. In: UTP, pp. 38\u201362 (2006). TCS 411 (issue 11--13), pp. 1311--1337, 2010doi:10.1016\/j.tcs.2009.12.012"},{"key":"1_CR95","first-page":"5","volume-title":"The ideal of verified software","author":"CAR Hoare","year":"2006","unstructured":"Hoare, C.A.R.: The ideal of verified software. In: CAV pp. 5\u201316 (2006)."},{"key":"1_CR96","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.entcs.2006.01.031","volume":"162","author":"CAR Hoare","year":"2006","unstructured":"Hoare, C.A.R.: Why ever CSP? Electr. Notes Theoret. Comput. Sci. 162, 209\u2013215 (2006).","journal-title":"Electr. Notes Theoret. Comput. Sci."},{"key":"1_CR97","first-page":"129","volume-title":"Proving correctness of highly.concurrent linearisable objects","author":"V Vafeiadis","year":"2006","unstructured":"Vafeiadis, V., Herlihy, M., Hoare, C.A.R., Shapiro, M.: Proving correctness of highly.concurrent linearisable objects. In: PPOPP, pp. 129\u2013136 (2006)."},{"key":"1_CR98","first-page":"1","volume-title":"Fine-grain concurrency","author":"CAR Hoare","year":"2007","unstructured":"Hoare, C.A.R.: Fine-grain concurrency. In: CPA, pp. 1\u201319 (2007)."},{"issue":"3","key":"1_CR99","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1093\/comjnl\/bxl078","volume":"50","author":"CAR Hoare","year":"2007","unstructured":"Hoare, C.A.R.: The ideal of program correctness: Third Computer Journal lecture. Comput. J. 50(3), 254\u2013260 (2007).","journal-title":"Comput. J."},{"key":"1_CR100","first-page":"2","volume-title":"Science and engineering: A collusion of cultures","author":"CAR Hoare","year":"2007","unstructured":"Hoare, C.A.R.: Science and engineering: A collusion of cultures. In: DSN, pp. 2\u20139 (2007)."},{"key":"1_CR101","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.entcs.2008.04.050","volume":"212","author":"CAR Hoare","year":"2008","unstructured":"Hoare, C.A.R., O\u2019Hearn, P.W.: Separation logic semantics for communicating processes. Electr. Notes Theoret. Comput. Sci. 212:3\u201325 (2008).","journal-title":"Electr. Notes Theoret. Comput. Sci."},{"key":"1_CR102","first-page":"1","volume-title":"Keynote: A vision for the science of computing","author":"CAR Hoare","year":"2008","unstructured":"Hoare, C.A.R.: Keynote: A vision for the science of computing. In: BCS Int. Acad. Conf., pp. 1\u201329 (2008)."},{"key":"1_CR103","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.entcs.2008.04.010","volume":"209","author":"CAR Hoare","year":"2008","unstructured":"Hoare, C.A.R.: Verification of fine-grain concurrent programs. Electr. Notes Theoret. Comput. Sci. 209, 165\u2013171 (2008).","journal-title":"Electr. Notes Theoret. Comput. Sci."},{"key":"1_CR104","first-page":"3","volume-title":"Verified software: Theories, tools, experiments","author":"CAR Hoare","year":"2008","unstructured":"Hoare, C.A.R.: Verified software: Theories, tools, experiments. In: ICECCS, p. 3 (2008)."},{"key":"1_CR105","volume":"41","author":"CAR Hoare","year":"2009","unstructured":"Hoare, C.A.R., Misra, J.: Preface to special issue on software verification. ACM Comput. Surv. 41(4) (2009).","journal-title":"ACM Comput. Surv."},{"key":"1_CR106","volume":"41","author":"CAR Hoare","year":"2009","unstructured":"Hoare, C.A.R., Misra, J., Leavens, G.T., Shankar, N.: The verified software initiative: A manifesto. ACM Comput. Surv. 41(4), (2009).","journal-title":"ACM Comput. Surv."},{"key":"1_CR107","first-page":"399","volume-title":"Concurrent Kleene algebra","author":"CAR Hoare","year":"2009","unstructured":"Hoare, C.A.R., Mller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra. In: CONCUR, pp. 399\u2013414 (2009)."},{"key":"1_CR108","first-page":"166","volume-title":"Foundations of concurrent Kleene algebra","author":"CAR Hoare","year":"2009","unstructured":"Hoare, C.A.R., M\u00f6ller, B., Struth, G., Wehrman, I.: Foundations of concurrent Kleene algebra. In: RelMiCS, pp. 166\u2013186 (2009)."},{"issue":"10","key":"1_CR109","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/1562764.1562779","volume":"52","author":"CAR Hoare","year":"2009","unstructured":"Hoare, C.A.R.: Viewpoint \u2013 retrospective: an axiomatic basis for computer programming. Commun. ACM 52(10), 30\u201332 (2009).","journal-title":"Commun. ACM"},{"issue":"17","key":"1_CR110","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1016\/j.ipl.2009.06.003","volume":"109","author":"I Wehrman","year":"2009","unstructured":"Wehrman, I., Hoare, C.A.R., O\u2019Hearn, P.W.: Graphical models of separation logic. Inf. Process. Lett. 109(17), 1001\u20131004 (2009).","journal-title":"Inf. Process. Lett."},{"key":"1_CR111","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book: Assigning Programs to Meanings","author":"JR Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press (1996)."},{"key":"1_CR112","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"KR Apt","year":"1981","unstructured":"Apt, K.R.: Ten years of Hoare\u2019s logic: A survey \u2013 part I. ACM Trans. Programm. Languages Systems 3, 431\u2013483 (1981).","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"1_CR113","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(83)90066-X","volume":"28","author":"KR Apt","year":"1984","unstructured":"Apt, K.R.: Ten years of Hoare\u2019s logic: A survey \u2013 part II: Nondeterminism. Theoret. Comput. Sci., 28, 83\u2013109 (1984).","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR114","volume-title":"A formal definition of a PL\/I subset","author":"H Beki","year":"1974","unstructured":"Beki\u010d, H., Bj\u00f8rner, D., Henhapl, W., Jones, C.B., Lucas, P.: A formal definition of a PL\/I subset. Technical Report 25.139, IBM Laboratory Vienna (December 1974)."},{"volume-title":"The Vienna Development Method: The Meta-Language","year":"1978","unstructured":"Bj\u00f8rner, D., Jones, C.B. (eds.), The Vienna Development Method: The Meta-Language, vol. 61 of Lecture Notes in Computer Science. Springer (1978).","key":"1_CR115"},{"key":"1_CR116","volume-title":"Roscoe","author":"SD Brookes","year":"1985","unstructured":"Brookes, S.D., Roscoe, A.W.: An improved failures model for communicating processes (1985)."},{"key":"1_CR117","volume-title":"A mathematical theory of communicating processes","author":"SD Brookes","year":"1983","unstructured":"Brookes, S.D.: A mathematical theory of communicating processes. PhD thesis, University of Oxford (1983)."},{"key":"1_CR118","volume-title":"A Discipline of Programming","author":"EW Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall (1976)."},{"key":"1_CR119","volume-title":"Testing equivalences for processes","author":"R De Nicola","year":"1983","unstructured":"De Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes (1983)."},{"key":"1_CR120","first-page":"19","volume-title":"Assigning meanings to programs","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Assigning meanings to programs. In: Proc. Symp. in Applied Mathematics, Vol.19: Mathematical Aspects of Computer Science, pp. 19\u201332. American Mathematical Society (1967)."},{"key":"1_CR121","first-page":"180","volume":"1988","author":"MH Goldsmith","year":"1988","unstructured":"Goldsmith, M.H., Roscoe, A.W.: Transformation of occam programs. In: Design and Application of Parallel Digital Processors, 1988, pp. 180\u2013188 (1988).","journal-title":"In: Design and Application of Parallel Digital Processors"},{"key":"1_CR122","first-page":"80","volume-title":"Planning and coding of problems for an electronic computing instrument","author":"HH Goldstine","year":"1947","unstructured":"Goldstine, H.H., von Neumann, J.: Planning and coding of problems for an electronic computing instrument, 1947. Part II, Vol. 1 of a Report prepared for U.S. Army Ord. Dept.; republished as pp. 80\u2013151 of [34]."},{"key":"1_CR123","volume-title":"The Turing Programming Language: Design and Defintion","author":"RC Holt","year":"1988","unstructured":"Holt, R.C., Matthews, P.A., J.A, J.A., Cordy, J.R.: The Turing Programming Language: Design and Defintion. Prentice Hall International (1988)."},{"key":"1_CR124","volume-title":"Software Development: A Rigorous Approach","author":"CB Jones","year":"1980","unstructured":"Jones, C.B.: Software Development: A Rigorous Approach. Prentice Hall International (1980)."},{"issue":"2","key":"1_CR125","doi-asserted-by":"crossref","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, Annals of the History of Comput. 25(2), 26\u201349 (2003).","journal-title":"IEEE, Annals of the History of Comput"},{"key":"1_CR126","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.tcs.2006.12.029","volume":"357","author":"CB Jones","year":"2007","unstructured":"Jones, C.B.: Splitting atoms safely. Theoret. Comput. Sci. 357, 109\u2013119 (2007).","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR127","volume-title":"A Program Verifier","author":"JC King","year":"1969","unstructured":"King, J.C.: A Program Verifier. PhD thesis, Department of Computer Science, Carnegie-Mellon University (1969)."},{"key":"1_CR128","volume-title":"Consistent Formal Theories of the Semantics of Programming Languages","author":"PE Lauer","year":"1971","unstructured":"Lauer, P.E.: Consistent Formal Theories of the Semantics of Programming Languages. PhD thesis, Queen\u2019s University of Belfast, 1971. Printed as TR 25.121, IBM Lab. Vienna."},{"unstructured":"INMOS Ltd. Occam Programming Manual. Prentice Hall (1984).","key":"1_CR129"},{"key":"1_CR130","volume-title":"On the Formal Description of PL\/I, vol. 6, Part 3 of Annual Review in Automatic Programming","author":"P Lucas","year":"1969","unstructured":"Lucas, P., Walk, K.: On the Formal Description of PL\/I, vol. 6, Part 3 of Annual Review in Automatic Programming. Pergamon Press (1969)."},{"key":"1_CR131","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0049-237X(08)72018-4","volume-title":"Computer Programming and Formal SystemsNorth-Holland","author":"J McCarthy","year":"1963","unstructured":"McCarthy, J.: A basis for a mathematical theory for computation. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 33\u201370. North-Holland (1963). (A slightly extended and corrected version of a talk given at the May 1961 Western Joint Computer Conference)."},{"key":"1_CR132","first-page":"1","volume-title":"A formal description of a subset of ALGOL","author":"J McCarthy","year":"1966","unstructured":"McCarthy, J.: A formal description of a subset of ALGOL. In: [33], pp. 1\u201312 (1966)."},{"key":"1_CR133","volume-title":"Processes: a mathematical model of computing agents","author":"R Milner","year":"1973","unstructured":"Milner, R.: Processes: a mathematical model of computing agents. In: Logic Colloquium.73. North Holland (1973)."},{"issue":"4","key":"1_CR134","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R Milner","year":"1979","unstructured":"Milner. R.: Flowgraphs and flow algebras. J. ACM 26(4), 794\u2013818 (1979).","journal-title":"J. ACM"},{"key":"1_CR135","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1982","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, New York, Inc. Secaucus, NJ, USA (1982)."},{"key":"1_CR136","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"GD Plotkin","year":"1976","unstructured":"Plotkin, G.D.: A powerdomain construction. SIAM. Comput. 5, 452 (1976).","journal-title":"A powerdomain construction. SIAM. Comput."},{"key":"1_CR137","volume-title":"Milestones in Computer Science and Information Technology","author":"ED Reilly","year":"2003","unstructured":"Reilly, E.D.: Milestones in Computer Science and Information Technology. Greenwood Pub Group (2003)."},{"key":"1_CR138","volume-title":"A mathematical theory of communicating processes","author":"AW Roscoe","year":"1982","unstructured":"Roscoe, A.W.: A mathematical theory of communicating processes. PhD thesis, University of Oxford (1982)."},{"key":"1_CR139","volume-title":"Denotational Semantics for occam","author":"AW Roscoe","year":"1985","unstructured":"Roscoe, A.W.: Denotational Semantics for occam (1985)."},{"key":"1_CR140","first-page":"137","volume-title":"Occam in the specification and verification of microprocessors","author":"AW Roscoe","year":"1992","unstructured":"Roscoe, A.W.: Occam in the specification and verification of microprocessors. Philosophical Transactions: Physical Sciences and Engineering, pp. 137\u2013151 (1992)."},{"key":"1_CR141","volume-title":"The Theory and Practice of Concurrency","author":"AW Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall (1997)."},{"key":"1_CR142","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding Concurrent Systems","author":"Aw Roscoe","year":"2010","unstructured":"Roscoe, A.W.: Understanding Concurrent Systems. Springer (2010)."},{"unstructured":"Steel, T.B.: Formal Language Description Languages for Computer Programming. North-Holland (1966).","key":"1_CR143"},{"unstructured":"Taub, A.H. (ed.), John von Neumann: Collected Works, vol. V: Design of Computers, Theory of Automata and Numerical Analysis. Pergamon Press (1963).","key":"1_CR144"},{"unstructured":"Turing. A.M.: Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines, pp. 67\u201369. University Mathematical Laboratory, Cambridge (June 1949).","key":"1_CR145"},{"key":"1_CR146","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/BF01939551","volume":"6","author":"A. Wijngaarden","year":"1966","unstructured":"van Wijngaarden, A.: Numerical analysis as an independent science. BIT 6:66\u201381 (1966). (Text of 1964 talk).","journal-title":"BIT"}],"container-title":["Reflections on the Work of C.A.R. Hoare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84882-912-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T15:17:49Z","timestamp":1636211869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84882-912-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9781848829114","9781848829121"],"references-count":146,"URL":"https:\/\/doi.org\/10.1007\/978-1-84882-912-1_1","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}