| 2026 | FM | Reachability-Guided Abstraction Refinement. | Pierre Ganty, Nicolas Manini, Francesco Ranzato |
| 2026 | TACAS | A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata. | Kyveli Doveri, Pierre Ganty, B. Srivathsan |
| 2025 | FOSSACS | Temporal Hyperproperties for Population Protocols. | Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty, Csar Snchez |
| 2023 | TACAS | Antichains Algorithms for the Inclusion Problem Between mega-VPL. | Kyveli Doveri, Pierre Ganty, Luka Hadzi-Dokic |
| 2022 | CAV | FORQ-Based Language Inclusion Formal Testing. | Kyveli Doveri, Pierre Ganty, Nicolas Mazzocchi |
| 2021 | CONCUR | Inclusion Testing of Bchi Automata Based on Well-Quasiorders. | Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato |
| 2020 | MFCS | A Quasiorder-Based Perspective on Residual Automata. | Pierre Ganty, Elena Gutirrez, Pedro Valero |
| 2020 | PLDI | CacheQuery: learning replacement policies from hardware caches. | Pepe Vila, Pierre Ganty, Marco Guarnieri, Boris Kpf |
| 2019 | DCC | Regular Expression Search on Compressed Text. | Pierre Ganty, Pedro Valero |
| 2019 | MFCS | A Congruence-based Perspective on Automata Minimization Algorithms. | Pierre Ganty, Elena Gutirrez, Pedro Valero |
| 2019 | SAS | Language Inclusion Algorithms as Complete Abstract Interpretations. | Pierre Ganty, Francesco Ranzato, Pedro Valero |
| 2018 | CONCUR | Verification of Immediate Observation Population Protocols. | Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy |
| 2018 | LICS | Sound up-to techniques and Complete abstract domains. | Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic |
| 2017 | ATVA | Fixing the State Budget: Approximation of Regular Languages with Small DFAs. | Graeme Gange, Pierre Ganty, Peter J. Stuckey |
| 2017 | ATVA | A Language-Theoretic View on Network Protocols. | Pierre Ganty, Boris Kpf, Pedro Valero |
| 2017 | FCT | Parikh Image of Pushdown Automata. | Pierre Ganty, Elena Gutirrez |
| 2015 | CAV | Model Checking Parameterized Asynchronous Shared-Memory Systems. | Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty, Rupak Majumdar |
| 2015 | CONCUR | Verification of Population Protocols. | Javier Esparza, Pierre Ganty, Jrme Leroux, Rupak Majumdar |
| 2015 | ESOP | Analysis of Asynchronous Programs with Event-Based Synchronization. | Michael Emmi, Pierre Ganty, Rupak Majumdar, Fernando Rosa-Velardo |
| 2015 | FCT | Interprocedural Reachability for Flat Integer Programs. | Pierre Ganty, Radu Iosif |
| 2015 | MEMOCODE | From non-zenoness verification to termination. | Pierre Ganty, Samir Genaim, Ratan Lal, Pavithra Prabhakar |
| 2014 | LATA | Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification. | Pierre Ganty, Ahmed Rezine |
| 2013 | CAV | Parameterized Verification of Asynchronous Shared-Memory Systems. | Javier Esparza, Pierre Ganty, Rupak Majumdar |
| 2013 | CAV | Proving Termination Starting from the End. | Pierre Ganty, Samir Genaim |
| 2013 | TACAS | Underapproximation of Procedure Summaries for Integer Programs. | Pierre Ganty, Radu Iosif, Filip Konecn |
| 2012 | LICS | A Perfect Model for Bounded Verification. | Javier Esparza, Pierre Ganty, Rupak Majumdar |
| 2011 | POPL | Complexity of pattern-based verification for multithreaded programs. | Javier Esparza, Pierre Ganty |
| 2010 | CAV | Bounded Underapproximations. | Pierre Ganty, Rupak Majumdar, Benjamin Monmege |
| 2009 | POPL | Verifying liveness for asynchronous programs. | Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko |
| 2007 | SAS | Fixpoint-Guided Abstraction Refinements. | Patrick Cousot, Pierre Ganty, Jean-Franois Raskin |
| 2006 | VMCAI | A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. | Pierre Ganty, Jean-Franois Raskin, Laurent Van Begin |
| 2005 | SAS | Locality-Based Abstractions. | Javier Esparza, Pierre Ganty, Stefan Schwoon |
| 2004 | TACAS | Automatic Verification of Time Sensitive Cryptographic Protocols. | Giorgio Delzanno, Pierre Ganty |
| 2003 | FM | SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis. | Alessandro Armando, Luca Compagna, Pierre Ganty |