Concurrency, Security, and Puzzles
-15%
portes grátis
Concurrency, Security, and Puzzles
Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
Lazic, Ranko; Hopcroft, Philippa; Gibson-Robinson, Thomas
Springer International Publishing AG
12/2016
319
Mole
Inglês
9783319510453
15 a 20 dias
5153
Descrição não disponível.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
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
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
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
