*
Quick Links|Home|Worldwide
Microsoft*
Search for

Tony Hoare - Bibliography

This is a list of entries from the Computing Laboratory's bibliographical database.

It may not include all relevant publications.

  1. C A R Hoare.Algorithm 63, Partition; Algorithm 64, Quicksort; Algorithm 65, Find.Communications of the ACM, 4(7):321-322, Jul 1961.
  2. C A R Hoare. RUSSIAN TITLE: A method of Synthesizing Sentences in Machine Translation on the Basis of Syntagmatic Analysis, 1961. In: Foreign Develop. Mach. Translat. Info. Proc. No. 95 (Translated from Mashinnii Perevod i Prikladnaya Linguistika No. 6, pp. 80-88).
  3. C A R Hoare. Quicksort. Computer Journal, 5(1):10-15, 1962.
  4. C A R Hoare. Report on the Elliott ALGOL translator. Computer Journal, 5(2):127-129, Jul 1962.
  5. C A R Hoare. The Elliott ALGOL input/output system. Computer Journal, 5(4):345-348, Jan 1963.
  6. C A R Hoare. The Elliott ALGOL programming system. In P. Wegner, editor, Introduction to Systems Programming, pages 156-166. Academic Press, 1964.
  7. C A R Hoare. A note on indirect addressing. ALGOL Bulletin, 21:63-65, Nov 1965.
  8. C A R Hoare. PL/I. In Proceedings of the ACTP Summer School on Software, Jun 1966.
  9. C A R Hoare. Single pass compilation. In Proceedings of the ACTP Summer School on Software, Jun 1966.
  10. N Wirth and C A R Hoare. A contribution to the development of ALGOL. Communications of the ACM, 9:413-432, 1966.
  11. C A R Hoare. Critique of ALGOL 68. ALGOL BULLETIN, 29:27-29, Nov 1968.
  12. C A R Hoare. Limitations on languages. Computer Weekly, 1968.
  13. C A R Hoare. Record handling. In F. Genuys, editor, Programming Languages, pages 291-347. Academic Press, 1968.
  14. C A R Hoare. Data structures in two-level store. In Proceedings of the IFIP Congress, Edinburgh, 1968, pages 322-329. North-Holland, 1969.
  15. M Foley and C A R Hoare. Proof of a recursive program: Quicksort. Computer Journal, 14:391-395, 1971.
  16. C A R Hoare. Computer science. New Lecture Series 62, The Queen's University, Belfast, 1971.
  17. C A R Hoare. Procedures and parameters: An axiomatic approach. In E. Engeler, editor, Symposium On Semantics of Algorithmic Languages -- Lecture Notes in Mathematics 188, pages 102-116. Springer-Verlag, 1971.
  18. C A R Hoare. Proof of a program: FIND. Communications of the ACM, 14(1):39-45, Jan 1971.
  19. M Clint and C A R Hoare. Program proving: Jumps and functions. Acta Informatica, 1:214-224, 1972.
  20. O -J Dahl and C A R Hoare. Hierarchical program structures. In O -J Dahl, E W Dijkstra and C A R Hoare, editors, Structured Programming, pages 175-220. Academic Press, 1972.
  21. C A R Hoare. A Note on the FOR Statement. BIT, 12(3):334-341, 1972.
  22. C A R Hoare. Notes on data structuring. In O -J Dahl, E W Dijkstra and C A R Hoare, editors, Structured Programming, pages 83-174. Academic Press, 1972.
  23. C A R Hoare. Operating systems: their purpose, objectives, functions and scope. In Operating System Techniques, pages 11-28. Academic Press, 1972.
  24. C A R Hoare. Proof of a structured program: `The Sieve of Eratosthenes'. Computer Journal, 15(4):321-325, Nov 1972.
  25. C A R Hoare. Proof of correctness of data representations. Acta Informatica, 1(4):271-281, 1972.
  26. C A R Hoare. Prospects for a better programming language. Infotech State of the Art Report: High Level Languages, 7:327-343, 1972.
  27. C A R Hoare. The quality of software. Software: Practice & Experience, 2(2):103-5, Apr 1972.
  28. C A R Hoare. Towards a theory of parallel programming. In Operating System Techniques, pages 61-71. Academic Press, 1972.
  29. C A R Hoare and D C S Allison. Incomputability. Computing Surveys, 4(3):169-178, Sep 1972.
  30. C A R Hoare and R M McKeag. A survey of store management techniques: Part 1. In Operating System Techniques, pages 117-131. Academic Press, 1972.
  31. C A R Hoare and R M McKeag. A survey of store management techniques: Part 2. In Operating System Techniques, pages 132-151. Academic Press, 1972.
  32. C A R Hoare. Computer programming as an engineering discipline. Electronics & Power, 19(14):316-320, Aug 1973.
  33. C A R Hoare. A general conservation law for queueing disciplines. Information Processing Letters, 2(3):82-85, Aug 1973.
  34. C A R Hoare. High level programming languages, the way behind. In D. Simpson, editor, High Level Programming Languages -- The Way Ahead. NCC Publications, Manchester, 1973.
  35. C A R Hoare. A structured paging system. Computer Journal, 16(3):209-215, Aug 1973.
  36. C A R Hoare. Tomorrow's men: The role of the university. Computer Weekly, Educational Supplement, 7, Jul 1973.
  37. C A R Hoare and N Wirth. An axiomatic definition of the programming language PASCAL. Acta Informatica, 2(4):335-355, 1973.
  38. C A R Hoare. Hints on programming language design. In C J Bunyan, editor, State of the Art Report 20: Computer Systems Reliability, pages 505-534. Pergamon/Infotech, 1974.
  39. C A R Hoare. Monitors: An operating system structuring concept. Communications of the ACM, 17(10):549-557, Oct 1974.
  40. C A R Hoare. Optimisation of store size for garbage collection. Information Processing Letters, 2(6):165-166, Apr 1974.
  41. C A R Hoare. Software design: A parable. Software World, 5(9-10):53-56, 1974.
  42. C A R Hoare and P E Lauer. Consistent and complementary formal theories of the semantics of programming languages. Acta Informatica, 3(2):135-153, 1974.
  43. P H Enslow, C A R Hoare, J Palme, D Parnas and I Pyle. Implementation Languages for Real-Time Systems -- I. Standardisation -- its Implementation and Acceptance. Rep. ERO-2-75-Vol-1, Euro. Res. Office, London, 1975.
  44. P H Enslow, C A R Hoare, J Palme, D Parnas and I Pyle. Implementation Languages for Real-Time Systems -- II. Language Design -- General Comments. Rept. ERO-2-75-Vol-2, Euro. Res. Office, London, 1975.
  45. P H Enslow, C A R Hoare, J Palme, D Parnas and I Pyle. Implementation Languages for Real-Time Systems -- III. Command and Control Languages -- Specific Comments. Rept. ERO-2-75-Vol-3, Euro. Res. Office, London, 1975.
  46. C A R Hoare. Data reliability. ACM SIGPLAN Notices, 10(6):528-533, Jun 1975. Proc. of the Int. Conf. Reliable Software, Los Angeles.
  47. C A R Hoare. Parallel programming: An axiomatic approach. Computer Languages, 1(2):151-160, Jun 1975.
  48. C A R Hoare. Program correctness proofs. In B. Shaw, editor, Formal Aspects of Computing Science, Newcastle upon Tyne, 3-6 September, 1974, pages 7-45. University of Newcastle-upon-Tyne, 1975.
  49. C A R Hoare. Recursive data structures. International Journal of Computer and Information Sciences, 4(2):105-132, Jun 1975.
  50. C A R Hoare. Software engineering. Computer Bulletin, 2(6):6-7, Dec 1975.
  51. C A R Hoare and H C Johnston. Matrix reduction--an efficient method (school timetables). Communications of the ACM, 18(3):141-150, Mar 1975.
  52. E A Ashcroft, M Clint and C A R Hoare. Remarks on program proving: Jumps and functions. Acta Informatica, 6:317-318, 1976.
  53. C A R Hoare. The high cost of programming languages. Software Systems Engineering, pages 413-429, 1976.
  54. C A R Hoare. Hints on the design of a programming language for real-time command and control. In J P Spencer, editor, Real-time Software: International State of the Art Report, pages 685-99. Infotech International, 1976.
  55. C A R Hoare. The structure of an operating system. In Language Hierarchies and Interfaces, volume 46 of Lecture Notes in Computer Science, pages 242-265. Springer-Verlag, 1976.
  56. C A R Hoare. Structured programming in introductory programming courses. Infotech, Structured Programming, pages 255-263, 1976.
  57. W H Kaubisch, R H Perrott and C A R Hoare. Quasiparallel programming. Software: Practice & Experience, 6(3):341-356, Jul 1976.
  58. C A R Hoare. Introduction. In R H Perrott, editor, Software Engineering -- Proceedings of a Symposium held at the Queen's University of Belfast 1976 (A P I C Studies in Data Processing No. 14), pages 7-14. Academic Press, 1977.
  59. A M MacNaughten and C A R Hoare. Fast fourier transform free from tears. Computer Journal, 20(1):78-83, Feb 1977.
  60. J Welsh, W J Sneeringer and C A R Hoare. Ambiguities and insecurities in PASCAL. Software: Practice & Experience, 7:685-96, 1977.
  61. C A R Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666-677, Aug 1978.
  62. C A R Hoare. Communicating sequential processes. In B. Shaw, editor, Digital Systems Design. Proceedings of the Joint IBM University of Newcastle upon Tyne Seminar, 6-9 September 1977, pages 145-56. Newcastle University, 1978.
  63. C A R Hoare. Software engineering: A keynote address. In 3rd International Conference on Software Engineering, Atlanta, GA., USA, 10-12 May, pages 1-4. ACM, IEEE, 1978.
  64. C A R Hoare. Some properties of predicate transformers. Journal of the Association for Computing Machinery, 25(3):461-80, Jul 1978.
  65. N Francez, C A R Hoare, D J Lehmann and W P de Roever. Semantics of nondeterminism, concurrency and communication. Journal of Computer and System Sciences, 19(3):290-308, 1979.
  66. C A R Hoare. Hoare on programming. Computer World UK, 1980. Text of an interview.
  67. C A R Hoare. A model for communicating sequential processes. In R M McKeag and A M MacNaughten, editors, On the Construction of Programs, pages 229-254. Cambridge University Press, 1980.
  68. C A R Hoare. Synchronisation of parallel processes. In F K Hanna, editor, Advanced Techniques for Microprocessor Systems, pages 108-111. Peter Peregrinus, 1980.
  69. C A R Hoare and J R Kennaway. A theory of non-determinism. In Proceedings ICALP '80, LNCS, pages 338-350. Springer-Verlag,, 1980.
  70. C A R Hoare. A calculus of total correctness for communicating processes. Science of Computer Programming, 1(1-2):49-72, Oct 1981.
  71. C A R Hoare. The emperor's old clothes. Communications of the ACM, 24(2):75-83, Feb 1981.
  72. C A R Hoare. Is there a mathematical basis for computer programming? NAG Newsletter, 2:6-15, 1981.
  73. C A R Hoare. Professionalism. Computer Bulletin, 2(29):2-4, 1981. Invited Talk given at BCS 81.
  74. C C Zhou and C A R Hoare. Partial correctness of communicating sequential processes. In Proceedings of 2nd International Conference on Distributed Computing Systems, pages 1-12. IEEE Computer Society Press, 1981.
  75. C A R Hoare. Specifications, programs and implementations. Technical Monograph PRG-29, Oxford University Computing Laboratory, Programming Research Group, Wolfson Building, Parks Road, Oxford, OX1 3QD., Jun 1982.
  76. C A R Hoare and R M McKeag. Structure of an operating system. In M. Broy and G. Schmidt, editors, Theoretical Foundations of Programming Methodology -- Lecture Notes of an International Summer School, Germany, 1981, pages 643-658. Reidel, 1982.
  77. C A R Hoare and C C Zhou. The consistency of the calculus of total correctness for communicating processes. Technical Monograph PRG-26, Oxford University Computing Laboratory, Programming Research Group, Wolfson Building, Parks Road, Oxford, OX1 3QD., Feb 1982.
  78. W H Kaubisch and C A R Hoare. Discrete event simulation based on communicating sequential processes. In M. Broy and G. Schmidt, editors, Theoretical Foundations of Programming Methodology -- Lecture Notes of an International Summer School, Germany, 1981, pages 625-42. Reidel, 1982.
  79. E C R Hehner and C A R Hoare. A more complete model of communicating processes. Theoretical Computer Science, 26(1-2):105-120, Sep 1983.
  80. C A R Hoare. 1983 technology forecast. Electronic Design, Jan 1983.
  81. C A R Hoare. Notes on communicating sequential processes. Technical Monograph PRG-33, Oxford University Computing Laboratory, Programming Research Group, Wolfson Building, Parks Road, Oxford, OX1 3QD., Aug 1983.
  82. C A R Hoare. Programming is an engineering profession. In P J L Wallis, editor, State of the Art Report 11, No 3: Software Engineering, pages 77-84. Pergamon/Infotech, 1983. Also Oxford Technical Monograph PRG-27.
  83. E R Olderog and C A R Hoare. Specification-oriented semantics for communicating processes. In J. Diaz, editor, Automata, Languages and Programming -- Proceedings of the 10th International Colloquium, Barcelona July 18-22. Lecture Notes in Computer Science 154, pages 561-572. Springer-Verlag, 1983.
  84. S D Brookes, C A R Hoare and A W Roscoe. A theory of communicating sequential processes. Journal of the Association for Computing Machinery, 31:560-599, 1984.
  85. C A R Hoare. Programming: Sorcery or science. IEEE Software, 1(2):5-16, Apr 1984.
  86. C A R Hoare and A W Roscoe. Programs as executable predicates. In Proceedings of the International Conference on Fifth Generation Computer Systems, November 6-9 1984, Tokyo, Japan, pages 220-228. ICOT, 1984.
  87. C A R Hoare. Communicating sequential processes. Prentice-Hall International series in computing science. Prentice-Hall International, Englewood Cliffs, N J London, 1985
  88. C A R Hoare. A couple of novelties in the propositional calculus. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, 31(2):173-178, 1985.
  89. C A R Hoare. Notes on communicating systems. In M. Broy, editor, Control Flow and Data Flow: Concepts of Distributed Programming. Proceedings of NATO Advanced Study Institute International Summer School, Marktoberdorf, 31 July - 12 August, 1984, pages 123-204. Springer-Verlag, 1985.
  90. C A R Hoare. Programs are predicates. In C A R Hoare and J C Shepherdson, editors, Mathematical Logic and Programming Languages, pages 141 - 155. Prentice-Hall International, 1985. A Discussion Meeting of the Royal Society of London.
  91. C A R Hoare and C C Morgan. Specification of a simplified network service in CSP. In B T Denvir, W T Harwood and M I Jackson, editors, LNCS 207 - The Analysis of Concurrent Systems, Cambridge, September 1983, Proceedings, pages 345-353. Springer-Verlag, 1985.
  92. C C Morgan and C A R Hoare. Specification of a simplified network service in Z. In B T Denvir, W T Harwood and M I Jackson, editors, LNCS 207 -- The Analysis of Concurrent Systems, Cambridge, September 1983, Proceedings, pages 345-353. Springer-Verlag, 1985.
  93. C A R Hoare. The mathematics of programming. Oxford University Press, 1986.
  94. C A R Hoare and J He. Algebraic specification and proof of properties of a mail service. In L. Meertens, editor, IFIP WG 2.1 Working Conference on Program Specification and Transformations, Bad-Tölz, W. Germany 15-17 April. North-Holland Publishers, 1986.
  95. C A R Hoare and J He. The weakest prespecification I. Fundamenta Informaticae, 9(1):51-84, Mar 1986.
  96. C A R Hoare and J He. The weakest prespecification II. Fundamenta Informaticae, 9:217-252, 1986.
  97. E R Olderog and C A R Hoare. Specification-oriented semantics for communicating processes. Acta Informatica, 23:9-66, 1986.
  98. A W Roscoe and C A R Hoare. Laws of occam programming. Technical Monograph PRG-53, Oxford University Computing Laboratory, Programming Research Group, Wolfson Building, Parks Road, Oxford, OX1 3QD., Feb 1986.
  99. A I Enikeev, C A R Hoare and A Teruel. RUSSIAN TITLE: Model of a theory of communicating sequential processes for menu-dialog systems. Mathematica, 3, 1987. In Russian.
  100. J He and C A R Hoare. Algebraic specification and proof of a distributed recovery algorithm. Distributed Computing, 2(1):1-12, 1987.
  101. C A R Hoare. An overview of some formal methods for program design. IEEE Computer Journal, 20(9):85-91, Sep 1987.
  102. C A R Hoare and J He. Design and proof of a mail service. In O. Friesen and F. Golshani, editors, 6th Annual International Phoenix Conference on Computers and Communications -- Conference Proceedings Scottsdale, AZ, USA 25-27 February, 1987, pages 272-5. IEEE, 1987.
  103. C A R Hoare and J He. The weakest prespecification. Information Processing Letters, 24(2):127-32, Jan 1987.
  104. C A R Hoare, J He and J W Sanders. Prespecification in data refinement. Information Processing Letters, 25(2):71-6, May 1987.
  105. C A R Hoare and M J C Gordon. Partial correctness of C-mos switching circuits: an exercise in applied logic. In Proc. 3rd Ann. Symp. on Logic in Computer Science, pages 28-36, 1988. Edinburgh.
  106. C A R Hoare. Formal methods in computer system design. Computer Physics Communications, 57:206-210, 1989.
  107. C A R Hoare. Notes on an approach to category theory for computer scientists. In M. Broy, editor, Constructive Methods in Computing Science, volume 55 of Series F: Computer and Systems Sciences, pages 245-310. Springer-Verlag, 1989.
  108. C A R Hoare. The varieties of programming language. In Proc TAPSOFT, volume 351 of LNCS, pages 1-18. Springer, 1989.
  109. M B Josephs, C A R Hoare and J He. A theory of asynchronous processes. Technical Report TR-6-89, Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD., 1989.
  110. J He, C A R Hoare and M B Josephs. A theory of synchrony and asynchrony. In Programming Concepts and Methods, pages 459-478. North-Holland, 1990.
  111. C A R Hoare. Data refinement in a categorical setting. Technical Monograph PRG-90, Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD., 1990.
  112. C A R Hoare. Fixed points of increasing functions. Information Processing Letters, 34:111-112, 1990.
  113. C A R Hoare. Let's make models. In Keynote address In Concur 90, volume 458 of Lecture Notes in Computer Science, page 32. Springer-Verlag, 1990.
  114. C A R Hoare. A theory for the derivation of cmos circuit designs. In W. Feijen, D. Gries and N. van Gasteren, editors, Beauty is our Business. Springer-Verlag, 1990.
  115. C A R Hoare and J He. Categorical semantics for programming languages. In Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science, Berlin, 1990. Springer-Verlag.
  116. C A R Hoare and J He. Refinement Algebra Proves Correctness of compiler. In Lecture Notes of International Summer School at Markorbdorf, 1990. Springer-Verlag, 1990.
  117. C A R Hoare and J He. Refinement algebra proves correctness of compiling specifications. Technical Report TR-6-90, Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD., 1990.
  118. C A R Hoare and J He. Refinement algebra proves correctness of compiling specifications. In BCS Refinement Workshop, Workshops in Computing. Springer-Verlag, 1990. Published in colloboration with the British Computer Society, London. Keynote Address.
  119. C A R Hoare, J He, J P Bowen and P K Pandya. An algebraic approach to verifiable compiling specification and prototyping of the ProCoS level 0 programming language. In ESPRIT '90 Conference Proceedings, pages 804-818. Kluwer Academic Publishers, 1990.
  120. C A R Hoare. A theory for derivation of combinational C-mos circuit designs. Theoretical Computer Science, 90:209-251, 1991.
  121. C A R Hoare. A theory of conjunction and concurrency. In Parallel Architectures (Parbase '90), pages 18-27. IEEE Computer Security Press, 1991. Keynote Address.
  122. C A R Hoare. The transputer and occam : A personal story. Concurrency: Practice and Experience, 3(4):249-264, 1991.
  123. C A R Hoare and Chao Chen Zhou. A model for synchronous switching circuits and its theory of correctness. In Designing Correct Circuits, pages 196-211. Springer-Verlag, 1991.
  124. C E Martin, C A R Hoare and J He. Pre-adjunctions in order enriched categories. Mathematical Structures in Computer Science, 1:141-158, 1991.
  125. C A R Hoare. Algebra and models. In M. Broy, editor, Program Design Calculi, volume 118 of NATO Advanced Science Institutes Series F, pages 161-195. Springer-Verlag, 1992.
  126. C A R Hoare, A P Ravn and C Zhou. A calculus of durations. Information Processing Letters, 40(5):269-276, 1992.
  127. J He and C A R Hoare. From algebra to operational semantics. Information Processing Letters, 46(2), 1993.
  128. C A R Hoare. Mathematics of Programming: Mathematical Laws Help Programmers Control the Complexity of Tasks, pages 135-154. Kluwer Academic, 1993.
  129. C A R Hoare. Programs are predicates. ICOT Journal, 38:2-15, 1993. Invited Lecture.
  130. C A R Hoare. Why software engineering at a communications meeting? In D E N Davies, C Hilsum and A W Rudge, editors, Communications After AD 2000, pages 215-224. The Royal Society and Chapman Hall, 1993.
  131. C A R Hoare, J He and A Sampaio. Normal form approach to compiler design. Acta Informatica, 30:701-739, 1993.
  132. C A R Hoare. Foreword. In J P Bowen, editor, Towards Verified Systems, volume 2 of Real-Time Safety Critical Systems, pages xvii-xviii. Elsevier, 1994.
  133. C A R Hoare. Guest editorial. Journal of Logic and Computation, 4(3):215-216, 1994.
  134. C A R Hoare and I Page. Hardware and software: The closing gap. Transputer Communications, 2(2):69-90, Jun 1994.
  135. C A R Hoare. Algebra and models. In I Wand and R Milner, editors, Computing Tomorrow, pages 158-187. Cambridge University Press, 1995.
  136. B von Karger and C A R Hoare. Sequential calculus. Information Processing Letters, 53:123-130, 1995.
  137. J P Bowen, C A R Hoare, H Langmaack, E-R Olderog and A P Ravn. A procos II project final report: Esprit basic research project 7071, 1996. Bulletin of the European Association for Theoretical Computer Science ( EATCS). No. 59.
  138. C A R Hoare. Algebra and models. In Computing Tomorrow, pages 158-187. Cambridge University Press, 1996.
  139. C A R Hoare. Unification of theories: a challenge for computing science. In Magne Haveraaen, Olaf Owe and Ole-Johan Dahl, editors, In recent Trends in Data Type Specification (11th Workshop on Specification of Abstract Data Types 1995), Lecture Notes in Computer Science 1130, 1996.
  140. C A R Hoare. Algebra and models. In I. Wand and R. Milner, editors, Computing Tomorrow, pages 158-187. Cambridge University Press, 1996.
  141. C A R Hoare. How did software get so reliable without proof? In Marie-Claude Gaudel and James Woodcock, editors, FME 96: Industrial Benefit and Advances in Formal Methods, pages 1-17. Oxford University Computing Laboratory, Mar 1996.
  142. C A R Hoare. The logic of engineering design. Microprocessing and Microprogramming, 41:525-539, 1996.
  143. C A R Hoare. Preface to An axiomatic basis for computer programming. In Great Papers in Computer Science, chapter 137. West Publishing Co, 1996.
  144. C A R Hoare. Preface to An axiomatic definition of the programming language. In Great Papers in Computer Science, chapter 139. West Publishing Co, 1996.
  145. C A R Hoare. Preface to Proof of correctness of data representations. In Great Papers in Computer Science, chapter 138. West Publishing Co, 1996.
  146. C A R Hoare. Preface to Quicksort. In Great Papers in Computer Science, chapter 140. West Publishing Co, 1996.
  147. C A R Hoare and Jifeng He. Unifying theories for parallel programming. In C Lengauer and M Griebl, editors, In Europar 97 Parallel Processing, Lecture Notes in Computer Science 1300, 1997.
  148. C A R Hoare and H Jifeng. Unifying theories of concurrency. In Key address in EuroPar'97, 1997.
  149. C A R Hoare, H Jifeng and A Sampiao. Algebraic derivation of an operational semantics. In Milner's Festschrift. MIT Press, 1997.
  150. H Jifeng and C A R Hoare. Linking theories in probabilistic programming. In Proceeding of SBLP'97, 1997.
  151. C A R Hoare. The science of computing and the engineering of software, 1998. Also included is.
  152. C A R Hoare. The science of computing and the engineering of software, 1998. Huygens Lecture.
  153. C A R Hoare and H Jifeng. A trace model for pointers and objects, 1998.
  154. C A R Hoare and He Jifeng. Unifying Theories of Programming. Prentice Hall, 1998.
  155. H Jifeng and C A R Hoare. Unifying theories of probabilistic programming. 1998.

This bibliography was automatically generated on 1 Oct 99.
We apologise for any errors caused by automated processing.

Tony Hoare's Home Page

Cambridge Group's home page.

©2008 Microsoft Corporation. All rights reserved. Terms of Use |Trademarks |Privacy Statement