Journal of the ACM (JACM)
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Name creation implements restriction in the π-calculus
Systems and Computers in Japan
Nominal rewriting with name generation: abstraction vs. locality
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A bisimulation for dynamic sealing
Theoretical Computer Science
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
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
The Higher-Order, Call-by-Value Applied Pi-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Information and Computation
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sound bisimulations for higher-order distributed process calculus
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Symbolic bisimulation for a higher-order distributed language with passivation
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Stefani] is a language construct that elegantly models higher-order distributed behaviours like failure, migration, or duplication (e.g. when a running process or virtual machine is copied), and name creation consists in generating a fresh name instead of hiding one. Combined with higher-order distribution, name creation leads to different semantics from name hiding, and is closer to implementations of distributed systems. We define for this new calculus a theory of sound and complete environmental bisimulation to prove reduction-closed barbed equivalence and (a reasonable form of) congruence. We furthermore define environmental simulations to prove behavioural approximation, and use these theories to show non-trivial examples of equivalence or approximation. Those examples could not be proven with previous theories, which were either unsound or incomplete under the presence of process duplication and name restriction, or else required universal quantification over general contexts.