A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Manufacturing cheap, resilient, and stealthy opaque constructs
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Well-structured transition systems everywhere!
Theoretical Computer Science
Safe, Untrusted Agents Using Proof-Carrying Code
Mobile Agents and Security
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Computation: finite and infinite machines
Computation: finite and infinite machines
On the Expressiveness and Decidability of Higher-Order Process Calculi
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
Decidable Fragments of a Higher Order Calculus with Locations
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Steps on the road to component evolvability
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
| Hi-index | 0.00 |
In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwarding. Here we propose a limited form of forwarding: output actions can only communicate the parallel composition of statically known closed processes and processes received through previously executed input actions. We study the expressiveness of a higher-order process calculus featuring this style of communication. Our main result shows that in this calculus termination is decidable while convergence is undecidable.