LEADER 03016nam  22004815  450 
001 9910254066303321
005 20250717140323.0
010   $a94-6239-204-8
024 7 $a10.2991/978-94-6239-204-5
035   $a(CKB)3710000000765143
035   $a(DE-He213)978-94-6239-204-5
035   $a(MiAaPQ)EBC4614748
035   $a(PPN)19451322X
035   $a(EXLCZ)993710000000765143
100   $a20160727d2016      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aType Systems for Distributed Programs: Components and Sessions /$fby Ornela Dardha
205   $a1st ed. 2016.
210  1$aParis :$cAtlantis Press :$cImprint: Atlantis Press,$d2016.
215   $a1 online resource (XXII, 192 p. 69 illus., 4 illus. in color.) 
225 1 $aAtlantis Studies in Computing,$x2212-8565 ;$v7
311 08$a94-6239-203-X 
320   $aIncludes bibliographical references.
327   $a1.Background on Components -- 2. A Type System for Components -- 3. Properties of the Type System -- 4.Background on ?- Types -- 5. Background on Session Types -- 6. Session Types Revisited -- 7. Subtyping -- 8. Polymorphism -- 9.Higher-Order Communication -- 10.Recursion -- 11.From ?- Types to Session Types -- 12. Background on ?- types for Lock Freedom -- 13 Background on Session Types for Progress -- 14 Progress as Compositional Lock Freedom. .
330   $aIn this book we develop powerful techniques based on formal methods for the verification of correctness, consistency and safety properties related to dynamic reconfiguration and communication in complex distributed systems. In particular, static analysis techniques based on types and type systems are an adequate methodology considering their success in guaranteeing not only basic safety properties, but also more sophisticated ones like deadlock or lock freedom in concurrent settings. The main contributions of this book are twofold. i) We design a type system for a concurrent object-oriented calculus to statically ensure consistency of dynamic reconfigurations. ii) We define an encoding of the session pi-calculus, which models communication in distributed systems, into the standard typed pi-calculus. We use this encoding to derive properties like type safety and progress in the session pi-calculus by exploiting the corresponding properties in the standard typed pi-calculus.
410  0$aAtlantis Studies in Computing,$x2212-8565 ;$v7
606   $aMachine theory
606   $aFormal Languages and Automata Theory
615  0$aMachine theory.
615 14$aFormal Languages and Automata Theory.
676   $a004 
700   $aDardha$b Ornela$4aut$4http://id.loc.gov/vocabulary/relators/aut$0756122
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910254066303321
996   $aType systems for distributed programs: components and sessions$92785166
997   $aUNINA