## Reflections on the Work of C.A.R. HoareCliff B. Jones, A.W. Roscoe, Kenneth R. Wood Written in honor of Sir Tony Hoare's 75th Birthday, this book provides a discussion of the influence of Hoare's work on current research from an international selection of expert contributors. Includes a scientific biography, listing his most influential work. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

Chapter 2
From CSP to Game Semantics | 33 |

Chapter 3
On Mereologies in Computing Science | 46 |

Chapter 4
Roles Stacks Histories A Triple for Hoare | 71 |

Chapter 5
Forward with Hoare | 101 |

Chapter 6 Probabilistic Programming with Coordination | 122 |

Chapter 7
The Operational Principle and Problem Frames | 143 |

Chapter 8
The Role of Auxiliary Variables in the Formal Development of Concurrent Programs | 167 |

Chapter 10
Unfolding CSP | 213 |

Chapter 11
Quicksort Combining Concurrency Recursion and Mutable Data Structures | 229 |

Chapter 12
The ThousandandOne Cryptographers | 255 |

Chapter 13
On ProcessAlgebraic Extensions of Metric Temporal Logic | 283 |

Chapter 14
Fun with Type Functions | 301 |

Chapter 15
On CSP and the Algebraic Theory of Effects | 332 |

Chapter 16
CSP is Expressive Enough for | 371 |

Chapter 17
The Tokeneer Experiments | 405 |

### Other editions - View all

Reflections on the Work of C.A.R. Hoare Cliff Jones,A.W. Roscoe,Kenneth R. Wood No preview available - 2010 |

Reflections on the Work of C. A. R. Hoare Cliff B. Jones,A. W. Roscoe,Kenneth R. Wood No preview available - 2010 |

Reflections on the Work of C.A.R. Hoare Cliff Jones,A.W. Roscoe,Kenneth R. Wood No preview available - 2014 |

### Common terms and phrases

abstraction action algebra argument axioms behaviour bigraphs bisimilarity bisimulation Bjørner C.A.R. Hoare calculus checking Communicating Sequential Processes communication Computer Science concurrency connectors construction constructors cryptographers CSP models defined definition denote domain environment equations equivalent example execution expression external choice finitary finite fixpoint formal formula fresh names functional programming game semantics given Hoare logic Hoare’s implementation infinite initial input interaction Lecture Notes Lemma logic mereology monad nondeterministic normal form Notes in Computer operational principle operational semantics Oxford paper parallel composition postcondition precondition predicate problem process calculi programming language proof properties protocol Quicksort recursion refinement relabelling rely/guarantee requirement rules Section sequential simple entities specification Springer sprintf sscanf structure subproblem syntax Theorem theory Tony Hoare type functions type system type-check variables verifying void safety void-safe