Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDC. A. R. Hoare
Tony Hoare – Charles Antony Richard Hoare
Person information
- award (1980): Turing Award
- award (2011): IEEE John von Neumann Medal
- award (2011): Programming Languages Achievement Award
- award (1990): Computer Pioneer Award
- award (1981): Harry H. Goode Memorial Award
- award: Kyoto Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[c91]Tony Hoare, Alexandra Mendes, João F. Ferreira:
Logic, Algebra, and Geometry at the Foundation of Computer Science. FMTea 2019: 3-20- [c90]Tony Hoare, Georg Struth, Jim Woodcock:
A Calculus of Space, Time, and Causality: Its Algebra, Geometry, Logic. UTP 2019: 3-21 - 2016
- [j81]Tony Hoare, Stephan van Staden, Bernhard Möller, Georg Struth, Huibiao Zhu:
Developments in concurrent Kleene algebra. J. Log. Algebraic Methods Program. 85(4): 617-636 (2016) - [c89]Bernhard Möller, Tony Hoare, Martin E. Müller, Georg Struth:
A Discrete Geometric Model of Concurrent Program Execution. UTP 2016: 1-25 - 2015
- [c88]Bernhard Möller, Tony Hoare:
Exploring an Interface Model for CKA. MPC 2015: 1-29 - 2014
- [j80]Tony Hoare, Stephan van Staden:
The laws of programming unify process calculi. Sci. Comput. Program. 85: 102-114 (2014) - [c87]Tony Hoare, Stephan van Staden, Bernhard Möller, Georg Struth, Jules Villard, Huibiao Zhu, Peter W. O'Hearn:
Developments in Concurrent Kleene Algebra. RAMICS 2014: 1-18 - [c86]Tony Hoare:
Laws of Programming: The Algebraic Unification of Theories of Concurrency. CONCUR 2014: 1-6 - [c85]Tony Hoare:
Laws of concurrent programming. PLDI 2014: 168 - 2013
- [c84]Tony Hoare:
Unifying Semantics for Concurrent Programming. Computation, Logic, Games, and Quantum Foundations 2013: 139-149 - [c83]Tony Hoare:
Generic Models of the Laws of Programming. Theories of Programming and Formal Methods 2013: 213-226 - [c82]Tony Hoare:
Laws of programming with concurrency (Invited Talk). ICCSW 2013: 1-1 - 2012
- [j79]Tony Hoare, Stephan van Staden:
In praise of algebra. Formal Aspects Comput. 24(4-6): 423-431 (2012) - [c81]Tony Hoare:
Net Models for Concurrent Object Behaviour. Petri Nets 2012: 1-2 - [c80]Tony Hoare:
Algebra of concurrent design. FMCAD 2012: 5 - [c79]Tony Hoare, Stephan van Staden:
The Laws of Programming Unify Process Calculi. MPC 2012: 7-22 - [c78]Tony Hoare:
Message of thanks: on the receipt of the 2011 ACM SIGPLAN distinguished achievement award. POPL 2012: 3-6 - [c77]Stephan van Staden, Tony Hoare:
Algebra Unifies Operational Calculi. UTP 2012: 88-104 - 2011
- [j78]Tony Hoare, Bernhard Möller, Georg Struth, Ian Wehrman:
Concurrent Kleene Algebra and its Foundations. J. Log. Algebraic Methods Program. 80(6): 266-296 (2011) - [c76]Tony Hoare:
Recovery Blocks. Dependable and Historic Computing 2011: 261-266 - [c75]C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth:
On Locality and the Exchange Law for Concurrent Processes. CONCUR 2011: 250-264 - [p6]Tony Hoare, John Wickerson:
Unifying Models of Data Flow. Software and Systems Safety - Specification and Verification 2011: 211-230 - [e2]Manfred Broy, Christian Leuxner, Tony Hoare:
Software and Systems Safety - Specification and Verification. NATO Science for Peace and Security Series - D: Information and Communication Security 30, IOS Press 2011, ISBN 978-1-60750-710-9 [contents] - 2010
- [j77]Tony Hoare:
Fine-grain concurrency. Concurr. Comput. Pract. Exp. 22(8): 912-934 (2010) - [j76]Jifeng He, Tony Hoare:
CSP is a retract of CCS. Theor. Comput. Sci. 411(11-13): 1311-1337 (2010) - [c74]Tony Hoare, Natarajan Shankar:
Unraveling a Card Trick. Essays in Memory of Amir Pnueli 2010: 195-201 - [c73]Shuvendu K. Lahiri, Kapil Vaswani, C. A. R. Hoare:
Differential static analysis: opportunities, applications, and challenges. FoSER 2010: 201-204 - [c72]Tony Hoare:
Testing and Proving, Hand-in-Hand. TAIC PART 2010: 5-6
2000 – 2009
- 2009
- [j75]C. A. R. Hoare:
Viewpoint - Retrospective: an axiomatic basis for computer programming. Commun. ACM 52(10): 30-32 (2009) - [j74]C. A. R. Hoare, Jayadev Misra:
Preface to special issue on software verification. ACM Comput. Surv. 41(4): 18:1-18:3 (2009) - [j73]C. A. R. Hoare, Jayadev Misra, Gary T. Leavens, Natarajan Shankar:
The verified software initiative: A manifesto. ACM Comput. Surv. 41(4): 22:1-22:8 (2009) - [j72]Ian Wehrman, C. A. R. Hoare, Peter W. O'Hearn:
Graphical models of separation logic. Inf. Process. Lett. 109(17): 1001-1004 (2009) - [c71]C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman:
Foundations of Concurrent Kleene Algebra. RelMiCS 2009: 166-186 - [c70]C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman:
Concurrent Kleene Algebra. CONCUR 2009: 399-414 - 2008
- [j71]Tony Hoare:
Verification of Fine-grain Concurrent Programs. Electron. Notes Theor. Comput. Sci. 209: 165-171 (2008) - [j70]Tony Hoare, Peter W. O'Hearn:
Separation Logic Semantics for Communicating Processes. Electron. Notes Theor. Comput. Sci. 212: 3-25 (2008) - [c69]Tony Hoare:
Keynote: A Vision for the Science of Computing. BCS Int. Acad. Conf. 2008: 1-29 - [c68]Tony Hoare:
Verified Software: Theories, Tools, Experiments. ICECCS 2008: 3 - [c67]Tony Hoare:
Fine-Grain Concurrency. LASER Summer School 2008: 1-20 - [c66]Tony Hoare:
Compensable Transactions. LASER Summer School 2008: 21-40 - 2007
- [j69]Tony Hoare:
The Ideal of Program Correctness: Third Computer Journal Lecture. Comput. J. 50(3): 254-260 (2007) - [c65]Tony Hoare:
Science and Engineering: A Collusion of Cultures. DSN 2007: 2-9 - [c64]Tony Hoare:
Fine-grain Concurrency. CPA 2007: 1-19 - 2006
- [j68]Tony Hoare:
Why ever CSP? Electron. Notes Theor. Comput. Sci. 162: 209-215 (2006) - [j67]Bernhard Beckert, Tony Hoare, Reiner Hähnle
, Douglas R. Smith, Cordell Green, Silvio Ranise, Cesare Tinelli, Thomas Ball, Sriram K. Rajamani:
Intelligent Systems and Formal Methods in Software Engineering. IEEE Intell. Syst. 21(6): 71-81 (2006) - [j66]Juan Bicarregui, C. A. R. Hoare, J. C. P. Woodcock:
The verified software repository: a step towards the verifying compiler. Formal Aspects Comput. 18(2): 143-151 (2006) - [c63]Tony Hoare:
The ideal of verified software. ACL2 2006: 61-62 - [c62]Tony Hoare:
The Ideal of Verified Software. CAV 2006: 5-16 - [c61]Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Marc Shapiro:
Proving correctness of highly-concurrent linearisable objects. PPOPP 2006: 129-136 - [c60]Jifeng He, C. A. R. Hoare:
CSP Is a Retract of CCS. UTP 2006: 38-62 - 2005
- [j65]Tony Hoare, Robin Milner:
Grand Challenges for Computing Research. Comput. J. 48(1): 49-52 (2005) - [c59]Roberto Bruni, Michael J. Butler, Carla Ferreira, C. A. R. Hoare, Hernán C. Melgratti, Ugo Montanari:
Comparing Two Approaches to Compensable Flow Composition. CONCUR 2005: 383-397 - [c58]Jifeng He, C. A. R. Hoare:
Linking Theories of Concurrency. ICTAC 2005: 303-317 - [c57]C. A. R. Hoare:
The Verifying Compiler, a Grand Challenge for Computing Research. VMCAI 2005: 78-78 - [c56]Tony Hoare, Jayadev Misra:
Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project. VSTTE 2005: 1-18 - 2004
- [c55]C. A. R. Hoare:
Process Algebra: A Unifying Approach. 25 Years Communicating Sequential Processes 2004: 36-60 - [c54]C. A. R. Hoare:
Towards the Verifying Compiler. Essays in Memory of Ole-Johan Dahl 2004: 124-136 - [c53]Michael J. Butler, C. A. R. Hoare, Carla Ferreira:
A Trace Semantics for Long-Running Transactions. 25 Years Communicating Sequential Processes 2004: 133-150 - [c52]Cédric Fournet, C. A. R. Hoare, Sriram K. Rajamani, Jakob Rehof:
Stuck-Free Conformance. CAV 2004: 242-254 - 2003
- [j64]C. A. R. Hoare:
Assertions: A Personal Perspective. IEEE Ann. Hist. Comput. 25(2): 14-25 (2003) - [j63]C. A. R. Hoare:
The verifying compiler: A grand challenge for computing research. J. ACM 50(1): 63-69 (2003) - [c51]C. A. R. Hoare:
The Verifying Compiler: A Grand Challenge for Computing Research. CC 2003: 262-272 - [c50]C. A. R. Hoare:
The Verifying Compiler: A Grand Challenge for Computing Research. Ershov Memorial Conference 2003: 1-12 - [c49]C. A. R. Hoare:
The Verifying Compiler: A Grand Challenge for Computing Research. Euro-Par 2003: 1 - [c48]C. A. R. Hoare:
The Verifying Compiler: A Grand Challange for Computing Research. JMLC 2003: 25-35 - 2002
- [j62]Robert S. Boyer, W. H. J. Feijen, David Gries, C. A. R. Hoare, Jayadev Misra, J. Moore, H. Richards:
In memoriam: Edsger W. Dijkstra 1930-2002. Commun. ACM 45(10): 21-22 (2002) - [c47]C. A. R. Hoare:
Assertions in Modern Software Engineering Practice. COMPSAC 2002: 459-462 - [c46]C. A. R. Hoare:
Assertions in Programming: From Scientific Theory to Engineering Practice. Soft-Ware 2002: 350-351 - [c45]C. A. R. Hoare:
Towards the Verifying Compiler. 10th Anniversary Colloquium of UNU/IIST 2002: 151-160 - [p5]C. A. R. Hoare:
Assertions: A Personal Perspective. Software Pioneers 2002: 356-366 - [p4]C. A. R. Hoare:
An Axiomatic Basis for Computer Programming (Reprint). Software Pioneers 2002: 367-383 - [p3]C. A. R. Hoare:
Proof of Correctness of Data Representations (Reprint). Software Pioneers 2002: 385-396 - 2001
- [j61]C. A. R. Hoare:
Legacy. Inf. Process. Lett. 77(2-4): 123-129 (2001) - [c44]C. A. R. Hoare:
Growing Use of Assertions. TOOLS (38) 2001: 3 - 2000
- [j60]C. A. R. Hoare:
A Hard Act to Follow. High. Order Symb. Comput. 13(1/2): 71-72 (2000) - [c43]Jifeng He, C. A. R. Hoare:
Unifying theories of healthiness condition. APSEC 2000: 70- - [c42]C. A. R. Hoare, Jifeng He, Augusto Sampaio:
Algebraic derivation of an operational semantics. Proof, Language, and Interaction 2000: 77-98 - [c41]C. A. R. Hoare:
Legacy Code. ICFEM 2000: 75 - [c40]C. A. R. Hoare:
Assertions. IFM 2000: 1-2
1990 – 1999
- 1999
- [j59]Jifeng He, C. A. R. Hoare:
Linking Theories in Probabilistic Programming. Inf. Sci. 119(3-4): 205-218 (1999) - [c39]C. A. R. Hoare:
Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle. Correct System Design 1999: 3-28 - [c38]C. A. R. Hoare, Jifeng He:
A Trace Model for Pointers and Objects. ECOOP 1999: 1-17 - [c37]C. A. R. Hoare:
Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle. World Congress on Formal Methods 1999: 1-27 - [c36]Silvija Seres, J. Michael Spivey, C. A. R. Hoare:
Algebra of Logic Programming. ICLP 1999: 184-199 - [c35]Simon L. Peyton Jones, Alastair Reid, Fergus Henderson, C. A. R. Hoare, Simon Marlow:
A Semantics for Imprecise Exceptions. PLDI 1999: 25-36 - 1998
- [c34]Jifeng He, C. A. R. Hoare:
Unifying theories of programming. RelMiCS 1998: 97-99 - 1997
- [c33]C. A. R. Hoare, Jifeng He:
Unifying Theories for Parallel Programming. Euro-Par 1997: 15-30 - 1996
- [j58]C. A. R. Hoare:
Unifying Theories : A Personal Statement. ACM Comput. Surv. 28(4es): 46 (1996) - [j57]C. A. R. Hoare:
The logic of engineering design. Microprocess. Microprogramming 41(8-9): 525-539 (1996) - [c32]C. A. R. Hoare:
How Did Software Get So Reliable Without Proof? FME 1996: 1-17 - [c31]C. A. R. Hoare:
The Role of Formal Techniques: Past, Current and Future or How Did Software Get so Reliable without Proof? (Extended Abstract). ICSE 1996: 233-234 - [c30]C. A. R. Hoare:
Mathematical models for computing science. NATO ASI DPD 1996: 115-164 - 1995
- [j56]Burghard von Karger, C. A. R. Hoare:
Sequential Calculus. Inf. Process. Lett. 53(3): 123-130 (1995) - [c29]C. A. R. Hoare:
Unification of Theories: A Challenge for Computing Science. COMPASS/ADT 1995: 49-57 - 1994
- [j55]C. A. R. Hoare:
Editorial. J. Log. Comput. 4(3): 215-216 (1994) - [c28]Jifeng He, C. A. R. Hoare, Martin Fränzle, Markus Müller-Olm, Ernst-Rüdiger Olderog, Michael Schenke, Michael R. Hansen, Anders P. Ravn, Hans Rischel:
Provably Correct Systems. FTRTFT 1994: 288-335 - [c27]C. A. R. Hoare, Ian Page:
Hardware and Software: The Closing Gap. Programming Languages and System Architectures 1994: 49-68 - 1993
- [j54]C. A. R. Hoare, Jifeng He, Augusto Sampaio:
Normal Form Approach to Compiler Design. Acta Informatica 30(8): 701-739 (1993) - [j53]Jifeng He, C. A. R. Hoare:
From Algebra to Operational Semantics. Inf. Process. Lett. 45(2): 75-80 (1993) - [c26]C. A. R. Hoare:
Algebra and Models. SIGSOFT FSE 1993: 1-8 - 1992
- [j52]Zhou Chaochen, C. A. R. Hoare:
A Model for Synchronous Switching Circuits and its Theory of Correctness. Formal Methods Syst. Des. 1(1): 7-28 (1992) - [c25]C. A. R. Hoare:
Programs are Predicates. FGCS 1992: 211-218 - [c24]C. A. R. Hoare:
Algebra and Models. NATO ASI PDC 1992: 161-195 - 1991
- [j51]C. A. R. Hoare:
The transputer and occam: A personal story. Concurr. Pract. Exp. 3(4): 249-264 (1991) - [j50]Zhou Chaochen, C. A. R. Hoare, Anders P. Ravn:
A Calculus of Durations. Inf. Process. Lett. 40(5): 269-276 (1991) - [j49]C. E. Martin, C. A. R. Hoare, Jifeng He:
Pre-Adjunctions in Order Enriched Categories. Math. Struct. Comput. Sci. 1(2): 141-158 (1991) - [j48]C. A. R. Hoare:
A Theory for the Derivation of Combinational C-MOS Circuit Designs. Theor. Comput. Sci. 90(1): 235-251 (1991) - 1990
- [j47]C. A. R. Hoare:
Fixed Points of Increasing Functions. Inf. Process. Lett. 34(3): 111-112 (1990) - [c23]C. A. R. Hoare:
Let's Make Models (Abstract). CONCUR 1990: 32 - [c22]Jifeng He, Mark B. Josephs, Charles Antony Richard Hoare:
A Theory of Synchrony and Asynchrony. Programming Concepts and Methods 1990: 459-478 - [c21]C. A. R. Hoare:
A Theory of Conjunction and Concurrency. PARBASE / Architectures 1990: 18-30 - [e1]Dines Bjørner, C. A. R. Hoare, Hans Langmaack:
VDM '90, VDM and Z - Formal Methods in Software Development, Third International Symposium of VDM Europe, Kiel, FRG, April 17-21, 1990, Proceedings. Lecture Notes in Computer Science 428, Springer 1990, ISBN 3-540-52513-0 [contents]
1980 – 1989
- 1989
- [c20]Jifeng He, C. A. R. Hoare:
Categorical Semantics for Programming Languages. Mathematical Foundations of Programming Semantics 1989: 402-417 - [c19]C. A. R. Hoare:
The Varieties of Programming Language. TAPSOFT, Vol.1 1989: 1-18 - 1988
- [j46]A. W. Roscoe, C. A. R. Hoare:
The Laws of Occam Programming. Theor. Comput. Sci. 60: 177-229 (1988) - [c18]C. A. R. Hoare, Michael J. C. Gordon:
Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic. LICS 1988: 28-36 - 1987
- [j45]C. A. R. Hoare, Ian J. Hayes, Jifeng He, Carroll Morgan, A. W. Roscoe, Jeff W. Sanders, Ib Holm Sørensen, J. Michael Spivey, Bernard Sufrin:
Laws of Programming. Commun. ACM 30(8): 672-686 (1987) - [j44]C. A. R. Hoare:
An Overview of Some Formal Methods for Program Design. Computer 20(9): 85-91 (1987) - [j43]Jifeng He, C. A. R. Hoare:
Algebraic Specification and Proof of a Distributed Recovery Algorithm. Distributed Comput. 2(1): 1-12 (1987) - [j42]C. A. R. Hoare, Jifeng He:
The Weakest Prespecification. Inf. Process. Lett. 24(2): 127-132 (1987) - [j41]C. A. R. Hoare, Jifeng He, Jeff W. Sanders:
Prespecification in Data Refinement. Inf. Process. Lett. 25(2): 71-76 (1987) - 1986
- [j40]Ernst-Rüdiger Olderog, C. A. R. Hoare:
Specification-Oriented Semantics for Communicating Processes. Acta Informatica 23(1): 9-66 (1986) - [c17]Jifeng He, C. A. R. Hoare, Jeff W. Sanders:
Data Refinement Refined. ESOP 1986: 187-196 - 1985
- [b2]C. A. R. Hoare:
Communicating Sequential Processes. Prentice-Hall 1985, ISBN 0-13-153271-5 - [j39]C. A. R. Hoare:
A Couple of Novelties in the Propositional Calculus. Math. Log. Q. 31(9-12): 173-178 (1985) - [c16]C. A. R. Hoare:
The Mathematics of Programming. FSTTCS 1985: 1-18 - [i1]K. T. Sridhar, C. A. R. Hoare:
JSD Expressed in CSP. Data Types and Persistence (Appin), Informal Proceedings 1985: 49-82 - 1984
- [j38]Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe:
A Theory of Communicating Sequential Processes. J. ACM 31(3): 560-599 (1984) - [j37]C. A. R. Hoare:
Programming: Sorcery or Science? IEEE Softw. 1(2): 5-16 (1984) - [c15]C. A. R. Hoare, A. W. Roscoe:
Programs as Executable Predicates. FGCS 1984: 220-228 - 1983
- [j36]C. A. R. Hoare:
An Axiomatic Basis for Computer Programming (Reprint). Commun. ACM 26(1): 53-56 (1983) - [j35]C. A. R. Hoare:
Communicating Sequential Processes (Reprint). Commun. ACM 26(1): 100-106 (1983) - [j34]Eric C. R. Hehner, C. A. R. Hoare:
A More Complete Model of Communicating Processes. Theor. Comput. Sci. 26: 105-120 (1983) - [c14]C. A. R. Hoare:
Workshop on Analysis of Concurrent Systems Attempt at problem 3: The Firing Squad. The Analysis of Concurrent Systems 1983: 115-116 - [c13]C. A. R. Hoare:
Workshop on Analysis of Concurrent Systems Attempt at Problem 10: The Matrix Switch. The Analysis of Concurrent Systems 1983: 132-133 - [c12]Carroll Morgan, C. A. R. Hoare:
Specification of a simplified Network Service in CSP. The Analysis of Concurrent Systems 1983: 345-353 - [c11]Ernst-Rüdiger Olderog, C. A. R. Hoare:
Specification-Oriented Semantics for Communicating Processes. ICALP 1983: 561-572 - 1981
- [j33]C. A. R. Hoare:
The Emperor's Old Clothes. Commun. ACM 24(2): 75-83 (1981) - [j32]C. A. R. Hoare:
A Calculus of Total Correctness for Communicating Processes. Sci. Comput. Program. 1(1-2): 49-72 (1981) - [c10]Z. C. Chen, C. A. R. Hoare:
Partial Correctness of Communicating Sequential Processes. ICDCS 1981: 1-12 - [c9]Jim Welsh, W. J. Sneeringer, C. A. R. Hoare:
Ambiguities and Insecurities in Pascal. Pascal - The Language and its Implementation 1981: 5-19 - 1980
- [c8]Richard Kennaway, C. A. R. Hoare:
A Theory of Nondeterminism. ICALP 1980: 338-350 - [p2]C. A. R. Hoare:
A Model for Communicating Sequential Processes. On the Construction of Programs 1980: 229-254
1970 – 1979
- 1979
- [j31]