Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
Recently, the formal approach of I–Systems has been newly hed through an abstract axiomatic system where events in system components are solely derived and defined from their b...
Arnim Wedig, Horst F. Wedde, Anca M. Lazarescu, El...
Abstract. This paper describes a mechanism for “fusing” concurrent invocations of exclusive methods. The target of our work is object-oriented languages with concurrent extensi...
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
Both teaching and learning multithreaded ing are complex tasks, due to the abstraction of the concepts, the non-determinism of the scheduler, the impossibility of using classical s...
Giovanni Malnati, Caterina Maria Cuva, Claudia Bar...