KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Theoretical Computer Science
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types for the ambient calculus
Information and Computation - IFIP TCS2000
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Typing and Subtyping Mobility in Boxed Ambients
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Correspondence assertions for process synchronization in concurrent communications
Journal of Functional Programming
Information and Computation
Subtyping for session types in the pi calculus
Acta Informatica
Communication and mobility control in boxed ambients
Information and Computation
Typechecking Safe Process Synchronization
Electronic Notes in Theoretical Computer Science (ENTCS)
Splitting Mobility and Communication in Boxed Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
A distributed object-oriented language with session types
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Session types for object-oriented languages
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Behavioural typing for safe ambients
Computer Languages, Systems and Structures
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Calculi, types and applications
Theoretical Computer Science
Session and Union Types for Object Oriented Programming
Concurrency, Graphs and Models
Amalgamating sessions and methods in object-oriented languages with generics
Theoretical Computer Science
Information and Computation
Two session typing systems for higher-order mobile processes
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Asynchronous session types and progress for object oriented languages
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Bounded session types for object oriented languages
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Formalizing higher-order mobile embedded business processes with binding bigraphs
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
How to infer finite session types in a calculus of services and sessions
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Multipoint session types for a distributed calculus
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Disciplined structured communications with consistent runtime adaptation
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
We define BASS, a typed boxed ambients calculus with safe sessions. Sessions offer the possibility of using the same channel to transmit information of different types in a prescribed order. A session involves two communicating processes located either within the same ambient or across an ambient boundary. One of the challenges of adding session primitives to a mobile calculus is how to protect sessions from being interrupted by a mobility step. To address this challenge, we introduce a mechanism that prevents an ambient from moving, if there are pending sessions across its boundaryThe main result of our development is that in a well-typed process a communication redex never disappears after a mobility step. In other words, the residual of a communication redex is present in the reduct of the original process enabling a pending session step to be completed. Therefore, we claim that sessions in our calculus are safe.