Concurrencies in Reversible Concurrent Calculi

Calculi for Concurrent Objects

Concurrent object-oriented languages, such as POOL [1], ABCL [12], Obliq [3] or Java [7], usually structure the program into objects, model the parallelism with threads and the mutual exclusion with locks (or some variant of them). These attempts to integrate concurrency and object-oriented features are somehow naive and no rigorous motivation for the design choices is given. As a result, the s...

Matching Systems for Concurrent Calculi

Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients. We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic ...

Reduction Theories for Concurrent Calculi

Termination in Higher-Order Concurrent Calculi

We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing concurrent calculi. However, in contrast with the λ-calculus, a simply-typed discipline need not guarantee termination; and, in contrast with message-passing calculi such as the π-calculus, divergence can be obtained even without...

Modeling malware propagation in concurrent calculi

Malware or more precisely software designed to secretly access a computer system without the owner’s informed consent is one of the main sources of data loss in companies. Presently, the greatest threat is given by the incredible quick spread of infections. We aim at use concurrent calculi to model malwares and, in particular, their interactions with the network so to be able to identify immuni...