A calculus of mobile processes, II
Information and Computation
Bisimulation for higher-order process calculi
Information and Computation
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Seal: A Framework for Secure Mobile Computations
ICCL'98 Workshop on Internet Programming Languages
Typing Mobility in the Seal Calculus
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Equational Properties of Mobile Ambients
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Ambient Groups and Mobility Types
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Secure Composition of Insecure Components
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Information and Computation
Communication and mobility control in boxed ambients
Information and Computation
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
A CPS encoding of name-passing in higher-order mobile embedded resources
Theoretical Computer Science - Expressiveness in concurrency
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
Mobility control via passports
Information and Computation
Motivation for a new formal framework for agent-oriented software engineering
International Journal of Agent-Oriented Software Engineering
Communication and mobility control in boxed ambients
Information and Computation
Information and Computation
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Deriving bisimulation congruences: 2-categories vs precategories
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On bisimulation proofs for the analysis of distributed abstract machines
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Component-oriented programming with sharing: containment is not ownership
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Mobility control via passports
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
We present a new version of the Seal Calculus, a calculus of mobile computation. We study observational congruence and bisimulation theory, and show how they are related.