Cantitate/Preț
Produs

Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday: Lecture Notes in Computer Science, cartea 10160

Editat de Thomas Gibson-Robinson, Philippa Hopcroft, Ranko Lazić
en Limba Engleză Paperback – 18 dec 2016
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 58897 lei

Preț vechi: 73621 lei
-20%

Puncte Express: 883

Preț estimativ în valută:
11284 12223$ 9677£

Carte tipărită la comandă

Livrare economică 06-13 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319510453
ISBN-10: 3319510452
Pagini: 319
Ilustrații: XVIII, 319 p. 58 illus.
Dimensiuni: 155 x 235 mm
Greutate: 5.15 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering

Locul publicării:Cham, Switzerland

Cuprins

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. 

Caracteristici

Includes supplementary material: sn.pub/extras