Germán Andrés Delbianco

Germán Andrés Delbianco

Auto-generated profile, based on publicly available information

Germán Andrés Delbianco

IMDEA Software Institute

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 2014
Verified
Book Chapter
Closed access
PDF file
ANAleksandar Nanevski
Aleksandar Nanevski
RLRuy Ley-Wild
Ruy Ley-Wild
ISIlya Sergey
Ilya Sergey
GDGermán Andrés Delbianco
Germán Andrés Delbianco

10 October 2019 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PDF file
ANAleksandar Nanevski
Aleksandar Nanevski
ABAnindya Banerjee
Anindya Banerjee
GDGermán Andrés Delbianco
Germán Andrés Delbianco
IFIgnacio Fábregas
Ignacio Fábregas
In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources —a form of state transition systems—to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state. In this paper we introduce a novel notion of resource morphism , i.e. structure-preserving function on resources, and show how to effectively integrate it into separation logic, using an associated notion of morphism-specific simulation . We apply morphisms and simulations to programs verified under one resource, to compositionally adapt them to operate under another resource, thus facilitating proof reuse.

4 January 2021 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
FFFrantišek Farka
František Farka
ANAleksandar Nanevski
Aleksandar Nanevski
ABAnindya Banerjee
Anindya Banerjee
GDGermán Andrés Delbianco
Germán Andrés Delbianco
IFIgnacio Fábregas
Ignacio Fábregas
Concurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. The algebraic structure that underpins ownership transfer is that of partial commutative monoids (PCMs). Extant research considers ownership transfer primarily from the logical perspective while comparatively less attention is drawn to the algebraic considerations. This paper provides an algebraic formalization of ownership transfer in concurrent separation logic by means of structure-preserving partial functions (i.e., morphisms) between PCMs, and an associated notion of separating relations. Morphisms of structures are a standard concept in algebra and category theory, but haven't seen ubiquitous use in separation logic before. Separating relations. are binary relations that generalize disjointness and characterize the inputs on which morphisms preserve structure. The two abstractions facilitate verification by enabling concise ways of writing specs, by providing abstract views of threads' states that are preserved under ownership transfer, and by enabling user-level construction of new PCMs out of existing ones.

25 September 2013
Verified
Conference Paper
Open access
PDF file
GDGermán Andrés Delbianco
Germán Andrés Delbianco
ANAleksandar Nanevski
Aleksandar Nanevski

19 October 2016
Verified
Conference Paper
Open access
PDF file
ISIlya Sergey
Ilya Sergey
ANAleksandar Nanevski
Aleksandar Nanevski
ABAnindya Banerjee
Anindya Banerjee
GDGermán Andrés Delbianco
Germán Andrés Delbianco
Designing efficient concurrent objects often requires abandoning the standard specification technique of linearizability in favor of more relaxed correctness conditions. However, the variety of alternatives makes it difficult to choose which condition to employ, and how to compose them when using objects specified by different conditions. In this work, we propose a uniform alternative in the form of Hoare logic, which can explicitly capture--in the auxiliary state--the interference of environment threads. We demonstrate the expressiveness of our method by verifying a number of concurrent objects and their clients, which have so far been specified only by non-standard conditions of concurrency-aware linearizability, quiescent, and quantitative quiescent consistency. We report on the implementation of the ideas in an existing Coq-based tool, providing the first mechanized proofs for all the examples in the paper.

25 September 2013 in ACM SIGPLAN Notices
Verified
Journal Article
Open access
GDGermán Andrés Delbianco
Germán Andrés Delbianco
ANAleksandar Nanevski
Aleksandar Nanevski
Continuations are programming abstractions that allow for manipulating the "future" of a computation. Amongst their many applications, they enable implementing unstructured program flow through higher-order control operators such as callcc. In this paper we develop a Hoare-style logic for the verification of programs with higher-order control, in the presence of dynamic state. This is done by designing a dependent type theory with first class callcc and abort operators, where pre- and postconditions of programs are tracked through types. Our operators are algebraic in the sense of Plotkin and Power, and Jaskelioff, to reduce the annotation burden and enable verification by symbolic evaluation. We illustrate working with the logic by verifying a number of characteristic examples.