Luca Padovani
blog
teaching
projects
publications
talks
software

Talks

Attacking the Termination Problem for Client-Server Sessions
๐Ÿ‡ฎ๐Ÿ‡น Bertinoro, OPCT 2023
A Logical Account of Subtyping for Session Types
๐Ÿ‡ซ๐Ÿ‡ท Paris, PLACES 2023
On Sessions, Linear Logic and Unbounded Interactions
๐Ÿ‡ซ๐Ÿ‡ท Sophia-Antipolis, 2023
An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear ฯ€-Calculus
๐Ÿ‡ต๐Ÿ‡ฑ Warsaw, CONCUR 2022
Fair Termination of Binary Sessions
๐Ÿ‡ฌ๐Ÿ‡ง Imperial College, 2022
Fair Termination of Binary Sessions
๐Ÿ‡ฎ๐Ÿ‡น Camerino, 2022
Fair Termination of Binary Sessions
๐Ÿ‡ฎ๐Ÿ‡น Bologna, ICTCS 2021
Probabilistic Analysis of Binary Sessions
๐Ÿ‡ฆ๐Ÿ‡น Vienna, CONCUR 2020
Types and Contracts for Binary Sessions, from Theory to Practice
๐Ÿ‡ฎ๐Ÿ‡น L'Aquila, GSSI 2019
A Logic for Mailboxes
๐Ÿ‡จ๐Ÿ‡ฟ Prague, BehAPI 2019
Concurrent Typestate-Oriented Programming in Java
๐Ÿ‡ธ๐Ÿ‡ช Uppsala, PLACES 2019
Mailbox Types for Unordered Interactions
๐Ÿ‡ณ๐Ÿ‡ฑ Amsterdam, ECOOP 2018
Mailbox Types for Unordered Interactions
๐Ÿ‡ซ๐Ÿ‡ท Lyon, Chocola 2018
Deadlock-Free Typestate-Oriented Programming
๐Ÿ‡ซ๐Ÿ‡ท Nice, <Programming> 2018
Chaperone Contracts for Higher-Order Sessions
๐Ÿ‡ฌ๐Ÿ‡ง Oxford, ICFP 2017
Context-Free Session Type Inference
๐Ÿ‡ธ๐Ÿ‡ช Uppsala, ESOP 2017
Typestate for Concurrent Objects
๐Ÿ‡ฉ๐Ÿ‡ช Dagstuhl, Dagstuhl Seminar 2017
FuSe an(other) OCaml Implementation of Binary Sessions
๐Ÿ‡ฉ๐Ÿ‡ช Dagstuhl, Dagstuhl Seminar 2017
Hybrid Protocol Conformance Verification for Binary Sessions
๐Ÿ‡ฎ๐Ÿ‡น Torino, PrePost 2017
The Chemical Approach to Typestate-Oriented Programming
๐Ÿ‡ท๐Ÿ‡ธ Novi Sad, 2016
The Chemical Approach to Typestate-Oriented Programming
๐Ÿ‡บ๐Ÿ‡ธ Pittsburgh, OOPSLA 2015
The Chemical Approach to Typestate-Oriented Programming
๐Ÿ‡ซ๐Ÿ‡ท Paris, PPS 2015
Chemistry of Typestates
๐Ÿ‡ฌ๐Ÿ‡ง London, BETTY 2015
Types for Deadlock-Free Higher-Order Programs
๐Ÿ‡ซ๐Ÿ‡ท Grenoble, FORTE 2015
Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear ฯ€-Calculi
๐Ÿ‡ซ๐Ÿ‡ท Grenoble, COORDINATION 2015
Linearity and the Pi Calculus, Revisited
๐Ÿ‡ฌ๐Ÿ‡ง Glasgow, CocoPops 2015
Deadlock and lock freedom in the linear ฯ€-calculus
๐Ÿ‡ฎ๐Ÿ‡น Torino, 2015
Type-based deadlock analysis of linear communications
๐Ÿ‡ฎ๐Ÿ‡น Lucca, IMT 2015
Types and Effects for Deadlock-Free Higher-Order Concurrent Programs
๐Ÿ‡ฏ๐Ÿ‡ต Shonan, NII Shonan Meeting 2014
Type Reconstruction for the Linear ฯ€-Calculus with Composite and Equi-Recursive Types
๐Ÿ‡ซ๐Ÿ‡ท Grenoble, FOSSACS 2014
Types and Effects for Deadlock-Free Higher-Order Concurrent Programs
๐Ÿ‡ซ๐Ÿ‡ท Grenoble, BETTY 2014
Type reconstruction for the linear ฯ€-calculus
๐Ÿ‡ฌ๐Ÿ‡ง London, Imperial College 2014
Behavioral Subtyping
๐Ÿ‡ญ๐Ÿ‡ท Lovran, 2014
Deadlock and Lock Freedom in the Linear ฯ€-Calculus
๐Ÿ‡ฆ๐Ÿ‡น Vienna, LICS 2014
Deadlock and Lock Freedom in the Linear ฯ€-Calculus
๐Ÿ‡ฎ๐Ÿ‡น Bologna, 2014
Un systรจme de types pour prรฉvenir les interblocages dans le ฯ€-calcul linรฉaire
๐Ÿ‡ซ๐Ÿ‡ท Paris, 2014
Fair Subtyping for Open Session Types
๐Ÿ‡ฑ๐Ÿ‡ป Riga, ICALP 2013
Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions
๐Ÿ‡ฎ๐Ÿ‡น Florence, COORDINATION 2013
From Lock Freedom to Progress Using Session Types
๐Ÿ‡ฎ๐Ÿ‡น Rome, PLACES 2013
Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions
๐Ÿ‡ฎ๐Ÿ‡น Rome, BEAT 2013
Exception Handling for Copyless Messaging
๐Ÿ‡ง๐Ÿ‡ช Leuven, PPDP 2012
Fair Subtyping for Multi-Party Session Types
๐Ÿ‡ฎ๐Ÿ‡ธ Reykjavรญk, COORDINATION 2011
Polymorphic Endpoint Types for Copyless Message Passing
๐Ÿ‡ฎ๐Ÿ‡ธ Reykjavรญk, ICE 2011
Fair Subtyping for Multi-Party Session Types
๐Ÿ‡ซ๐Ÿ‡ท Palaiseau, GeoCal 2011
Semantic Subtyping for Session Types
๐Ÿ‡ต๐Ÿ‡น Lisbon, 2011
Session Types = Intersection Types + Union Types
๐Ÿ‡ฌ๐Ÿ‡ง Edinburgh, ITRS 2010
Contracts for Mobile Processes
๐Ÿ‡ฎ๐Ÿ‡น Bologna, CONCUR 2009
Contract-based Discovery and Adaptation of Web Services
๐Ÿ‡ฎ๐Ÿ‡น Bertinoro, SFM 2009
Session Types at the Mirror
๐Ÿ‡ฎ๐Ÿ‡น Bologna, ICE 2009
Contracts for Web Services
๐Ÿ‡ฎ๐Ÿ‡น Torino, 2009
Contract-Directed Synthesis of Simple Orchestrators
๐Ÿ‡จ๐Ÿ‡ฆ Toronto, CONCUR 2008
A taste of Carbon
๐Ÿ‡ซ๐Ÿ‡ท Paris, PPS 2008
The Must Preorder Revisited
๐Ÿ‡ต๐Ÿ‡น Lisbon, CONCUR 2007
A Formal Account of Contracts for Web Services
๐Ÿ‡ซ๐Ÿ‡ท Paris, INRIA 2006
Compilation of Generic Regular Path Expressions Using C++ Class Templates
๐Ÿ‡ฌ๐Ÿ‡ง Edinburgh, CC 2005
Smooth Orchestrators
๐Ÿ‡ฌ๐Ÿ‡ง Edinburgh, FOSSACS 2005
PiDuce, a process calculus with native XML datatypes
๐Ÿ‡ฎ๐Ÿ‡น Urbino, 2005
A Math-Canvas for GNOME
๐Ÿ‡ณ๐Ÿ‡ด Kristiansand, GUADEC 2004

About Me

I'm an associate professor in Computer Science at the Computer Science Division of the School of Science and Technology of the University of Camerino. My research interests span both theory and practice in the areas of programming languages, type systems, concurrency theory, distributed computing and formal verification.

Contact Information

Public Profiles