scispace - formally typeset
Search or ask a question
Author

A. W. Roscoe

Bio: A. W. Roscoe is an academic researcher from University of Oxford. The author has contributed to research in topics: Hoare logic. The author has an hindex of 1, co-authored 1 publications receiving 15 citations.
Topics: Hoare logic

Papers
More filters
Book ChapterDOI
01 Jan 2010
TL;DR: The development of Tony Hoare's work is examined through a review of the development of some of his most influential pieces of work such as Hoare logic, CSP and Unifying Theories.
Abstract: Tony Hoare’s many contributions to computing science are marked by insight that was grounded in practical programming. Many of his papers have had a profound impact on the evolution of our field; they have moreover provided a source of inspiration to several generations of researchers. We examine the development of his work through a review of the development of some of his most influential pieces of work such as Hoare logic, CSP and Unifying Theories.

15 citations


Cited by
More filters
DOI
30 Dec 1899
TL;DR: In this paper, the mathematical theory of computation is discussed and several descriptive formalisms with a few examples of their use and theories that enable to prove the equivalence of computations expressed in these formalisms are also presented.
Abstract: Publisher Summary This chapter discusses the mathematical theory of computation. Computation essentially explores how machines can be made to carry out intellectual processes. Any intellectual process that can be carried out mechanically can be performed by a general purpose digital computer. There are three established directions of mathematical research that are relevant to the science of computation—namely, numerical analysis, theory of computability, and theory of finite automata. The chapter explores what practical results can be expected from a suitable mathematical theory. Further, the chapter presents several descriptive formalisms with a few examples of their use and theories that enable to prove the equivalence of computations expressed in these formalisms. A few mathematical results about the properties of the formalisms are also presented.

416 citations

01 Jan 1981
TL;DR: Ambiguities and insecurities in the programming language Pascal are discussed and ideas to address these issues are proposed.
Abstract: Ambiguities and insecurities in the programming language Pascal are discussed.

104 citations

Journal Article
TL;DR: This paper develops Brinch-Hansen's concept of a monitor as a method of structuring an operating system, introduces a form of synchronization, describes a possible method of implementation in terms of semaphores and gives a suitable proof rule.
Abstract: This paper develops Brinch-Hansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization, describes a possible method of implementation in terms of semaphores and gives a suitable proof rule. Illustrative examples include a single resource scheduler, a bounded buffer, an alarm clock, a buffer pool, a disk head optimizer, and a version of the problem of readers and writers.

79 citations

Dissertation
01 Jan 1982
TL;DR: This thesis introduced much of the theory for Hoare's CSP, including the failures and failures-divergences model and methods of proving properties of processes based on metric, order and topological structures.
Abstract: (Brief abstract written by the author in 2011 since I don't have the original to hand.)This thesis introduced much of the theory for Hoare's CSP, including the failures and failures-divergences model and methods of proving properties of processes based on metric, order and topological structures. The final chapter investigates the structures underlying operational semantics.

47 citations