default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDidier Galmiche
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Didier Galmiche, Timo Lang, David J. Pym:
Minimalistic System Modelling: Behaviours, Interfaces, and Local Reasoning. CoRR abs/2401.16109 (2024)- 2023
- [j28]Hans van Ditmarsch
, Didier Galmiche, Marta Gawek:
An Epistemic Separation Logic with Action Models. J. Log. Lang. Inf. 32(1): 89-116 (2023) - [c39]Didier Galmiche, Daniel Méry:
Labelled Tableaux for Linear Time Bunched Implication Logic. FSCD 2023: 31:1-31:17 - [c38]Hans van Ditmarsch, Didier Galmiche, Marta Gawek:
A Separation Logic with Histories of Epistemic Actions as Resources. WoLLIC 2023: 161-177 - [i2]Tim S. Lyon, Agata Ciabattoni, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry, Nicola Olivetti, Revantha Ramanayake:
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations. CoRR abs/2312.03426 (2023) - 2021
- [j27]Didier Galmiche, Daniel Méry:
Labelled cyclic proofs for separation logic. J. Log. Comput. 31(3): 892-922 (2021) - [c37]Didier Galmiche, Marta Gawek, Daniel Méry:
Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with Identity. FSCD 2021: 13:1-13:21 - 2020
- [j26]Didier Galmiche, Stephan Schulz, Roberto Sebastiani:
Preface: Special Issue of Selected Extended Papers from IJCAR 2018. J. Autom. Reason. 64(7): 1165-1167 (2020)
2010 – 2019
- 2019
- [j25]Didier Galmiche, Pierre Kimmel, David J. Pym:
A substructural epistemic resource logic: theory and modelling applications. J. Log. Comput. 29(8): 1251-1287 (2019) - [j24]Jean-René Courtault, Hans van Ditmarsch, Didier Galmiche:
A public announcement separation logic. Math. Struct. Comput. Sci. 29(6): 828-871 (2019) - [c36]Didier Galmiche, Michel Marti, Daniel Méry:
Relating Labelled and Label-Free Bunched Calculi in BI Logic. TABLEAUX 2019: 130-146 - [i1]Didier Galmiche, Pierre Kimmel, David J. Pym:
A Substructural Epistemic Resource Logic: Theory and Modelling Applications. CoRR abs/1909.07296 (2019) - 2018
- [j23]Didier Galmiche, David J. Pym:
Preface. J. Log. Comput. 28(4): 629-630 (2018) - [j22]Jean-René Courtault, Didier Galmiche:
A modal separation logic for resource dynamics. J. Log. Comput. 28(4): 733-778 (2018) - [j21]Didier Galmiche, Yakoub Salhi:
Tree-sequent calculi and decision procedures for intuitionistic modal logics. J. Log. Comput. 28(5): 967-989 (2018) - [c35]Didier Galmiche, Daniel Méry:
Labelled Connection-based Proof Search for Multiplicative Intuitionistic. ARQNL@IJCAR 2018: 49-63 - [e5]Didier Galmiche, Stephan Schulz, Roberto Sebastiani:
Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings. Lecture Notes in Computer Science 10900, Springer 2018, ISBN 978-3-319-94204-9 [contents] - 2017
- [j20]Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry:
Separation Logic with One Quantified Variable. Theory Comput. Syst. 61(2): 371-461 (2017) - [c34]Didier Galmiche, Pierre Kimmel, David J. Pym:
A Substructural Epistemic Resource Logic. ICLA 2017: 106-122 - 2016
- [j19]Didier Galmiche, Stéphane Graham-Lengrand:
Special Issue on Computational Logic in Honour of Roy Dyckhoff. J. Log. Comput. 26(2): 463-465 (2016) - [j18]Jean-René Courtault, Didier Galmiche, David J. Pym:
A logic of separating modalities. Theor. Comput. Sci. 637: 30-58 (2016) - [c33]Philippe Balbiani, Didier Galmiche:
About intuitionistic public announcement logic. Advances in Modal Logic 2016: 97-116 - 2015
- [c32]Jean-René Courtault, Hans van Ditmarsch, Didier Galmiche:
An Epistemic Separation Logic. WoLLIC 2015: 156-173 - 2014
- [c31]Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry:
Separation Logic with One Quantified Variable. CSR 2014: 125-138 - [c30]Dominique Larchey-Wendling, Didier Galmiche:
Looking at Separation Algebras with Boolean BI-eyes. IFIP TCS 2014: 326-340 - 2013
- [j17]Didier Galmiche, Daniel Méry:
A Connection-based Characterization of Bi-intuitionistic Validity. J. Autom. Reason. 51(1): 3-26 (2013) - [j16]Dominique Larchey-Wendling, Didier Galmiche:
Nondeterministic Phase Semantics and the Undecidability of Boolean BI. ACM Trans. Comput. Log. 14(1): 6:1-6:41 (2013) - [c29]Jean-René Courtault, Didier Galmiche:
A Modal BI Logic for Dynamic Resource Properties. LFCS 2013: 134-148 - [e4]Didier Galmiche, Dominique Larchey-Wendling:
Automated Reasoning with Analytic Tableaux and Related Methods - 22th International Conference, TABLEAUX 2013, Nancy, France, September 16-19, 2013. Proceedings. Lecture Notes in Computer Science 8123, Springer 2013, ISBN 978-3-642-40536-5 [contents] - 2011
- [j15]Didier Galmiche, Yakoub Salhi:
Sequent calculi and decidability for intuitionistic hybrid logic. Inf. Comput. 209(12): 1447-1463 (2011) - [c28]Didier Galmiche, Daniel Méry:
A Connection-Based Characterization of Bi-intuitionistic Validity. CADE 2011: 268-282 - 2010
- [j14]Didier Galmiche, Yakoub Salhi:
Label-free natural deduction systems for intuitionistic and classical modal logics. J. Appl. Non Class. Logics 20(4): 373-421 (2010) - [j13]Didier Galmiche, Yakoub Salhi:
A family of Gödel hybrid logics. J. Appl. Log. 8(4): 371-385 (2010) - [j12]Didier Galmiche, Daniel Méry:
Tableaux and Resource Graphs for Separation Logic. J. Log. Comput. 20(1): 189-231 (2010) - [c27]Dominique Larchey-Wendling, Didier Galmiche:
The Undecidability of Boolean BI through Phase Semantics. LICS 2010: 140-149 - [c26]Didier Galmiche, Yakoub Salhi:
Label-Free Proof Systems for Intuitionistic Modal Logic IS5. LPAR (Dakar) 2010: 255-271
2000 – 2009
- 2009
- [j11]Dominique Larchey-Wendling, Didier Galmiche:
Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. Math. Struct. Comput. Sci. 19(3): 435-500 (2009) - 2008
- [c25]Didier Galmiche, Yakoub Salhi:
Labelled Calculi for Lukasiewicz Logics. WoLLIC 2008: 194-207 - 2007
- [j10]Nicolas Biri, Didier Galmiche:
Models and Separation Logics for Resource Trees. J. Log. Comput. 17(4): 687-726 (2007) - 2006
- [c24]Didier Galmiche, Dominique Larchey-Wendling:
Expressivity Properties of Boolean. FSTTCS 2006: 357-368 - 2005
- [j9]Didier Galmiche, Daniel Méry, David J. Pym:
The semantics of BI and resource tableaux. Math. Struct. Comput. Sci. 15(6): 1033-1088 (2005) - [c23]Didier Galmiche, Daniel Méry:
Characterizing Provability in . LPAR 2005: 459-473 - 2004
- [c22]Didier Galmiche, Daniel Méry:
Resource Graphs and Countermodels in Resource Logics. D/PDPAR@IJCAR 2004: 117-135 - 2003
- [j8]Didier Galmiche, Daniel Méry:
Semantic Labelled Tableaux for Propositional BI. J. Log. Comput. 13(5): 707-753 (2003) - [c21]Nicolas Biri, Didier Galmiche:
A Separation Logic for Resource Distribution: Extended Abstract. FSTTCS 2003: 23-37 - [c20]Didier Galmiche, J.-M. Notin:
Connection-Based Proof Construction in Non-commutative Logic. LPAR 2003: 422-436 - 2002
- [c19]Didier Galmiche, Daniel Méry:
Connection-Based Proof Search in Propositional BI Logic. CADE 2002: 111-128 - [c18]Didier Galmiche, Daniel Méry, David J. Pym:
Resource Tableaux. CSL 2002: 183-199 - [c17]L. Habert, J.-M. Notin, Didier Galmiche:
LINK: A Proof Environment Based on Proof Nets. TABLEAUX 2002: 330-334 - 2001
- [c16]Dominique Larchey-Wendling, Daniel Méry, Didier Galmiche:
STRIP: Structural Sharing for Efficient Proof-Search. IJCAR 2001: 696-700 - [c15]Didier Galmiche, Daniel Méry:
Proof-Search and Countermodel Generation in Propositional BI Logic. TACS 2001: 263-282 - 2000
- [j7]Didier Galmiche, David J. Pym:
Proof-search in type-theoretic languages: an introduction. Theor. Comput. Sci. 232(1-2): 5-53 (2000) - [j6]Didier Galmiche:
Connection methods in linear logic and proof nets construction. Theor. Comput. Sci. 232(1-2): 231-272 (2000) - [c14]Didier Galmiche:
Workshop: Type-Theoretic Languages: Proof-Search and Semantics. CADE 2000: 515 - [c13]Didier Galmiche:
Preface. Workshop on Type-Theoretic Languages: Proof Search and Semantics 2000: 1-2 - [c12]Didier Galmiche, J.-M. Notin:
Proof-search and proof nets in Mixed Linear Logic. Workshop on Type-Theoretic Languages: Proof Search and Semantics 2000: 1-33 - [e3]Didier Galmiche:
Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics 2000, held in conjunction with CADE-17 Conference, Pittsburgh, PA, USA, June 20-21, 2000. Electronic Notes in Theoretical Computer Science 37, Elsevier 2000 [contents]
1990 – 1999
- 1999
- [j5]Jean Paul Bahsoun, José Luiz Fiadeiro, Didier Galmiche:
Foreword. Math. Struct. Comput. Sci. 9(3): 225-226 (1999) - [j4]Giorgio Delzanno, Didier Galmiche, Maurizio Martelli:
A specification logic for concurrent object-oriented programming. Math. Struct. Comput. Sci. 9(3): 253-286 (1999) - [c11]Didier Galmiche, Dominique Larchey-Wendling:
Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. ASIAN 1999: 101-112 - 1998
- [c10]Didier Galmiche:
Preface. Proof Search in Type-Theoretic Languages@CADE 1998: 1-2 - [c9]Didier Galmiche, Bruno Martin:
Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic. Proof Search in Type-Theoretic Languages@CADE 1998: 1-20 - [c8]Dominique Larchey-Wendling, Didier Galmiche:
Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. Proof Search in Type-Theoretic Languages@CADE 1998: 1-18 - [c7]Dominique Larchey-Wendling, Didier Galmiche:
Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. Workshop on Domains 1998: 94-108 - [e2]Didier Galmiche:
Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998. Electronic Notes in Theoretical Computer Science 17, Elsevier 1998 [contents] - 1997
- [e1]Didier Galmiche:
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 [contents] - 1995
- [c6]Didier Galmiche, Eric Boudinet:
Proofs, Concurrent Objects, and Computations in a FILL Framework. OBPDC 1995: 148-167 - 1994
- [j3]Didier Galmiche, Guy Perrier:
On Proof Normalization in Linear Logic. Theor. Comput. Sci. 135(1): 67-110 (1994) - [c5]Didier Galmiche:
Canonical Proofs for Linear Logic Programming Frameworks. ICLP Workshop: Proof-Theoretical Extensions on Logic Programming 1994 - [c4]Didier Galmiche, Guy Perrier:
Foundations of Proof Search Strategies Design in Linear Logic. LFCS 1994: 101-113 - 1993
- [c3]Didier Galmiche, O. Hermann:
SKIL: A System for Programming with Proofs. LPAR 1993: 348-350 - 1992
- [j2]Didier Galmiche:
Program Development in Constructive Type Theory. Theor. Comput. Sci. 94(2): 237-259 (1992) - [c2]Didier Galmiche, Guy Perrier:
Automated Deduction in Additive and Multiplicative Linear Logic. LFCS 1992: 151-162 - [c1]Didier Galmiche, Guy Perrier:
A Procedure for Automatic Proof Nets Construction. LPAR 1992: 42-53 - 1990
- [j1]Didier Galmiche:
Constructive System for Automatic Program Synthesis. Theor. Comput. Sci. 71(2): 227-239 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
