| 2026 | AAAI | Do LLMs Really Struggle at NL-FOL Translation? Revealing Their Strengths via a Novel Benchmarking Strategy. | Andrea Brunello, Luca Geatti, Michele Mignani, Angelo Montanari, Nicola Saccomanno |
| 2026 | AAAI | Automata-less Monitoring via Trace-Checking. | Andrea Brunello, Luca Geatti, Angelo Montanari, Nicola Saccomanno |
| 2025 | AAAI | First-Order Automata. | Luca Geatti, Alessandro Gianola, Nicola Gigante |
| 2025 | ECAI | Interpretable Early Failure Detection via Machine Learning and Trace Checking-Based Monitoring. | Andrea Brunello, Luca Geatti, Angelo Montanari, Nicola Saccomanno |
| 2025 | STACS | On Cascades of Reset Automata. | Roberto Borelli, Luca Geatti, Marco Montali, Angelo Montanari |
| 2025 | TIME | Safety and Liveness on Finite Words. | Luca Geatti, Stefano Pessotto, Stefano Tonetta |
| 2024 | AAAI | Foundations of Reactive Synthesis for Declarative Process Specifications. | Luca Geatti, Marco Montali, Andrey Rivkin |
| 2024 | CAV | SMT-Based Symbolic Model-Checking for Operator Precedence Languages. | Michele Chiari, Luca Geatti, Nicola Gigante, Matteo Pradella |
| 2024 | FOSSACS | Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems. | Luca Geatti, Alessio Mansutti, Angelo Montanari |
| 2024 | IJCAI | Learning What to Monitor: Using Machine Learning to Improve past STL Monitoring. | Andrea Brunello, Luca Geatti, Angelo Montanari, Nicola Saccomanno |
| 2023 | AAAI | Complexity of Safety and coSafety Fragments of Linear Temporal Logic. | Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari |
| 2023 | BPM | Foundations of Collaborative sfDECLARE. | Luca Geatti, Marco Montali, Andrey Rivkin |
| 2023 | ECAI | Decidable Fragments of LTL | Luca Geatti, Alessandro Gianola, Nicola Gigante, Sarah Winkler |
| 2023 | KR | A Singly Exponential Transformation of LTL[X, F] into Pure Past LTL. | Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari |
| 2023 | TIME | Qualitative past Timeline-Based Games (Extended Abstract). | Renato Acampora, Luca Geatti, Nicola Gigante, Angelo Montanari |
| 2023 | TIME | LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa. | Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari |
| 2023 | TIME | Torwards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories (Extended Abstract). | Luca Geatti, Alessandro Gianola, Nicola Gigante |
| 2022 | FOSSACS | A first-order logic characterisation of safety and co-safety languages. | Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta |
| 2022 | IJCAI | Linear Temporal Logic Modulo Theories over Finite Traces. | Luca Geatti, Alessandro Gianola, Nicola Gigante |
| 2021 | SEFM | Fairness, Assumptions, and Guarantees for Extended Bounded Response LTL+P Synthesis. | Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta |
| 2021 | TIME | Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker. | Luca Geatti, Nicola Gigante, Angelo Montanari, Gabriele Venturato |
| 2020 | FMCAD | Reactive Synthesis from Extended Bounded Response LTL Specifications. | Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta |
| 2020 | TACAS | Safe Decomposition of Startup Requirements: Verification and Synthesis. | Alessandro Cimatti, Luca Geatti, Alberto Griggio, Greg Kimberly, Stefano Tonetta |
| 2019 | TABLEAUX | A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL. | Luca Geatti, Nicola Gigante, Angelo Montanari |