| 2025 | ICFEM | Formal Construction of Threat Detections from Attack Trees. | Dumitru-Bogdan Prelipcean, Catalin Dima, Daniele Varacca |
| 2024 | ICFEM | Deciding the Synthesis Problem for Hybrid Games Through Bisimulation. | Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Rgine Laleau |
| 2023 | EUMAS | Observational Preorders for Alternating Transition Systems. | Romain Demangeon, Catalin Dima, Daniele Varacca |
| 2020 | LICS | A Hennessy-Milner Theorem for ATL with Imperfect Information. | Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea |
| 2018 | KR | Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification. | Francesco Belardinelli, Catalin Dima, Aniello Murano |
| 2016 | STACS | Entropy Games and Matrix Multiplication Games. | Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin |
| 2015 | MFCS | Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. | Catalin Dima, Bastien Maubert, Sophie Pinchinat |
| 2014 | CAV | Safraless Synthesis for Epistemic Temporal Specifications. | Rodica Bozianu, Catalin Dima, Emmanuel Filiot |
| 2014 | CSL | Asymptotic behaviour in temporal logic. | Eugene Asarin, Michel Blockelet, Aldric Degorre, Catalin Dima, Chunyan Mu |
| 2014 | ITA | Zeta functions of finite-type-Dyck shifts are N-algebraic. | Marie-Pierre Bal, Michel Blockelet, Catalin Dima |
| 2014 | MFCS | Sofic-Dyck Shifts. | Marie-Pierre Bal, Michel Blockelet, Catalin Dima |
| 2013 | IFM | Verification of EB | Dimitris Vekris, Frdric Lang, Catalin Dima, Radu Mateescu |
| 2013 | TARK | Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. | Rodica Bozianu, Catalin Dima, Constantin Enea |
| 2009 | TIME | Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL. | Catalin Dima |
| 2007 | ICTAC | Distributed Time-Asynchronous Automata. | Catalin Dima, Ruggero Lanotte |
| 2007 | SYNASC | Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. | Catalin Dima, Constantin Enea, Radu Gramatovici, Alexandru Sofronia |
| 2005 | CONCUR | Timed Shuffle Expressions. | Catalin Dima |
| 2002 | LICS | Computing Reachability Relations in Timed Automata. | Catalin Dima |
| 2001 | PDP | Off-Line Real-Time Fault-Tolerant Scheduling. | Catalin Dima, Alain Girault, Christophe Lavarenne, Yves Sorel |
| 2000 | STACS | Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. | Catalin Dima |
| 1999 | FCT | Kleene Theorems for Event-Clock Automata. | Catalin Dima |