| 2026 | CSL | Robustness of Constraint Automata for Description Logics with Concrete Domains. | Stphane Demri, Tianwen Gu |
| 2025 | KR | On the Effects of Adding Assignments in Linear-Time Temporal Logics Modulo Theories. | Stphane Demri, Raul Fervari |
| 2024 | ECAI | Computational Complexity of Standpoint LTL. | Stphane Demri, Przemyslaw Andrzej Walega |
| 2023 | AAAI | Model-Checking for Ability-Based Logics with Constrained Plans. | Stphane Demri, Raul Fervari |
| 2023 | CONCUR | Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures. | Stphane Demri, Karin Quaas |
| 2023 | JELIA | First Steps Towards Taming Description Logics with Strings. | Stphane Demri, Karin Quaas |
| 2023 | KR | How to Manage a Budget with ATL+. | Stphane Demri, Raine Rnnholm |
| 2020 | AAAI | Parameterised Resource-Bounded ATL. | Natasha Alechina, Stphane Demri, Brian Logan |
| 2020 | CSL | Internal Calculi for Separation Logics. | Stphane Demri, tienne Lozes, Alessio Mansutti |
| 2020 | ECAI | Reasoning with a Bounded Number of Resources in ATL+. | Francesco Belardinelli, Stphane Demri |
| 2020 | IJCAI | A Framework for Reasoning about Dynamic Axioms in Description Logics. | Bartosz Bednarczyk, Stphane Demri, Alessio Mansutti |
| 2020 | LICS | Modal Logics with Composition on Finite Forests: Expressivity and Complexity. | Bartosz Bednarczyk, Stphane Demri, Raul Fervari, Alessio Mansutti |
| 2019 | JELIA | Axiomatising Logics with Separating Conjunction and Modalities. | Stphane Demri, Raul Fervari, Alessio Mansutti |
| 2019 | LICS | Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? | Bartosz Bednarczyk, Stphane Demri |
| 2018 | AiML | On the Complexity of Modal Separation Logics. | Stphane Demri, Raul Fervari |
| 2018 | FOSSACS | The Effects of Adding Reachability Predicates in Propositional Separation Logic. | Stphane Demri, tienne Lozes, Alessio Mansutti |
| 2018 | TIME | On Temporal and Separation Logics (Invited Paper). | Stphane Demri |
| 2014 | AiML | The Effects of Modalities in Separation Logics (Extended Abstract). | Stphane Demri, Morgan Deters |
| 2014 | CSL | Expressive completeness of separation logic with two variables and no separating conjunction. | Stphane Demri, Morgan Deters |
| 2014 | CSR | Separation Logic with One Quantified Variable. | Stphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Mry |
| 2013 | CSR | Model-Checking Bounded Multi-Pushdown Systems. | Kshitij Bansal, Stphane Demri |
| 2013 | ICALP | On the Complexity of Verifying Regular Properties on Flat Counter Systems, . | Stphane Demri, Amit Kumar Dhar, Arnaud Sangnier |
| 2013 | LICS | Reasoning about Data Repetitions with Counter Systems. | Stphane Demri, Diego Figueira, M. Praveen |
| 2013 | TABLEAUX | Witness Runs for Counter Machines - (Abstract). | Clark W. Barrett, Stphane Demri, Morgan Deters |
| 2012 | AiML | Beyond Regularity for Presburger Modal Logic. | Facundo Carreiro, Stphane Demri |
| 2012 | CADE | Taming Past LTL and Flat Counter Systems. | Stphane Demri, Amit Kumar Dhar, Arnaud Sangnier |
| 2011 | LOPSTR | Automata-Based Computation of Temporal Equilibrium Models. | Pedro Cabalar, Stphane Demri |
| 2010 | FOSSACS | When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. | Stphane Demri, Arnaud Sangnier |
| 2010 | JELIA | Counter Systems for Data Logics. | Stphane Demri |
| 2008 | CSL | On the Almighty Wand. | Rmi Brochenin, Stphane Demri, tienne Lozes |
| 2008 | FOSSACS | Model Checking Freeze LTL over One-Counter Automata. | Stphane Demri, Ranko Lazic, Arnaud Sangnier |
| 2007 | LFCS | Reasoning About Sequences of Memory States. | Rmi Brochenin, Stphane Demri, tienne Lozes |
| 2007 | LFCS | A Decidable Temporal Logic of Repeating Values. | Stphane Demri, Deepak D'Souza, Rgis Gascon |
| 2007 | LPAR | The Complexity of Temporal Logic with Until and Since over Ordinals. | Stphane Demri, Alexander Rabinovich |
| 2007 | TIME | The Effects of Bounding Syntactic Resources on Presburger LTL. | Stphane Demri, Rgis Gascon |
| 2006 | ATVA | Towards a Model-Checker for Counter Systems. | Stphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen |
| 2006 | CADE | Presburger Modal Logic Is PSPACE-Complete. | Stphane Demri, Denis Lugiez |
| 2006 | LICS | LTL with the Freeze Quantifier and Register Automata. | Stphane Demri, Ranko Lazic |
| 2005 | ATVA | Reasoning About Transfinite Sequences. | Stphane Demri, David Nowak |
| 2005 | CONCUR | Verification of Qualitative Constraints. | Stphane Demri, Rgis Gascon |
| 2005 | TIME | On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. | Stphane Demri, Ranko Lazic, David Nowak |
| 2004 | FOSSACS | LTL over Integer Periodicity Constraints: (Extended Abstract). | Stphane Demri |
| 2002 | STACS | A Parametric Analysis of the State Explosion Problem in Model Checking. | Stphane Demri, Franois Laroussinie, Philippe Schnoebelen |
| 2000 | AiML | Modal Logics with Weak Forms of Recursion: PSPACE Specimens. | Stphane Demri |
| 2000 | TABLEAUX | Complexity of Simple Dependent Bimodal Logics. | Stphane Demri |
| 1999 | CADE | Tractable Transformations from Modal Provability Logics into First-Order Logic. | Stphane Demri, Rajeev Gor |
| 1999 | TABLEAUX | Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? | Stphane Demri |
| 1999 | TABLEAUX | Cut-Free Display Calculi for Nominal Tense Logics. | Stphane Demri, Rajeev Gor |
| 1998 | JELIA | Relative Similarity Logics are Decidable: Reduction to FO | Stphane Demri, Beata Konikowska |
| 1998 | STACS | The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). | Stphane Demri, Philippe Schnoebelen |
| 1997 | IJCAI | Prefixed Tableaux Systems for Modal Logics with Enriched Languages. | Philippe Balbiani, Stphane Demri |
| 1996 | MFCS | A Class of Information Logics with a Decidable Validity Problem. | Stphane Demri |
| 1996 | TABLEAUX | A Simple Tableau System for the Logic of Elsewhere. | Stphane Demri |
| 1995 | IJCAI | On the Complexity of Extending Ground Resolution with Symmetry Rules. | Thierry Boy de la Tour, Stphane Demri |
| 1995 | TABLEAUX | Using Connection Method in Modal Logics: Some Advantages. | Stphane Demri |
| 1994 | JELIA | Efficient Strategies for Automated Reasoning in Modal Logics. | Stphane Demri |
| 1993 | IJCAI | Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5. | Ricardo Caferra, Stphane Demri |
| 1992 | CADE | Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic. | Ricardo Caferra, Stphane Demri |
| 1991 | AAAI | Logic Morphisms as a Framework for Backward Transfer of Lemmas and Strategies in Some Modal and Epistemic Logics. | Ricardo Caferra, Stphane Demri, Michel Herment |