Marco Peressotti

Marco Peressotti

Auto-generated profile, based on publicly available information

Marco Peressotti

University of Southern Denmark, Odense, Denmark

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 January 2019 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PDF file
WKWen Kokke
Wen Kokke
FMFabrizio Montesi
Fabrizio Montesi
MPMarco Peressotti
Marco Peressotti
We present Hypersequent Classical Processes (HCP), a revised interpretation of the “Proofs as Processes” correspondence between linear logic and the π-calculus initially proposed by Abramsky [1994], and later developed by Bellin and Scott [1994], Caires and Pfenning [2010], and Wadler [2014], among others. HCP mends the discrepancies between linear logic and the syntax and observable semantics of parallel composition in the π-calculus, by conservatively extending linear logic to hyperenvironments (collections of environments, inspired by the hypersequents by Avron [1991]). Separation of environments in hyperenvironments is internalised by ⊗ and corresponds to parallel process behaviour. Thanks to this property, for the first time we are able to extract a labelled transition system (lts) semantics from proof rewritings. Leveraging the information on parallelism at the level of types, we obtain a logical reconstruction of the delayed actions that Merro and Sangiorgi [2004] formulated to model non-blocking I/O in the π-calculus. We define a denotational semantics for processes based on Brzozowski derivatives, and uncover that non-interference in HCP corresponds to Fubini’s theorem of double antiderivation. Having an lts allows us to validate HCP using the standard toolbox of behavioural theory. We instantiate bisimilarity and barbed congruence for HCP, and obtain a full abstraction result: bisimilarity, denotational equivalence, and barbed congruence coincide.

1 November 2015 in Journal of Logical and Algebraic Methods in Programming
Verified
Journal Article
Closed access
TBTomasz Brengos
Tomasz Brengos
MMMarino Miculan
Marino Miculan
MPMarco Peressotti
Marco Peressotti

16 January 2024 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
SGSaverio Giallorenzo
Saverio Giallorenzo
FMFabrizio Montesi
Fabrizio Montesi
MPMarco Peressotti
Marco Peressotti
Choreographies are coordination plans for concurrent and distributed systems, which define the roles of the involved participants and how they are supposed to work together. In the paradigm of choreographic programming, choreographies are programs that can be compiled into executable implementations.In this article, we present Choral, the first choreographic programming language based on mainstream abstractions. The key idea in Choral is a new notion of data type, which allows for expressing that data is distributed over different roles. We use this idea to reconstruct the paradigm of choreographic programming through object-oriented abstractions. Choreographies are classes, and instances of choreographies are objects with states and behaviours implemented collaboratively by roles.Choral comes with a compiler that, given a choreography, generates an implementation for each of its roles. These implementations are libraries in pure Java, whose types are under the control of the Choral programmer. Developers can then modularly compose these libraries in their programs, to participate correctly in choreographies. Choral is the first incarnation of choreographic programming offering such modularity, which finally connects more than a decade of research on the paradigm to practical software development.The integration of choreographic and object-oriented programming yields other powerful advantages, where the features of one paradigm benefit the other in ways that go beyond the sum of the parts. On the one hand, the high-level abstractions and static checks from the world of choreographies can be used to write concurrent and distributed object-oriented software more concisely and correctly. On the other hand, we obtain a much more expressive choreographic language from object-oriented abstractions than in previous work. This expressivity allows for writing more reusable and flexible choreographies. For example, object passing makes Choral the first higher-order choreographic programming language, whereby choreographies can be parameterised over other choreographies without any need for central coordination. We also extend method overloading to a new dimension: specialisation based on data location. Together with subtyping and generics, this allows Choral to elegantly support user-defined communication mechanisms and middleware.

1 December 2016 in Theoretical Computer Science
Verified
Journal Article
Closed access
MMMarino Miculan
Marino Miculan
MPMarco Peressotti
Marco Peressotti

20 August 2021
Verified
Book Chapter
Closed access
PDF file
LCLuís Cruz-Filipe
Luís Cruz-Filipe
FMFabrizio Montesi
Fabrizio Montesi
MPMarco Peressotti
Marco Peressotti

3 October 2022
Verified
Book Chapter
Closed access
PDF file
LCLuís Cruz-Filipe
Luís Cruz-Filipe
EGEva Graversen
Eva Graversen
LLLovro Lugović
Lovro Lugović
FMFabrizio Montesi
Fabrizio Montesi
MPMarco Peressotti
Marco Peressotti