rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Concurrency, Security, and Puzzles
    sub title: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
  name:
    name part: Gibson-Robinson, Thomas.
    role:
      role term: editor.
  name:
    name part: Hopcroft, Philippa.
    role:
      role term: editor.
  name:
    name part: Lazić, Ranko.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2017
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVIII, 319 p. 58 illus. online resource.
  abstract: 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.
  table of contents: Bill Roscoe, on his 60th Birthday -- A Tribute to Bill Roscoe, on the Occasion of his 60th Birthday -- Herding Cats, Oxford Style -- Stealthy Protocols: Metrics and Open Problems -- A Specification Theory of Real-Time Processes -- Towards Verification of Cyber-Physical Systems with UTP and Isabelle/HOL -- FDR: From Theory to Industrial Application -- Information Flow, Distributed Systems, and Refinement, by Example -- Abstractions for Transition Systems with Applications to Stubborn Sets -- A Hybrid Relational Modelling Language -- What Makes Petri Nets Harder to Verify: Stack or Data -- Analysing Lock-Free Linearizable Datatypes Using CSP -- Discrete Random Variables over Domains, Revisited -- A Demonic Lattice of Information -- A Brief History of Security Protocols -- More Stubborn Set Methods for Process Algebras -- A Branching Time Model of CSP -- Virtualization Based Development. .
  note: edited by Thomas Gibson-Robinson, Philippa Hopcroft, Ranko Lazić.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Computer programming
  subject:
    topic: Software engineering
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer Science
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Software Engineering
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Programming Techniques
  classification: QA76.9.L63
  classification: QA76.5913
  classification: QA76.63
  classification: 005.1015113
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 10160
  identifier: 9783319510460
  identifier: http://dx.doi.org/10.1007/978-3-319-51046-0
  record info:
    record creation date: 161217
    record change date: 20161217071929.0
    record identifier: 978-3-319-51046-0