| 2026 | FOSSACS | Inquisitive Team Semantics of LTL. | Laura Bozzelli, Tadeusz Litak, Munyque Mittelmann, Aniello Murano |
| 2025 | EUMAS | An Intuitionistic Version of Computation Tree Logic. | Laura Bozzelli, Andrea Capone, Davide Catta, Vadim Malvone, Aniello Murano |
| 2025 | KR | An Intuitionistic Version of Alternating-Time Temporal Logic. | Laura Bozzelli, Andrea Capone, Davide Catta, Aniello Murano |
| 2024 | ICALP | Automata-Theoretic Characterisations of Branching-Time Temporal Logics. | Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron |
| 2024 | TIME | Full Characterisation of Extended CTL. | Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron |
| 2023 | LICS | Quantifying Over Trees in Monadic Second-Order Logic. | Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron |
| 2022 | CONCUR | Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. | Laura Bozzelli, Adriano Peron, Csar Snchez |
| 2022 | TIME | A Quantitative Extension of Interval Temporal Logic over Infinite Words. | Laura Bozzelli, Adriano Peron |
| 2021 | LICS | Asynchronous Extensions of HyperLTL. | Laura Bozzelli, Adriano Peron, Csar Snchez |
| 2021 | TIME | Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes. | Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala |
| 2020 | KR | Module Checking of Pushdown Multi-agent Systems. | Laura Bozzelli, Aniello Murano, Adriano Peron |
| 2020 | MFCS | On a Temporal Logic of Prefixes and Infixes. | Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala |
| 2019 | IJCAI | The Complexity of Model Checking Knowledge and Time. | Laura Bozzelli, Bastien Maubert, Aniello Murano |
| 2019 | TIME | Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic. | Laura Bozzelli, Angelo Montanari, Adriano Peron |
| 2018 | KR | Decidability and Complexity of Timeline-Based Planning over Dense Temporal Domains. | Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron |
| 2018 | LATA | Event-Clock Nested Automata. | Laura Bozzelli, Aniello Murano, Adriano Peron |
| 2018 | TIME | Results on Alternating-Time Temporal Logics with Linear Past. | Laura Bozzelli, Aniello Murano, Loredana Sorrentino |
| 2017 | ICALP | Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. | Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala |
| 2017 | SEFM | An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions. | Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron |
| 2017 | TIME | Hierarchical Cost-Parity Games. | Laura Bozzelli, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino |
| 2016 | CADE | Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments. | Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala |
| 2016 | JELIA | On the Expressiveness of Temporal Equilibrium Logic. | Laura Bozzelli, David Pearce |
| 2015 | FOSSACS | Unifying Hyper and Epistemic Temporal Logics. | Laura Bozzelli, Bastien Maubert, Sophie Pinchinat |
| 2015 | LICS | On the Complexity of Temporal Equilibrium Logic. | Laura Bozzelli, David Pearce |
| 2014 | CADE | Visibly Linear Temporal Logic. | Laura Bozzelli, Csar Snchez |
| 2014 | RV | Foundations of Boolean Stream Runtime Verification. | Laura Bozzelli, Csar Snchez |
| 2013 | IJCAI | The Complexity of One-Agent Refinement Modal Logic. | Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat |
| 2012 | JELIA | The Complexity of One-Agent Refinement Modal Logic. | Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat |
| 2012 | LATA | Strong Termination for Gap-Order Constraint Abstractions of Counter Systems. | Laura Bozzelli |
| 2012 | VMCAI | Verification of Gap-Order Constraint Abstractions of Counter Systems. | Laura Bozzelli, Sophie Pinchinat |
| 2011 | TABLEAUX | Hybrid and First-Order Complete Extensions of CaRet. | Laura Bozzelli, Ruggero Lanotte |
| 2010 | LPAR | Hardness of Preorder Checking for Basic Formalisms. | Laura Bozzelli, Axel Legay, Sophie Pinchinat |
| 2008 | FOSSACS | The Complexity of CTL* + Linear Past. | Laura Bozzelli |
| 2008 | JELIA | Complexity and Succinctness Issues for Linear-Time Hybrid Logics. | Laura Bozzelli, Ruggero Lanotte |
| 2008 | TIME | The Complexity of CaRet + Chop. | Laura Bozzelli |
| 2007 | CONCUR | Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages. | Laura Bozzelli |
| 2007 | ICALP | Decision Problems for Lower/Upper Bound Parametric Timed Automata. | Laura Bozzelli, Salvatore La Torre |
| 2006 | CONCUR | Controller Synthesis for MTL Specifications. | Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier |
| 2006 | LPAR | Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. | Laura Bozzelli, Rgis Gascon |
| 2006 | VMCAI | Complexity Results on Branching-Time Pushdown Model Checking. | Laura Bozzelli |
| 2006 | VMCAI | Verification of Well-Formed Communicating Recursive State Machines. | Laura Bozzelli, Salvatore La Torre, Adriano Peron |
| 2005 | LPAR | Pushdown Module Checking. | Laura Bozzelli, Aniello Murano, Adriano Peron |
| 2005 | VMCAI | Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties. | Laura Bozzelli |