C. A. R. Hoare

From MaRDI portal
Revision as of 18:44, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:578899

Available identifiers

zbMath Open hoare.c-a-r-tonyWikidataQ92602 ScholiaQ92602MaRDI QIDQ578899

List of research outcomes





PublicationDate of PublicationType
On algebra of program correctness and incorrectness2023-03-30Paper
https://portal.mardi4nfdi.de/entity/Q50752902022-05-12Paper
The 1980 ACM Turing Award Lecture2022-02-14Paper
The Verified Software Initiative: A Manifesto2022-02-14Paper
Communicating Sequential Processes2022-02-14Paper
Envoi2022-02-14Paper
ACM Interview2022-02-14Paper
A calculus of space, time, and causality: its algebra, geometry, logic2020-02-18Paper
The verified software initiative2019-08-09Paper
A Discrete Geometric Model of Concurrent Program Execution2017-04-04Paper
Developments in concurrent Kleene algebra2016-06-22Paper
Algebra Unifies Operational Calculi2015-12-11Paper
Exploring an Interface Model for CKA2015-08-27Paper
Why ever CSP?2015-07-10Paper
Separation Logic Semantics for Communicating Processes2014-05-13Paper
Developments in Concurrent Kleene Algebra2014-04-16Paper
Verification of Fine-grain Concurrent Programs2014-01-17Paper
Generic Models of the Laws of Programming2013-08-16Paper
Unifying Semantics for Concurrent Programming2013-05-28Paper
In praise of algebra2013-03-22Paper
The Laws of Programming Unify Process Calculi2012-09-05Paper
Net Models for Concurrent Object Behaviour2012-09-04Paper
On Locality and the Exchange Law for Concurrent Processes2011-09-02Paper
Concurrent Kleene algebra and its foundations2011-07-18Paper
Unraveling a Card Trick2010-09-07Paper
Graphical models of separation logic2010-08-20Paper
CSP is a retract of CCS2010-03-29Paper
Foundations of Concurrent Kleene Algebra2009-12-11Paper
Concurrent Kleene Algebra2009-10-22Paper
https://portal.mardi4nfdi.de/entity/Q54473652008-03-06Paper
CSP Is a Retract of CCS2007-09-14Paper
Theoretical Aspects of Computing – ICTAC 20052006-11-01Paper
The verified software repository: a step towards the verifying compiler2006-10-25Paper
Verification, Model Checking, and Abstract Interpretation2005-12-06Paper
Communicating Sequential Processes. The First 25 Years2005-11-29Paper
Computer Aided Verification2005-08-25Paper
https://portal.mardi4nfdi.de/entity/Q47369642004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44719062004-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44178012003-07-30Paper
The mistreated model: Some technical comments on Porojan's paper on `Trade flows and spatial effects'2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q27679802002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q44938732001-12-18Paper
A hard act to follow2000-12-04Paper
Linking theories in probabilistic programming2000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q49346182000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q43645331997-11-17Paper
https://portal.mardi4nfdi.de/entity/Q48858721997-10-29Paper
https://portal.mardi4nfdi.de/entity/Q56889381997-03-11Paper
Sequential calculus1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q45368981997-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48454861995-09-12Paper
Normal form approach to compiler design1994-06-02Paper
A model for synchronous switching circuits and its theory of correctness1993-09-30Paper
https://portal.mardi4nfdi.de/entity/Q40407911993-06-05Paper
From algebra to operational semantics1993-05-16Paper
A calculus of durations1992-06-28Paper
A theory for the derivation of combination C-mos circuit designs1991-01-01Paper
Fixed points of increasing functions1990-01-01Paper
The laws of Occam programming1988-01-01Paper
Prespecification in data refinement1987-01-01Paper
Algebraic specification and proof of a distributed recovery algorithm1987-01-01Paper
The weakest prespecification1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30302441987-01-01Paper
Laws of programming1987-01-01Paper
Corrigenda: laws of programming1987-01-01Paper
Specification-oriented semantics for communicating processes1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37135771986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37402011986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37635671986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33382081985-01-01Paper
A Couple of Novelties in the Propositional Calculus1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36819111985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37098531985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37774241985-01-01Paper
Programs are predicates1984-01-01Paper
A Theory of Communicating Sequential Processes1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37008061983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47467731982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47467751982-01-01Paper
A calculus of total correctness for communicating processes1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38885221980-01-01Paper
Some Properties of Predicate Transformers1978-01-01Paper
Communicating sequential processes1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41784551978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41784581978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41784591978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41784651978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41784721978-01-01Paper
Fast Fourier transform free from tears1977-01-01Paper
Remarks on 'Program proving: Jumps and functions' by M. Clint and C.A.R. Hoare1976-01-01Paper
Quasiparallel programming1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41173581976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41188041976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41242591976-01-01Paper
Matrix reduction—an efficient method1975-01-01Paper
Recursive data structures1975-01-01Paper
Parallel programming: An axiomatic approach1975-01-01Paper
An axiomatic definition of the programming language Pascal1974-01-01Paper
Consistent and complementary formal theories of the semantics of programming languages1974-01-01Paper
Monitors1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47726971974-01-01Paper
A structured paging system1973-01-01Paper
A general conservation law for queueing disciplines1973-01-01Paper
A note on the for statement1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56815331972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56842161972-01-01Paper
Proof of a structured program: 'The sieve of Eratosthenes'1972-01-01Paper
Proof of correctness of data representations1972-01-01Paper
Proof of a program1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56262771971-01-01Paper
Program proving: KJumps and functions1971-01-01Paper
An axiomatic basis for computer programming1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55850231969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51830921968-01-01Paper
A contribution to the development of ALGOL1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57355701964-01-01Paper
The Elliott ALGOL input/output system1963-01-01Paper
Quicksort1962-01-01Paper
Quicksort1962-01-01Paper
The slide rule and how to use it: containing full, easy and simple instructions to perform all business calculation with unexampled rapidity and accuracy. (Technical Press Manuals.)1935-01-01Paper

Research outcomes over time

This page was built for person: C. A. R. Hoare