| 2024 | LATIN | Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. | Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko |
| 2024 | TIME | Strategic Reasoning Under Imperfect Information with Synchronous Semantics (Invited Talk). | Sophie Pinchinat |
| 2022 | AAAI | Formula Synthesis in Propositional Dynamic Logic with Shuffle. | Sophie Pinchinat, Sasha Rubin, Franois Schwarzentruber |
| 2020 | ECAI | Dynamic Epistemic Logic Games with Epistemic Temporal Goals. | Bastien Maubert, Aniello Murano, Sophie Pinchinat, Franois Schwarzentruber, Silvia Stranieri |
| 2020 | IJCAI | Concurrent Games in Dynamic Epistemic Logic. | Bastien Maubert, Sophie Pinchinat, Franois Schwarzentruber, Silvia Stranieri |
| 2019 | IJCAI | Reachability Games in Dynamic Epistemic Logic. | Bastien Maubert, Sophie Pinchinat, Franois Schwarzentruber |
| 2018 | AiML | Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis. | Gatan Douneau-Tabot, Sophie Pinchinat, Franois Schwarzentruber |
| 2018 | IJCAI | Small Undecidable Problems in Epistemic Planning. | Sbastien L Cong, Sophie Pinchinat, Franois Schwarzentruber |
| 2017 | ESORICS | Is My Attack Tree Correct? | Maxime Audinot, Sophie Pinchinat, Barbara Kordy |
| 2017 | TABLEAUX | Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment. | Tristan Charrier, Sophie Pinchinat, Franois Schwarzentruber |
| 2015 | FOSSACS | Unifying Hyper and Epistemic Temporal Logics. | Laura Bozzelli, Bastien Maubert, Sophie Pinchinat |
| 2015 | MFCS | Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. | Catalin Dima, Bastien Maubert, Sophie Pinchinat |
| 2015 | PRIMA | Games with Communication: From Belief to Preference Change. | Guillaume Aucher, Bastien Maubert, Sophie Pinchinat, Franois Schwarzentruber |
| 2014 | SEFM | Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis. | Sophie Pinchinat, Mathieu Acher, Didier Vojtisek |
| 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 | VMCAI | Verification of Gap-Order Constraint Abstractions of Counter Systems. | Laura Bozzelli, Sophie Pinchinat |
| 2010 | AiML | Future Event Logic - Axioms and Complexity. | Hans van Ditmarsch, Tim French, Sophie Pinchinat |
| 2010 | LPAR | Hardness of Preorder Checking for Basic Formalisms. | Laura Bozzelli, Axel Legay, Sophie Pinchinat |
| 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 | TIME | On the Expressivity of RoCTL*. | John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat |
| 2007 | ATVA | A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies. | Sophie Pinchinat |
| 2003 | MFCS | Quantified Mu-Calculus for Control Synthesis. | Stphane Riedweg, Sophie Pinchinat |
| 1991 | CSL | Ordinal Processes in Comparative Concurrency Semantics. | Sophie Pinchinat |
| 1990 | ESOP | On the Weak Adequacy of Branching-Time Remporal Logic. | Philippe Schnoebelen, Sophie Pinchinat |