Trustworthy Global Computing (eBook, PDF)

7th International Symposium, TGC 2012, Newcastle upon Tyne, UK, September 7-8, 2012, Revised Selected Papers
Redaktion: Palamidessi, Catuscia; Ryan, Mark D.

• Format: PDF

Produktbeschreibung

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Symposium on Trustworthy Global Computing, TGC 2012, held in Newcastle upon Tyne, UK, in September 2012. The 9 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 14 submissions. The papers cover a wide range of topics in the area of global computing and reliable computation in the so-called global computers, i.e., those computational abstractions emerging in large-scale infrastructures such as service-oriented architectures, autonomic systems and cloud computing, providing frameworks, tools, algorithms and protocols for designing open-ended, large-scale applications and for reasoning about their behavior and properties in a rigorous way.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer-Verlag GmbH
• Seitenzahl: 213
• Erscheinungstermin: 4. September 2013
• Englisch
• ISBN-13: 9783642411571
• Artikelnr.: 44134252

Inhaltsangabe

From Rational Number Reconstruction to Set Reconciliation and File Synchronization.- Affine Refinement Types for Authentication and Authorization.- Seamless Distributed Computing from the Geometry of Interaction.- A Beginner's Guide to the DeadLock Analysis Model.- Formal Modeling and Reasoning about the Android Security Framework.- A Type System for Flexible Role Assignment in Multiparty Communicating Systems.- A Multiparty Multi-session Logic.- LTS Semantics for Compensation-Based Processes.- Linking Unlinkability.- Towards Quantitative Analysis of Opacity.- An Algebra for Symbolic Diffie-Hellman Protocol Analysis.- Security Analysis in Probabilistic Distributed Protocols via Bounded Reachability.- Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus.