Claudio Antares Mezzina

Claudio Antares Mezzina
Are you Claudio Antares Mezzina?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Claudio Antares Mezzina
Affiliation
Location

Pubs By Year

Pub Categories

 
Computer Science - Logic in Computer Science (3)
 
Computer Science - Programming Languages (1)
 
Computer Science - Distributed; Parallel; and Cluster Computing (1)

Publications Authored By Claudio Antares Mezzina

Under a reversible semantics, computation steps can be undone. This paper addresses the integration of reversible semantics into process languages for communication-centric systems, equipped with behavioral types. In prior work, we introduced a monitors-as-memories approach to seamlessly integrate reversible semantics into a process model in which concurrency is governed by session types (a class of behavioral types), covering binary (two-party) protocols with synchronous communications. Read More

Among the paradigms for parallel and distributed computing, the one popularized with Linda, and based on tuple spaces, is one of the least used, despite the fact of being intuitive, easy to understand and to use. A tuple space is a repository, where processes can add, withdraw or read tuples by means of atomic operations. Tuples may contain different values, and processes can inspect their content via pattern matching. Read More

2016Jun
Affiliations: 1IMT School for Advanced Studies Lucca, Italy, 2University of Groningen, The Netherlands

Much research has studied foundations for correct and reliable communication-centric systems. A salient approach to correctness uses session types to enforce structured communications; a recent approach to reliability uses reversible actions as a way of reacting to unanticipated events or failures. This note develops a simple observation: the machinery required to define asynchronous semantics and monitoring can also support reversible protocols. Read More

We study the theory of safety and liveness in a reversible calculus where reductions are totally ordered and rollbacks lead the systems to past states. Similar to previous work on communicating transactions, liveness and safety respectively correspond to the should-testing and inverse may-testing preorders. We develop fully abstract models for these preorders in a reversible calculus, which are based only on forward transitions, thus providing a simple proof technique for refinement of such systems. Read More