A calculus of mobile processes, II
Information and Computation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Trust and partial typing in open systems of mobile agents
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed memory management in a calculus of capabilities
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols
Information and Computation
Theoretical Computer Science
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
Logic and Algebra of Specification
Logic and Algebra of Specification
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Localities and Failures (Extended Abstract)
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Code Certification
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Dynamic policy discovery with remote attestation
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A mobility calculus with local and dependent types
Processes, Terms and Cycles
| Hi-index | 0.00 |
We present a partially typed semantics for Dπ, a distributed π-calculus. The semantics is designed for mobile agents in open distributed systems in which some sites may harbor malicious intentions. Nonetheless, the semantics guarantees traditional type-safety properties at good locations by using a mixture of static and dynamic type-checking. We show how the semantics can be extended to allow trust between sites, improving performance and expressiveness without compromising type safety.