Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/concurrency-security-and-puzzles/descriptif_3961105
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=3961105

0 article 

 Frais de port 0,01€*

Exclusivité web : à partir de 35 euros d’achat, frais de port à 1 centime pour les expéditions vers la France métropolitaine, la Suisse et l’UE avec Colissimo ou GLS

Concurrency, Security, and Puzzles, 1st ed. 2017 Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday Programming and Software Engineering Series

Langue : Anglais

Coordonnateurs : Gibson-Robinson Thomas, Hopcroft Philippa, Lazić Ranko

Couverture de l’ouvrage Concurrency, Security, and Puzzles

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. 

Includes supplementary material: sn.pub/extras