Advertisement

Concurrency, Security, and Puzzles

Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday

  • Thomas Gibson-Robinson
  • Philippa Hopcroft
  • Ranko Lazić

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10160)

Also part of the Programming and Software Engineering book sub series (LNPSE, volume 10160)

Table of contents

  1. Front Matter
    Pages I-XVIII
  2. Olga Chen, Catherine Meadows, Gautam Trivedi
    Pages 1-17
  3. Chris Chilton, Marta Kwiatkowska, Faron Moller, Xu Wang
    Pages 18-38
  4. Thomas Gibson-Robinson, Guy Broadfoot, Gustavo Carvalho, Philippa Hopcroft, Gavin Lowe, Sidney Nogueira et al.
    Pages 65-87
  5. He Jifeng, Li Qin
    Pages 124-143
  6. Ranko Lazić, Patrick Totzke
    Pages 144-161
  7. Carroll Morgan
    Pages 203-222
  8. Peter Y. A. Ryan
    Pages 223-245
  9. Rob van Glabbeek
    Pages 272-293
  10. Jay Yantchev, Atanas Parashkevov
    Pages 294-318
  11. Back Matter
    Pages 319-319

About this book

Introduction

This festschrift was written in honor of Andrew William (Bill) Roscoe on the occasion of his 60th birthday, and features tributes by Sir Tony Hoare, Stephen Brookes, and Michael Wooldridge.  Bill Roscoe is an international authority in process algebra, and has been the driving force behind the development of the FDR refinement checker for CSP.  He is also world renowned for his pioneering work in analyzing security protocols, modeling information flow, human-interactive security, and much more. 
Many of these areas are reflected in the 15 invited research articles in this festschrift, and in the presentations at the "BILL-60" symposium held in Oxford, UK, on January 9 and 10, 2017.

Keywords

formal methods model checking process algebra substitutive refinement verification computer security concurrency theory cryptographic protocols domain theory formal language and semantics formal verification hybrid systems reactive/controller synthesis sequential domain monoids specification theory timed automata topology unifying theories of programming verification tools weakest congruence

Editors and affiliations

  • Thomas Gibson-Robinson
    • 1
  • Philippa Hopcroft
    • 2
  • Ranko Lazić
    • 3
  1. 1.University of OxfordOxfordUnited Kingdom
  2. 2.University of OxfordOxfordUnited Kingdom
  3. 3.University of WarwickCoventryUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-51046-0
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-51045-3
  • Online ISBN 978-3-319-51046-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Aerospace