Concurrency, Security, and Puzzles Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Gibson-Robinson, Thomas (Επιμελητής έκδοσης), Hopcroft, Philippa (Επιμελητής έκδοσης), Lazić, Ranko (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2017.
• Σειρά: Lecture Notes in Computer Science, 10160
• Θέματα: Computer science.; Computer communication systems.; Computer programming.; Software engineering.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer Science.; Logics and Meanings of Programs.; Software Engineering.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.; Computer Communication Networks.; Programming Techniques.

 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. 

 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. .