Didier Galmiche

Didier Galmiche, Daniel Méry: A Connection-based Characterization of Bi-intuitionistic Validity. J. Autom. Reasoning 51(1): 3-26 (2013)

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

J. R. Courtault, Didier Galmiche: A Modal BI Logic for Dynamic Resource Properties. LFCS 2013: 134-148

Didier Galmiche, Yakoub Salhi: Sequent calculi and decidability for intuitionistic hybrid logic. Inf. Comput. 209(12): 1447-1463 (2011)

Didier Galmiche, Daniel Méry: A Connection-Based Characterization of Bi-intuitionistic Validity. CADE 2011: 268-282

Didier Galmiche, Yakoub Salhi: Label-free natural deduction systems for intuitionistic and classical modal logics. Journal of Applied Non-Classical Logics 20(4): 373-421 (2010)

Didier Galmiche, Yakoub Salhi: A family of Gödel hybrid logics. J. Applied Logic 8(4): 371-385 (2010)

Didier Galmiche, Daniel Méry: Tableaux and Resource Graphs for Separation Logic. J. Log. Comput. 20(1): 189-231 (2010)

Dominique Larchey-Wendling, Didier Galmiche: The Undecidability of Boolean BI through Phase Semantics. LICS 2010: 140-149

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

Dominique Larchey-Wendling, Didier Galmiche: Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. Mathematical Structures in Computer Science 19(3): 435-500 (2009)

Didier Galmiche, Yakoub Salhi: Labelled Calculi for Lukasiewicz Logics. WoLLIC 2008: 194-207

Nicolas Biri, Didier Galmiche: Models and Separation Logics for Resource Trees. J. Log. Comput. 17(4): 687-726 (2007)

Didier Galmiche, Dominique Larchey-Wendling: Expressivity Properties of Boolean. FSTTCS 2006: 357-368

Didier Galmiche, Daniel Méry: Resource Graphs and Countermodels in Resource Logics. Electr. Notes Theor. Comput. Sci. 125(3): 117-135 (2005)

Didier Galmiche, Daniel Méry, David J. Pym: The semantics of BI and resource tableaux. Mathematical Structures in Computer Science 15(6): 1033-1088 (2005)

Didier Galmiche, Daniel Méry: Characterizing Provability in . LPAR 2005: 459-473

Didier Galmiche, Daniel Méry: Semantic Labelled Tableaux for Propositional BI. J. Log. Comput. 13(5): 707-753 (2003)

Nicolas Biri, Didier Galmiche: A Separation Logic for Resource Distribution: Extended Abstract. FSTTCS 2003: 23-37

Didier Galmiche, J.-M. Notin: Connection-Based Proof Construction in Non-commutative Logic. LPAR 2003: 422-436

Didier Galmiche, Daniel Méry: Connection-Based Proof Search in Propositional BI Logic. CADE 2002: 111-128

Didier Galmiche, Daniel Méry, David J. Pym: Resource Tableaux. CSL 2002: 183-199

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

Dominique Larchey-Wendling, Dominique Méry, Didier Galmiche: STRIP: Structural Sharing for Efficient Proof-Search. IJCAR 2001: 696-700

Didier Galmiche, Daniel Méry: Proof-Search and Countermodel Generation in Propositional BI Logic. TACS 2001: 263-282

Dominique Larchey-Wendling, Didier Galmiche: Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. Electr. Notes Theor. Comput. Sci. 35: 94-108 (2000)

Didier Galmiche: Preface. Electr. Notes Theor. Comput. Sci. 37: 1-2 (2000)

Didier Galmiche, J.-M. Notin: Proof-search and proof nets in Mixed Linear Logic. Electr. Notes Theor. Comput. Sci. 37: 1-33 (2000)

Didier Galmiche, David J. Pym: Proof-search in type-theoretic languages: an introduction. Theor. Comput. Sci. 232(1-2): 5-53 (2000)

Didier Galmiche: Connection methods in linear logic and proof nets construction. Theor. Comput. Sci. 232(1-2): 231-272 (2000)

Didier Galmiche: Workshop: Type-Theoretic Languages: Proof-Search and Semantics. CADE 2000: 515

Jean Paul Bahsoun, José Luiz Fiadeiro, Didier Galmiche: Foreword. Mathematical Structures in Computer Science 9(3): 225-226 (1999)

Giorgio Delzanno, Didier Galmiche, Maurizio Martelli: A specification logic for concurrent object-oriented programming. Mathematical Structures in Computer Science 9(3): 253-286 (1999)

Didier Galmiche, Dominique Larchey-Wendling: Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. ASIAN 1999: 101-112

Didier Galmiche: Preface. Electr. Notes Theor. Comput. Sci. 17: 1-2 (1998)

Didier Galmiche, Bruno Martin: Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic. Electr. Notes Theor. Comput. Sci. 17: 1-20 (1998)

Dominique Larchey-Wendling, Didier Galmiche: Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. Electr. Notes Theor. Comput. Sci. 17: 1-18 (1998)

Didier Galmiche (Ed.): Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX '97, Pont-à-Mousson, France, May 13-16, 1997, Proceedings. Lecture Notes in Computer Science 1227, Springer 1997, isbn 3-540-62920-3

Didier Galmiche, Eric Boudinet: Proofs, Concurrent Objects, and Computations in a FILL Framework. OBPDC 1995: 148-167

Didier Galmiche, Guy Perrier: On Proof Normalization in Linear Logic. Theor. Comput. Sci. 135(1): 67-110 (1994)

Didier Galmiche, Guy Perrier: Foundations of Proof Search Strategies Design in Linear Logic. LFCS 1994: 101-113

Didier Galmiche, O. Hermann: SKIL: A System for Programming with Proofs. LPAR 1993: 348-350

Didier Galmiche: Program Development in Constructive Type Theory. Theor. Comput. Sci. 94(2): 237-259 (1992)

Didier Galmiche, Guy Perrier: Automated Deduction in Additive and Multiplicative Linear Logic. LFCS 1992: 151-162

Didier Galmiche, Guy Perrier: A Procedure for Automatic Proof Nets Construction. LPAR 1992: 42-53

Didier Galmiche: Constructive System for Automatic Program Synthesis. Theor. Comput. Sci. 71(2): 227-239 (1990)