Constructive System for Automatic Program Synthesis. - Didier Galmiche (Theor. Comput. Sci., 1990)

Automated Deduction in Additive and Multiplicative Linear Logic. - Didier Galmiche; Guy Perrier (LFCS, 1992)

A Procedure for Automatic Proof Nets Construction. - Didier Galmiche; Guy Perrier (LPAR, 1992)

Program Development in Constructive Type Theory. - Didier Galmiche (Theor. Comput. Sci., 1992)

SKIL: A System for Programming with Proofs. - Didier Galmiche; O. Hermann (LPAR, 1993)

Canonical Proofs for Linear Logic Programming Frameworks. - Didier Galmiche (ICLP Workshop: Proof-Theoretical Extensions on Logic Programming, 1994)

Foundations of Proof Search Strategies Design in Linear Logic. - Didier Galmiche; Guy Perrier (LFCS, 1994)

On Proof Normalization in Linear Logic. - Didier Galmiche; Guy Perrier (Theor. Comput. Sci., 1994)

Proofs, Concurrent Objects, and Computations in a FILL Framework. - Didier Galmiche; Eric Boudinet (OBPDC, 1995)

Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic. - Didier Galmiche; Bruno Martin (Proof Search in Type-Theoretic Languages@CADE, 1998)

Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. - Dominique Larchey-Wendling; Didier Galmiche (Workshop on Domains, 1998)

Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. - Dominique Larchey-Wendling; Didier Galmiche (Proof Search in Type-Theoretic Languages@CADE, 1998)

Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. - Didier Galmiche; Dominique Larchey-Wendling (ASIAN, 1999)

Foreword. - Jean Paul Bahsoun; José Luiz Fiadeiro; Didier Galmiche (Math. Struct. Comput. Sci., 1999)

A specification logic for concurrent object-oriented programming. - Giorgio Delzanno; Didier Galmiche; Maurizio Martelli (Math. Struct. Comput. Sci., 1999)

Workshop: Type-Theoretic Languages: Proof-Search and Semantics. - Didier Galmiche (CADE, 2000)

Preface. - Didier Galmiche (Workshop on Type-Theoretic Languages: Proof Search and Semantics, 2000)

Proof-search and proof nets in Mixed Linear Logic. - Didier Galmiche; J.-M. Notin (Workshop on Type-Theoretic Languages: Proof Search and Semantics, 2000)

Connection methods in linear logic and proof nets construction. - Didier Galmiche (Theor. Comput. Sci., 2000)

Proof-search in type-theoretic languages: an introduction. - Didier Galmiche; David J. Pym (Theor. Comput. Sci., 2000)

STRIP: Structural Sharing for Efficient Proof-Search. - Dominique Larchey-Wendling; Daniel Méry; Didier Galmiche (IJCAR, 2001)

Proof-Search and Countermodel Generation in Propositional BI Logic. - Didier Galmiche; Daniel Méry (TACS, 2001)

Connection-Based Proof Search in Propositional BI Logic. - Didier Galmiche; Daniel Méry (CADE, 2002)

Resource Tableaux. - Didier Galmiche; Daniel Méry; David J. Pym (CSL, 2002)

LINK: A Proof Environment Based on Proof Nets. - L. Habert; J.-M. Notin; Didier Galmiche (TABLEAUX, 2002)

A Separation Logic for Resource Distribution: Extended Abstract. - Nicolas Biri; Didier Galmiche (FSTTCS, 2003)

Connection-Based Proof Construction in Non-commutative Logic. - Didier Galmiche; J.-M. Notin (LPAR, 2003)

Semantic Labelled Tableaux for Propositional BI. - Didier Galmiche; Daniel Méry (J. Log. Comput., 2003)

Resource Graphs and Countermodels in Resource Logics. - Didier Galmiche; Daniel Méry (D/PDPAR@IJCAR, 2004)

Characterizing Provability in . - Didier Galmiche; Daniel Méry (LPAR, 2005)

The semantics of BI and resource tableaux. - Didier Galmiche; Daniel Méry; David J. Pym (Math. Struct. Comput. Sci., 2005)

Expressivity Properties of Boolean. - Didier Galmiche; Dominique Larchey-Wendling (FSTTCS, 2006)

Models and Separation Logics for Resource Trees. - Nicolas Biri; Didier Galmiche (J. Log. Comput., 2007)

Labelled Calculi for Lukasiewicz Logics. - Didier Galmiche; Yakoub Salhi (WoLLIC, 2008)

Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. - Dominique Larchey-Wendling; Didier Galmiche (Math. Struct. Comput. Sci., 2009)

The Undecidability of Boolean BI through Phase Semantics. - Dominique Larchey-Wendling; Didier Galmiche (LICS, 2010)

Label-Free Proof Systems for Intuitionistic Modal Logic IS5. - Didier Galmiche; Yakoub Salhi (LPAR (Dakar), 2010)

Label-free natural deduction systems for intuitionistic and classical modal logics. - Didier Galmiche; Yakoub Salhi (J. Appl. Non Class. Logics, 2010)

A family of Gödel hybrid logics. - Didier Galmiche; Yakoub Salhi (J. Appl. Log., 2010)

Tableaux and Resource Graphs for Separation Logic. - Didier Galmiche; Daniel Méry (J. Log. Comput., 2010)

Sequent calculi and decidability for intuitionistic hybrid logic. - Didier Galmiche; Yakoub Salhi (Inf. Comput., 2011)

A Modal BI Logic for Dynamic Resource Properties. - Jean-René Courtault; Didier Galmiche (LFCS, 2013)

A Connection-based Characterization of Bi-intuitionistic Validity. - Didier Galmiche; Daniel Méry (J. Autom. Reason., 2013)

Nondeterministic Phase Semantics and the Undecidability of Boolean BI. - Dominique Larchey-Wendling; Didier Galmiche (ACM Trans. Comput. Log., 2013)

Looking at Separation Algebras with Boolean BI-eyes. - Dominique Larchey-Wendling; Didier Galmiche (IFIP TCS, 2014)

An Epistemic Separation Logic. - Jean-René Courtault; Hans van Ditmarsch; Didier Galmiche (WoLLIC, 2015)

About intuitionistic public announcement logic. - Philippe Balbiani; Didier Galmiche (Advances in Modal Logic, 2016)

Special Issue on Computational Logic in Honour of Roy Dyckhoff. - Didier Galmiche; Stéphane Graham-Lengrand (J. Log. Comput., 2016)

A logic of separating modalities. - Jean-René Courtault; Didier Galmiche; David J. Pym (Theor. Comput. Sci., 2016)

A Substructural Epistemic Resource Logic. - Didier Galmiche; Pierre Kimmel; David J. Pym (ICLA, 2017)

Separation Logic with One Quantified Variable. - Stéphane Demri; Didier Galmiche; Dominique Larchey-Wendling; Daniel Méry (Theory Comput. Syst., 2017)

Labelled Connection-based Proof Search for Multiplicative Intuitionistic. - Didier Galmiche; Daniel Méry (ARQNL@IJCAR, 2018)

A modal separation logic for resource dynamics. - Jean-René Courtault; Didier Galmiche (J. Log. Comput., 2018)

Preface. - Didier Galmiche; David J. Pym (J. Log. Comput., 2018)

Tree-sequent calculi and decision procedures for intuitionistic modal logics. - Didier Galmiche; Yakoub Salhi (J. Log. Comput., 2018)

Relating Labelled and Label-Free Bunched Calculi in BI Logic. - Didier Galmiche; Michel Marti; Daniel Méry (TABLEAUX, 2019)

A substructural epistemic resource logic: theory and modelling applications. - Didier Galmiche; Pierre Kimmel; David J. Pym (J. Log. Comput., 2019)

A public announcement separation logic. - Jean-René Courtault; Hans van Ditmarsch; Didier Galmiche (Math. Struct. Comput. Sci., 2019)

Preface: Special Issue of Selected Extended Papers from IJCAR 2018. - Didier Galmiche; Stephan Schulz 001; Roberto Sebastiani (J. Autom. Reason., 2020)

Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with Identity. - Didier Galmiche; Marta Gawek; Daniel Méry (FSCD, 2021)

Labelled cyclic proofs for separation logic. - Didier Galmiche; Daniel Méry (J. Log. Comput., 2021)

Labelled Tableaux for Linear Time Bunched Implication Logic. - Didier Galmiche; Daniel Méry (FSCD, 2023)

A Separation Logic with Histories of Epistemic Actions as Resources. - Hans van Ditmarsch; Didier Galmiche; Marta Gawek (WoLLIC, 2023)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations. - Tim S. Lyon; Agata Ciabattoni; Didier Galmiche; Marianna Girlando; Dominique Larchey-Wendling; Daniel Méry; Nicola Olivetti; Revantha Ramanayake (CoRR, 2023)

An Epistemic Separation Logic with Action Models. - Hans van Ditmarsch; Didier Galmiche; Marta Gawek (J. Log. Lang. Inf., 2023)

Separation Logics: Semantics and Proofs (invited talk abstract). - Didier Galmiche (ARQNL@IJCAR, 2024)

Automated Proof Search in Intuitionistic Sentential Logic. - Didier Galmiche; Brandon Hornbeck; Daniel Méry (ARQNL@IJCAR, 2024)

Minimalistic System Modelling: Behaviours, Interfaces, and Local Reasoning. - Didier Galmiche; Timo Lang; David J. Pym (CoRR, 2024)

Cut-free labelled calculi and decidability for intuitionistic sentential logic with identity. - Didier Galmiche; Brandon Hornbeck; Daniel Méry (J. Log. Comput., 2025)