A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A calculus of mobile processes, II
Information and Computation
A theory of communicating processes with value passing
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of higher order communicating systems
Information and Computation
Algebraic theories for name-passing calculi
Information and Computation
Communicating sequential processes
Communications of the ACM
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
A Verification Tool for Value-Passing Processes
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
"On-the-fly Instantiation" of Value-passing Processes
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Symbolic Transition Graph with Assignment
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Unique Fixpoint Induction for Value-Passing Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Information and Computation
On the expressiveness of interaction
Theoretical Computer Science
| Hi-index | 0.00 |
A value-passing calculus is a process calculus in which the contents of communications are values chosen from some data domain, and the propositions appearing in the conditionals are formulas constructed from a logic. Previous studies treat the domain models, as well as the logic theories, as unspecified oracles. The open-ended approach leaves open some fundamental issues unanswered. The paper provides a more formal account of the value-passing calculi. The new treatment is self-contained in that the logic theory a value-passing calculus refers to is formally defined. A value-passing calculus consists of a complete first order theory with an operational model that makes use of the terms and the boolean expressions of the theory. A systematic investigation into the theory of the value-passing calculi is carried out. A particular value-passing calculus, $\mathbb{VPC}$, is shown to be the least expressive among all Turing complete value-passing calculi.