We present a proof system for message-passing process calculi with recursion. The key inference rule to deal with recursive processes is a version of Unique Fixpoint Induction for process abstractions. We prove that the proof system is sound and also complete for guarded regular message-passing processes. We also show that the system is incomplete for unguarded processes and discuss more powerful extensions with inductive inference rules
Proof theory provides a foundation for studying and reasoning aboutprogramming languages, most direc...
. In a simply-typed, call-by-value (CBV) language with first-class continuations, the usual CBV fixp...
We construct a graph model for ACPt, the algebra of communicating processes with silent steps, in wh...
AbstractWe present a proof system for message-passing process calculi with recursion. The key infere...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
A universal process of a process calculus is one that, given the G\"{o}delindex of a process of a ce...
This paper introduces a process calculus with recursion which allows us to express an unbounded numb...
AbstractIn this paper processes specifiable over a non-uniform language are considered. The language...
We use some very recent techniques from process algebra to draw interesting conclusions about the we...
Abstract. We propose an axiomatization of fixpoint operators in typed call-by-value programming lang...
AbstractA process communicates with its environment and with other processes by syncronized output a...
In this paper, we review a constructive version of the Approximation Induction Principle. This versi...
. We present a new fixpoint theorem which guarantees the existence and the finite computability of t...
Unique Fixpoint Induction (UFI) is the chief inference rule to prove the equivalence of recursive pr...
Abstract. We present a calculus that models a form of process interaction based on copyless message ...
Proof theory provides a foundation for studying and reasoning aboutprogramming languages, most direc...
. In a simply-typed, call-by-value (CBV) language with first-class continuations, the usual CBV fixp...
We construct a graph model for ACPt, the algebra of communicating processes with silent steps, in wh...
AbstractWe present a proof system for message-passing process calculi with recursion. The key infere...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
A universal process of a process calculus is one that, given the G\"{o}delindex of a process of a ce...
This paper introduces a process calculus with recursion which allows us to express an unbounded numb...
AbstractIn this paper processes specifiable over a non-uniform language are considered. The language...
We use some very recent techniques from process algebra to draw interesting conclusions about the we...
Abstract. We propose an axiomatization of fixpoint operators in typed call-by-value programming lang...
AbstractA process communicates with its environment and with other processes by syncronized output a...
In this paper, we review a constructive version of the Approximation Induction Principle. This versi...
. We present a new fixpoint theorem which guarantees the existence and the finite computability of t...
Unique Fixpoint Induction (UFI) is the chief inference rule to prove the equivalence of recursive pr...
Abstract. We present a calculus that models a form of process interaction based on copyless message ...
Proof theory provides a foundation for studying and reasoning aboutprogramming languages, most direc...
. In a simply-typed, call-by-value (CBV) language with first-class continuations, the usual CBV fixp...
We construct a graph model for ACPt, the algebra of communicating processes with silent steps, in wh...