Logic-Based Domain-Aware Session Types

Software services and governing communication protocols are increasingly domain-aware. Domains can have multiple interpretations, such as the principals on whose behalf processes act or the location at which parties reside. Domains impact protocol compliance and access control, two central issues to overall functionality and correctness in distributed systems. This paper proposes a session-typed process framework for domain-aware communication-centric systems based on a CurryHoward interpretation of linear logic, here augmented with nominals from hybrid logic indicating domains. These nominals are explicit in the process expressions and govern domain migration, subject to a parametric accessibility relation familiar from the Kripke semantics for modal logic. Flexible access relationships among domains can be elegantly defined and statically enforced. The framework can also account for scenarios in which domain information is discovered only at runtime. Due to the logical origins of our systems, well-typed processes enjoy session fidelity, global progress, and termination. Moreover, well-typed processes always respect the accessibility relation and satisfy a form of domain parametricity, two properties crucial to show that domain-related properties of concrete programs are satisfied.

[1]  Mariangiola Dezani-Ciancaglini,et al.  Sessions and Session Types: An Overview , 2009, WS-FM.

[2]  Valeria C V de Paiva,et al.  Intuitionistic Hybrid Logic , 2006 .

[3]  Bernardo Toninho,et al.  Higher-Order Processes, Functions, and Sessions: A Monadic Integration , 2013, ESOP.

[4]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[5]  David Walker,et al.  Modal Proofs as Distributed Programs (Extended Abstract) , 2004, ESOP.

[6]  Frank Pfenning,et al.  A symmetric modal lambda calculus for distributed computing , 2004, LICS 2004.

[7]  Bernardo Toninho,et al.  Constructive Provability Logic , 2012, ArXiv.

[8]  Karl Crary,et al.  Modal types for mobile code , 2008 .

[9]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[10]  Ilaria Castellani,et al.  Information Flow Safety in Multiparty Sessions , 2011 .

[11]  Bernardo Toninho,et al.  Behavioral Polymorphism and Parametricity in Session-Based Communication , 2013, ESOP.

[12]  Vasco Thudichum Vasconcelos,et al.  Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication , 1998, SecReT@ICALP.

[13]  Luca Cardelli,et al.  Types for the Ambient Calculus , 2002, Inf. Comput..

[14]  Benjamin C. Pierce,et al.  A Theory of Information-Flow Labels , 2013, 2013 IEEE 26th Computer Security Foundations Symposium.

[15]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, HLCL.

[16]  Davide Sangiorgi pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[17]  Kohei Honda,et al.  Types for Dynamic Interaction , 1993 .

[18]  Kaustuv Chaudhuri,et al.  A Hybrid Linear Logic for Constrained Transition Systems with Applications to Molecular Biology , 2013, TYPES.

[19]  Michele Bugliesi,et al.  Behavioural typing for safe ambients , 2002, Comput. Lang. Syst. Struct..

[20]  Bernardo Toninho,et al.  Linear Logical Relations for Session-Based Concurrency , 2012, ESOP.

[21]  Ilaria Castellani,et al.  Session Types for Access and Information Flow Control , 2010, CONCUR.

[22]  Mariangiola Dezani-Ciancaglini,et al.  BASS: boxed ambients with safe sessions , 2006, PPDP '06.

[23]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[24]  Andrew Barber,et al.  Dual Intuitionistic Linear Logic , 1996 .

[25]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[26]  Bor-Yuh Evan Chang,et al.  A judgmental analysis of linear logic , 2003 .

[27]  Frank Pfenning,et al.  Session Types as Intuitionistic Linear Propositions , 2010, CONCUR.

[28]  Bernardo Toninho,et al.  Functions as Session-Typed Processes , 2012, FoSSaCS.

[29]  Alex K. Simpson,et al.  The proof theory and semantics of intuitionistic modal logic , 1994 .