About Me  |  Publications  |  Teaching  |  CV  |

About Me

I am a post-doc at the Modélisation et Verification team at IRIF, Université Paris-Diderot, working with Constantin Enea on the verification of distributed systems.

Before joining IRIF, I did my phD at the IMDEA Software Institute in Madrid, under the supervision of Aleks Nanevski. My thesis, Hoare-style Reasoning with Higher-order Control: Continuations and Concurrency, focused on the development and application of program logics aimed at the modular verification of stateful programs with higher-order unstructured stateful features such as control effects and concurrency. Further back, I did my undergraduate studies back home in Rosario, Argentina, at UNR. My thesis topic was Program Calculation with Applicative Functors and my advisors were Alberto Pardo and Mauro Jaskelioff.

In general, my research has focused on the design, implementation and application of new dependently-typed theories aimed at reasoning about, and proving the correctness of, higher-order programs with unstructured stateful features e.g., continuations, fork/join concurrency and coroutines, from a computational effects perspective. Lately, my research has focused on developing techniques for the verification of fine-grained concurrent data structures in FCSL, a fine-grained, concurrent separation logic.

Curriculum Vitae: [PDF]

Publications

[ DBLP | Google Scholar | Mendeley | ResearchGate | ORCID]

Publications

• A. Nanevski, A. Banerjee, G. A. Delbianco, I. Fábregas. Specifying Concurrent Programs in Separation Logic: Morphisms and Simulations. Procs. ACM Program. Lang. 3, OOPSLA, Article 161 (October 2019).
  [ PDF | DOI | arXiv (Extended Version) | FCSL Project Website]

• G. A. Delbianco, I. Sergey, A. Nanevski, A. Banerjee. Concurrent Data Structures Linked in Time. In Proceedings of the 31st European Conference on Object-Oriented Programming (ECOOP 2017), LIPIcs, Vol. 74, pp. 8:1-8:30, 2017. Leibniz International Proceedings in Informatics Schloss Dagstuhl - Leibniz - Zentrum fuer Informatik, Dagstuhl Publishing, Germany.
  [ PDF | DOI | arXiv | Artifact@DARTS | FCSL Project Website]

• I. Sergey, A. Nanevski, A. Banerjee, G. A. Delbianco. Hoare-style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects. In OOPSLA 2016, Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications. Amsterdam, The Netherlands, November 2016. ACM, New York, NY, USA, pp. 92-110.
  [ PDF | @ACM | FCSL Project Website]

• A. Nanevski, R. Ley-Wild, I. Sergey, G. A. Delbianco. Communicating State Transition Systems for Fine-Grained Concurrent Resources. In ESOP (2014), Z. Shao, Ed., vol. 8410 of Lecture Notes in Computer Science, Springer, pp. 290-310.
  [ PDF | DOI | Extended PDF | FCSL Project Website]

• G. A. Delbianco, A. Nanevski. Hoare-Style Reasoning with (Algebraic) Continuations. In Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (ICFP '13). Boston, MA. September 2013. ACM, New York, NY, USA, pp. 363-376.
  [ PDF | @ACM | Project Mini-site]

• G. A. Delbianco, M. Jaskelioff, A. Pardo. Applicative Shortcut Fusion. In Trends in Functional Programming, R. Peña and R. Page, Eds., vol. 7193 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2012, pp. 179-194.
  [ PDF | DOI]

Theses

• G. A. Delbianco. Hoare-style Reasoning with Higher-order Control: Continuations and Concurrency. PhD in Computer Science thesis, Universidad Politécnica de Madrid, Spain. July 2017. [ PDF | @UPM]

• G. A. Delbianco. Cálculo de Programas con Functores Aplicativos. Licenciate in Computer Science thesis, Universidad Nacional de Rosario, Argentina. December 2010. [ PDF in Spanish ]

Teaching

I worked as a TA at the Computer Science Department from August 2006 to December 2010 on different courses:

• Programming Languages Analysis II (Functional Programming)
• Type Systems
• Data Structures
• Calculus IV (Introduction to Category Theory for CS)