A Graph Abstract Machine Describing Event Structure Composition. - Claudia Faggian; Mauro Piccolo (GT-VC@CONCUR, 2006)

Ludics is a Model for the Finitary Linear Pi-Calculus. - Claudia Faggian; Mauro Piccolo (TLCA, 2007)

Semantically linear programming languages. - Luca Paolini; Mauro Piccolo (PPDP, 2008)

A Process-Model for Linear Programs. - Luca Paolini; Mauro Piccolo (TYPES, 2008)

Partial Orders, Event Structures and Linear Strategies. - Claudia Faggian; Mauro Piccolo (TLCA, 2009)

Categorical Models for a Semantically Linear Lambda-calculus - Marco Gaboardi; Mauro Piccolo (LINEARITY, 2009)

Logical Semantics for Stability. - Luca Paolini; Mauro Piccolo; Simona Ronchi Della Rocca (MFPS, 2009)

Linearity and PCF: a semantic insight! - Marco Gaboardi; Luca Paolini; Mauro Piccolo (ICFP, 2011)

Strong Normalization in the π-calculus with Intersection and Union Types. - Mauro Piccolo (Fundam. Informaticae, 2012)

Certified Complexity (CerCo). - Roberto M. Amadio; Nicholas Ayache; François Bobot; Jaap Boender; Brian Campbell 001; Ilias Garnier; Antoine Madet; James McKinna; Dominic P. Mulligan; Mauro Piccolo; Randy Pollack; Yann Régis-Gianas; et al. (FOPARA, 2013)

What is a model for a semantically linear λ-calculus? - Marco Gaboardi; Mauro Piccolo (J. Log. Comput., 2014)

A Certified Study of a Reversible Programming Language. - Luca Paolini; Mauro Piccolo; Luca Roversi (TYPES, 2015)

A Class of Reversible Primitive Recursive Functions. - Luca Paolini; Mauro Piccolo; Luca Roversi (ICTCS, 2015)

On the reification of semantic linearity. - Marco Gaboardi; Luca Paolini; Mauro Piccolo (Math. Struct. Comput. Sci., 2016)

Essential and relational models. - Luca Paolini; Mauro Piccolo; Simona Ronchi Della Rocca (Math. Struct. Comput. Sci., 2017)

On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions. - Luca Paolini; Mauro Piccolo; Luca Roversi (New Gener. Comput., 2018)

QPCF: Higher-Order Languages and Quantum Circuits. - Luca Paolini; Mauro Piccolo; Margherita Zorzi (J. Autom. Reason., 2019)

A class of Recursive Permutations which is Primitive Recursive complete. - Luca Paolini; Mauro Piccolo; Luca Roversi (Theor. Comput. Sci., 2020)