Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
We define an extension of the π-calculus with a static type system which supports high-level specifications of extended patterns of communication, such as client-server protocol...
A composition language based on a formal semantic foundation will facilitate precification of glue abstractions and compositions, and will support reasoning about their behaviour....
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...