| 2025 | CBMI | Does CLIP Perceive Art the Same Way We Do? | Andrea Asperti, Leonardo Dess, Maria Chiara Tonetti, Nico Wu |
| 2024 | EMNLP | A Notion of Complexity for Theory of Mind via Discrete World Models. | Xuanqiang Angelo Huang, Emanuele La Malfa, Samuele Marro, Andrea Asperti, Anthony G. Cohn, Michael J. Wooldridge |
| 2015 | CPP | The Speedup Theorem in a Primitive Recursive Framework. | Andrea Asperti |
| 2013 | CPP | A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem. | Andrea Asperti |
| 2013 | ITP | A Machine-Checked Proof of the Odd Order Theorem. | Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, Franois Garillot, Stphane Le Roux, Assia Mahboubi, Russell O'Connor, Sidi Ould Biha, Ioana Pasca, Laurence Rideau, Alexey Solovyev, Enrico Tassi, Laurent Thry |
| 2013 | LICS | The Cost of Usage in the Lambda-Calculus. | Andrea Asperti, Jean-Jacques Lvy |
| 2012 | AISC | Proof, Message and Certificate. | Andrea Asperti |
| 2012 | AISC | A Web Interface for Matita. | Andrea Asperti, Wilmer Ricciotti |
| 2012 | CPP | Rating Disambiguation Errors. | Andrea Asperti, Wilmer Ricciotti |
| 2012 | ITP | A Compact Proof of Decidability for Regular Expression Equivalence. | Andrea Asperti |
| 2012 | WoLLIC | Formalizing Turing Machines. | Andrea Asperti, Wilmer Ricciotti |
| 2011 | CADE | The Matita Interactive Theorem Prover. | Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi |
| 2010 | AISC | Some Considerations on the Usability of Interactive Provers. | Andrea Asperti, Claudio Sacerdoti Coen |
| 2010 | AISC | Smart Matching. | Andrea Asperti, Enrico Tassi |
| 2008 | POPL | The intensional content of Rice's theorem. | Andrea Asperti |
| 2000 | POPL | (Optimal) Duplication is not Elementary Recursive. | Andrea Asperti, Paolo Coppola, Simone Martini |
| 1998 | LICS | Light Affine Logic. | Andrea Asperti |
| 1998 | POPL | Parallel Beta Reduction is not Elementary Recursive. | Andrea Asperti, Harry G. Mairson |
| 1997 | ICALP | On the Dynamics of Sharing Graphs. | Andrea Asperti, Cosimo Laneve |
| 1996 | POPL | On the Complexity of Beta-Reduction. | Andrea Asperti |
| 1994 | LFCS | Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. | Andrea Asperti, Giovanna M. Dore |
| 1994 | LICS | Paths in the lambda-calculus | Andrea Asperti, Vincent Danos, Cosimo Laneve, Laurent Regnier |
| 1990 | POPL | Implicative Formulae in the "Proofs as Computations" Analogy. | Andrea Asperti, Gian-Luigi Ferrari, Roberto Gorrieri |
| 1989 | ICLP | Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs. | Andrea Asperti, Simone Martini |