| 2026 | CONCUR | WinPop: Making Populations Win Together. | Nathalie Bertrand, Patricia Bouyer, Luc Lapointe, Corto Mascle |
| 2026 | CONCUR | Reaching as Cheap as Possible in 1-Clock Robust Weighted Timed Games. | Nathalie Bertrand, Malle Gautrin, Julie Parreaux |
| 2026 | CONCUR | Parameterized Verification of Asynchronous Round-Based Distributed Algorithms via Reduction to Finite-Counter Systems. | Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin |
| 2026 | VMCAI | Reachability in Multi-agent Transfer Systems. | Nathalie Bertrand, Loc Hlout, Engel Lefaucheux, Luca Paparazzo |
| 2022 | ICALP | Parameterized Safety Verification of Round-Based Shared-Memory Systems. | Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger |
| 2022 | PODC | Brief Announcement: Holistic Verification of Blockchain Consensus. | Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder |
| 2021 | CONCUR | CONCUR Test-Of-Time Award 2021 (Invited Paper). | Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida |
| 2021 | CONCUR | Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. | Nathalie Bertrand, Bastien Thomas, Josef Widder |
| 2021 | CONCUR | Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. | Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur |
| 2021 | OPODIS | Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk). | Nathalie Bertrand |
| 2021 | VMCAI | A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries. | Nathalie Bertrand, Marijana Lazic, Josef Widder |
| 2020 | MFCS | Concurrent Games with Arbitrarily Many Players (Invited Talk). | Nathalie Bertrand |
| 2019 | CONCUR | Reconfiguration and Message Losses in Parameterized Broadcast Networks. | Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar |
| 2019 | CONCUR | Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. | Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder |
| 2019 | LICS | Long-run Satisfaction of Path Properties. | Christel Baier, Nathalie Bertrand, Jakob Piribauer, Ocan Sankur |
| 2018 | LICS | Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. | Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur |
| 2018 | TACAS | Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. | A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey |
| 2017 | CONCUR | Controlling a Population. | Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert |
| 2016 | CONCUR | Diagnosis in Infinite-State Probabilistic Systems. | Nathalie Bertrand, Serge Haddad, Engel Lefaucheux |
| 2016 | ICALP | Analysing Decisive Stochastic Processes. | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier |
| 2016 | LATA | Accurate Approximate Diagnosability of Stochastic Systems. | Nathalie Bertrand, Serge Haddad, Engel Lefaucheux |
| 2015 | CONCUR | Distributed Local Strategies in Broadcast Networks. | Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier |
| 2014 | FOSSACS | Active Diagnosis for Probabilistic Systems. | Nathalie Bertrand, Eric Fabre, Stefan Haar, Serge Haddad, Loc Hlout |
| 2014 | FOSSACS | Playing with Probabilities in Reconfigurable Broadcast Networks. | Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier |
| 2012 | CSL | Bounded Satisfiability for PCTL. | Nathalie Bertrand, John Fearnley, Sven Schewe |
| 2011 | FOSSACS | A Game Approach to Determinize Timed Automata. | Nathalie Bertrand, Amlie Stainer, Thierry Jron, Moez Krichen |
| 2011 | ICALP | Emptiness and Universality Problems in Timed Automata with Positive Frequency. | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amlie Stainer |
| 2011 | TACAS | Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata. | Nathalie Bertrand, Thierry Jron, Amlie Stainer, Moez Krichen |
| 2009 | CONCUR | The Effect of Tossing Coins in Omega-Automata. | Christel Baier, Nathalie Bertrand, Marcus Grer |
| 2009 | ICALP | When Are Timed Automata Determinizable? | Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye |
| 2009 | ICFEM | A Compositional Approach on Modal Specifications for Timed Systems. | Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet |
| 2009 | LATA | Refinement and Consistency of Timed Modal Specifications. | Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet |
| 2009 | LICS | Qualitative Determinacy and Decidability of Stochastic Games with Signals. | Nathalie Bertrand, Blaise Genest, Hugo Gimbert |
| 2009 | SOFSEM | Probabilistic Acceptors for Languages over Infinite Words. | Christel Baier, Nathalie Bertrand, Marcus Grer |
| 2008 | FOSSACS | On Decision Problems for Probabilistic Bchi Automata. | Christel Baier, Nathalie Bertrand, Marcus Grer |
| 2008 | LICS | Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. | Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Grer |
| 2006 | FORTE | Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. | Christel Baier, Nathalie Bertrand, Philippe Schnoebelen |
| 2006 | LPAR | On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. | Christel Baier, Nathalie Bertrand, Philippe Schnoebelen |
| 2003 | FOSSACS | Model Checking Lossy Channels Systems Is Probably Decidable. | Nathalie Bertrand, Philippe Schnoebelen |