Germán Andrés Delbianco
Ph.D. Candidate

About me

I am a PhD Candidate at the IMDEA Software Institute under the supervision of Aleks Nanevski.

Throughout my time here at IMDEA, 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. Moreover, my general research interests can be found, in a broader sense, in the intersection of Programming Languages Semantics, Type Theory, Functional Programming and Theorem Proving.

Some time ago, I used to draw commutative diagrams rather than write Hoare triples on my whiteboard. I got my Licenciate degree in Computer Science at Universidad Nacional de Rosario in the year 2010. My thesis topic was "Program Calculation with Applicative Functors" and my advisors were Alberto Pardo and Mauro Jaskelioff. I still try to draw commutative diagrams, whenever I find the chance.

Curriculum Vitae: [PDF]

Publications

[ DBLP | Google Scholar | Mendeley | Researchgate ]

Publications

  • 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 Page]

  • 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 Page]


  • 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. Dependent Type Theories for the Verification of Unstructured Programs. A slightly out of date research statement of my ongoing PhD thesis.
  • 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 have worked at the Computer Science Department at UNR as TA from August 2006 to December 2010 on different courses:


Ooops..My beautiful pic is missing

Contact Information

Germán Andrés Delbianco
IMDEA Software Institute.
office 316
Campus de Montegancedo s/n
28223 - Pozuelo de Alarcón
Madrid, Spain

 name dot surename at imdea.org

Follow @germanD