AbstractThis paper studies parallel recursion. The trace specification language used in this paper incorporates sequentially, nondeterminism, reactiveness (including infinite traces), three forms of parallelism (including conjunctive, fair-interleaving and synchronous parallelism) and general recursion. In order to use Tarski's theorem to determine the fixpoints of recursions, we need to identify a well-founded partial order. Several orders are considered, including a new order called the lexical order, which tends to simulate the execution of a recursion in a similar manner as the Egli-Milner order. A theorem of this paper shows that no appropriate order exists for the language. Tarski's theorem alone is not enough to determine the fixpoin...
Systematic parallelization of sequential programs remains a major challenge in parallel computing. T...
AbstractThe paper studies a simply typed term system Mω providing a primitive recursive concept of p...
The weakest-precondition interpretation of recursive procedures is developed for a language with a c...
This paper studies parallel recursion. The trace specification language used in this paper incorpor...
This paper studies parallel recursion. The trace specification language used in this paper incorpora...
AbstractThis paper studies parallel recursion. The trace specification language used in this paper i...
. We present a new fixpoint theorem which guarantees the existence and the finite computability of t...
AbstractWhen reasoning about parallel programs we would like to combine fixed-point laws for unrolli...
textabstractWe study the semantics of a simple language with concurrency and recursion. Our semantic...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
International audienceWe show how monotone interpretations – a termination analysis technique for te...
AbstractAn algebraic technique for reasoning about recursive programs is proposed. The technique is ...
Systematic parallelization of sequential programs remains a major challenge in parallel computing. T...
AbstractThe paper studies a simply typed term system Mω providing a primitive recursive concept of p...
The weakest-precondition interpretation of recursive procedures is developed for a language with a c...
This paper studies parallel recursion. The trace specification language used in this paper incorpor...
This paper studies parallel recursion. The trace specification language used in this paper incorpora...
AbstractThis paper studies parallel recursion. The trace specification language used in this paper i...
. We present a new fixpoint theorem which guarantees the existence and the finite computability of t...
AbstractWhen reasoning about parallel programs we would like to combine fixed-point laws for unrolli...
textabstractWe study the semantics of a simple language with concurrency and recursion. Our semantic...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
We propose a general formal model of isolated hierarchical parallel computations, and identify sever...
International audienceWe show how monotone interpretations – a termination analysis technique for te...
AbstractAn algebraic technique for reasoning about recursive programs is proposed. The technique is ...
Systematic parallelization of sequential programs remains a major challenge in parallel computing. T...
AbstractThe paper studies a simply typed term system Mω providing a primitive recursive concept of p...
The weakest-precondition interpretation of recursive procedures is developed for a language with a c...