| 2026 | VMCAI | Verification of Generic VHDL Designs and Their Translation to Rocq. | Ocan Sankur, Benot Boyer, Florian Faissole |
| 2025 | ATVA | Prompt Runtime Enforcement. | Ayush Anand, Loc Germerie Guizouarn, Thierry Jron, Sayan Mukherjee, Srinivas Pinisetty, Ocan Sankur |
| 2025 | ICALP | The Value Problem for Multiple-Environment MDPs with Parity Objective. | Krishnendu Chatterjee, Laurent Doyen, Jean-Franois Raskin, Ocan Sankur |
| 2024 | ECAI | An Efficient Modular Algorithm for Connected Multi-Agent Path Finding. | Victorien Desbois, Ocan Sankur, Franois Schwarzentruber |
| 2023 | TACAS | Timed Automata Verification and Synthesis via Finite Automata Learning. | Ocan Sankur |
| 2023 | TACAS | PyLTA: A Verification Tool for Parameterized Distributed Algorithms. | Bastien Thomas, Ocan Sankur |
| 2022 | ATVA | Repairing Real-Time Requirements. | Reiya Noguchi, Ocan Sankur, Thierry Jron, Nicolas Markey, David Mentr |
| 2022 | ICALP | Parameterized Safety Verification of Round-Based Shared-Memory Systems. | Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger |
| 2022 | ICALP | The Variance-Penalized Stochastic Shortest Path Problem. | Jakob Piribauer, Ocan Sankur, Christel Baier |
| 2021 | AI | Planning for Connected Agents in a Partially Known Environment. | Arthur Queffelec, Ocan Sankur, Franois Schwarzentruber |
| 2021 | CONCUR | Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. | Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur |
| 2021 | IJCAI | Connect Multi-Agent Path Finding: Generation and Visualization. | Arthur Queffelec, Ocan Sankur, Franois Schwarzentruber |
| 2019 | CAV | Robust Controller Synthesis in Timed Bchi Automata: A Symbolic Approach. | Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur |
| 2019 | CAV | Abstraction Refinement Algorithms for Timed Automata. | Victor Roussanaly, Ocan Sankur, Nicolas Markey |
| 2019 | IJCAI | Reachability and Coverage Planning for Connected Agents. | Tristan Charrier, Arthur Queffelec, Ocan Sankur, Franois Schwarzentruber |
| 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 |
| 2017 | CONCUR | Admissibility in Games with Imperfect Information (Invited Talk). | Romain Brenguier, Arno Pauly, Jean-Franois Raskin, Ocan Sankur |
| 2017 | ICALP | Admissiblity in Concurrent Games. | Nicolas Basset, Gilles Geeraerts, Jean-Franois Raskin, Ocan Sankur |
| 2017 | TACAS | An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP. | Ocan Sankur, Jean-Pierre Talpin |
| 2016 | LATA | Non-Zero Sum Games for Reactive Synthesis. | Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Prez, Mickael Randour, Jean-Franois Raskin, Ocan Sankur, Mathieu Sassolas |
| 2015 | CAV | Percentile Queries in Multi-dimensional Markov Decision Processes. | Mickael Randour, Jean-Franois Raskin, Ocan Sankur |
| 2015 | CONCUR | Assume-Admissible Synthesis. | Romain Brenguier, Jean-Franois Raskin, Ocan Sankur |
| 2015 | TACAS | Symbolic Quantitative Robustness Analysis of Timed Automata. | Ocan Sankur |
| 2015 | VMCAI | Variations on the Stochastic Shortest Path Problem. | Mickael Randour, Jean-Franois Raskin, Ocan Sankur |
| 2014 | CONCUR | Probabilistic Robust Timed Games. | Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur |
| 2013 | CAV | Shrinktech: A Tool for the Robustness Analysis of Timed Automata. | Ocan Sankur |
| 2013 | CONCUR | Robust Controller Synthesis in Timed Automata. | Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier |
| 2012 | CONCUR | A Comparison of Succinctly Represented Finite-State Systems. | Romain Brenguier, Stefan Gller, Ocan Sankur |
| 2012 | ICALP | Robust Reachability in Timed Automata: A Game-Based Approach. | Patricia Bouyer, Nicolas Markey, Ocan Sankur |
| 2011 | CONCUR | Timed Automata Can Always Be Made Implementable. | Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane |
| 2011 | MFCS | Untimed Language Preservation in Timed Systems. | Ocan Sankur |
| 2010 | STACS | Online Correlation Clustering. | Claire Mathieu, Ocan Sankur, Warren Schudy |