In our previous work, we proposed an inductive synthesis algorithm for recursive processes by a subset of $\mu$-calculus. This paper presents an extension of the privious algorithm to a wide class of $\mu$-calculus
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
The research described in this paper involved developing transformation techniques which increase th...
AbstractDpi is a distributed version of the pi-calculus, in which processes are explicitly located, ...
AbstractThis paper proposes an inductive synthesis algorithm for a recursive process. To synthesize ...
AbstractThis paper proposes an inductive synthesis algorithm for a recursive process. To synthesize ...
AbstractIn designing a new algorithm we usually begin with considering a number of examples and then...
We study the algorithm for the construction of mathematical descriptions of real processes, which ar...
We describe techniques for synthesis and verification of recursive functional programs over unbounde...
We present an approach to inductive synthesis of functional programs based on the detection of recur...
The research described in this paper involved developing transformation techniques which increase t...
AbstractIn designing a new algorithm we usually begin with considering a number of examples and then...
The synthesis of recursive logic programs from incomplete information, such as input/output examples...
The research described in this paper involved developing transformation techniques which increase th...
AbstractThe inductive synthesis of recursive logic programs from incomplete information, such as inp...
We define the notion of an inductively defined type in the Calculus of Constructions and show how in...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
The research described in this paper involved developing transformation techniques which increase th...
AbstractDpi is a distributed version of the pi-calculus, in which processes are explicitly located, ...
AbstractThis paper proposes an inductive synthesis algorithm for a recursive process. To synthesize ...
AbstractThis paper proposes an inductive synthesis algorithm for a recursive process. To synthesize ...
AbstractIn designing a new algorithm we usually begin with considering a number of examples and then...
We study the algorithm for the construction of mathematical descriptions of real processes, which ar...
We describe techniques for synthesis and verification of recursive functional programs over unbounde...
We present an approach to inductive synthesis of functional programs based on the detection of recur...
The research described in this paper involved developing transformation techniques which increase t...
AbstractIn designing a new algorithm we usually begin with considering a number of examples and then...
The synthesis of recursive logic programs from incomplete information, such as input/output examples...
The research described in this paper involved developing transformation techniques which increase th...
AbstractThe inductive synthesis of recursive logic programs from incomplete information, such as inp...
We define the notion of an inductively defined type in the Calculus of Constructions and show how in...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
The research described in this paper involved developing transformation techniques which increase th...
AbstractDpi is a distributed version of the pi-calculus, in which processes are explicitly located, ...