Emanuele D'OSualdo

Emanuele D'OSualdo

Auto-generated profile, based on publicly available information

Emanuele D'OSualdo

MPI-SWS Germany

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 January 2013
Verified
Book Chapter
Closed access
EDEmanuele D’Osualdo
Emanuele D’Osualdo
JKJonathan Kochems
Jonathan Kochems
COC. -H. Luke Ong
C. -H. Luke Ong

9 January 2023 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
MSMichael Sammler
Michael Sammler
SSSimon Spies
Simon Spies
YSYoungju Song
Youngju Song
EDEmanuele D'OSualdo
Emanuele D'OSualdo
RKRobbert Krebbers
Robbert Krebbers
DDDerek Dreyer
Derek Dreyer
Prior work on multi-language program verification has achieved impressive results, including the compositional verification of complex compilers. But the existing approaches to this problem impose a variety of restrictions on the overall structure of multi-language programs (e.g. fixing the source language, fixing the set of involved languages, fixing the memory model, or fixing the semantics of interoperation). In this paper, we explore the problem of how to avoid such global restrictions. Concretely, we present DimSum : a new, decentralized approach to multi-language semantics and verification, which we have implemented in the Coq proof assistant. Decentralization means that we can define and reason about languages independently from each other (as independent modules communicating via events), but also combine and translate between them when necessary (via a library of combinators). We apply DimSum to a high-level imperative language Rec (with an abstract memory model and function calls), a low-level assembly language Asm (with a concrete memory model, arbitrary jumps, and syscalls), and a mathematical specification language Spec. We evaluate DimSum on two case studies: an Asm library extending Rec with support for pointer comparison, and a coroutine library for Rec written in Asm. In both cases, we show how DimSum allows the Asm libraries to be abstracted to Rec-level specifications, despite the behavior of the Asm libraries not being syntactically expressible in Rec itself. We also verify an optimizing multi-pass compiler from Rec to Asm, showing that it is compatible with these Asm libraries.

31 October 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
EDEmanuele D’oSualdo
Emanuele D’oSualdo
AFAzadeh Farzan
Azadeh Farzan
DDDerek Dreyer
Derek Dreyer
Hypersafety properties of arity n are program properties that relate n traces of a program (or, more generally, traces of n programs). Classic examples include determinism, idempotence, and associativity. A number of relational program logics have been introduced to target this class of properties. Their aim is to construct simpler proofs by capitalizing on structural similarities between the n related programs. We propose an unexplored, complementary proof principle that establishes hyper-triples (i.e. hypersafety judgments) as a unifying compositional building block for proofs, and we use it to develop a Logic for Hyper-triple Composition (LHC), which supports forms of proof compositionality that were not achievable in previous logics. We prove LHC sound and apply it to a number of challenging examples.

10 November 2021 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
EDEmanuele D’oSualdo
Emanuele D’oSualdo
JSJulian Sutherland
Julian Sutherland
AFAzadeh Farzan
Azadeh Farzan
PGPhilippa Gardner
Philippa Gardner
We present TaDA Live, a concurrent separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs. The crucial challenge is how to deal with abstract atomic blocking : that is, abstract atomic operations that have blocking behaviour arising from busy-waiting patterns as found in, for example, fine-grained spin locks. Our fundamental innovation is with the design of abstract specifications that capture this blocking behaviour as liveness assumptions on the environment. We design a logic that can reason about the termination of clients that use such operations without breaking their abstraction boundaries, and the correctness of the implementations of the operations with respect to their abstract specifications. We introduce a novel semantic model using layered subjective obligations to express liveness invariants and a proof system that is sound with respect to the model. The subtlety of our specifications and reasoning is illustrated using several case studies.

7 January 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
JBJialu Bao
Jialu Bao
EDEmanuele D'OSualdo
Emanuele D'OSualdo
AFAzadeh Farzan
Azadeh Farzan
We present BlueBell , a program logic for reasoning about probabilistic programs where unary and relational styles of reasoning come together to create new reasoning tools. Unary-style reasoning is very expressive and is powered by foundational mechanisms to reason about probabilistic behavior like independence and conditioning . The relational style of reasoning, on the other hand, naturally shines when the properties of interest compare the behavior of similar programs (e.g. when proving differential privacy) managing to avoid having to characterize the output distributions of the individual programs. So far, the two styles of reasoning have largely remained separate in the many program logics designed for the deductive verification of probabilistic programs. In BlueBell , we unify these styles of reasoning through the introduction of a new modality called “joint conditioning” that can encode and illuminate the rich interaction between conditional independence and relational liftings ; the two powerhouses from the two styles of reasoning.

31 October 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
DFDan Frumin
Dan Frumin
EDEmanuele D’oSualdo
Emanuele D’oSualdo
BHBas van Den Heuvel
Bas van Den Heuvel
JPJorge A. Pérez
Jorge A. Pérez
The emergence of propositions-as-sessions, a Curry-Howard correspondence between propositions of Linear Logic and session types for concurrent processes, has settled the logical foundations of message-passing concurrency. Central to this approach is the resource consumption paradigm heralded by Linear Logic. In this paper, we investigate a new point in the design space of session type systems for message-passing concurrent programs. We identify O’Hearn and Pym’s Logic of Bunched Implications (BI) as a fruitful basis for an interpretation of the logic as a concurrent programming language. This leads to a treatment of non-linear resources that is radically different from existing approaches based on Linear Logic. We introduce a new π-calculus with sessions, called πBI; its most salient feature is a construct called spawn, which expresses new forms of sharing that are induced by structural principles in BI. We illustrate the expressiveness of πBI and lay out its fundamental theory: type preservation, deadlock-freedom, and weak normalization results for well-typed processes; an operationally sound and complete typed encoding of an affine λ-calculus; and a non-interference result for access of resources.