An efficiency preorder for processes
Acta Informatica
A calculus of mobile processes, I
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Proving congruence of bisimulation in functional programming languages
Information and Computation
Locality and interleaving semantics in calculi for mobile processes
Theoretical Computer Science
Bisimulation for higher-order process calculi
Information and Computation
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th 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
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Equational properties of mobile ambients
Mathematical Structures in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
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)
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
A coalgebraic approach to the semantics of the ambient calculus
Theoretical Computer Science - Algebra and coalgebra in computer science
Information and Computation
Basic observables for a calculus for global computing
Information and Computation
Types for ambient and process mobility†
Mathematical Structures in Computer Science
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Synthesising CCS bisimulation using graph rewriting
Information and Computation
Normal Bisimulations in Calculi with Passivation
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Howe's Method for Calculi with Passivation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Encoding mobile ambients into the π-calculus
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Deriving structural labelled transitions for mobile ambients
Information and Computation
A pure labeled transition semantics for the applied pi calculus
Information Sciences: an International Journal
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
LTS semantics for process calculi from their graphical encodings
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
The bisimulation proof method: enhancements and open problems
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Towards a general theory of barbs, contexts and labels
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
A component model for the ABS language
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
A modular LTS for open reactive systems
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.01 |
We study a behavioral theory of Mobile Ambients, a process calculus for modelling mobile agents in wide-area networks, focussing on reduction barbed congruence. Our contribution is threefold. (1) We prove a context lemma which shows that only parallel and nesting contexts need be examined to recover this congruence. (2) We characterize this congruence using a labeled bisimilarity: this requires novel techniques to deal with asynchronous movements of agents and with the invisibility of migrations of secret locations. (3) We develop refined proof methods involving up-to proof techniques, which allow us to verify a set of algebraic laws and the correctness of more complex examples.