Dominique Larchey-Wendling

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 18

Top Topics

Universally Quantified

Top Venues

Log. Methods Comput. Sci.

Publications

Dominique Larchey-Wendling, Jean-François Monin
Proof Pearl: Faithful Computation and Extraction of μ-Recursive Algorithms in Coq. ITP (2023)
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 (2023)
Dominik Kirst, Dominique Larchey-Wendling
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens. Log. Methods Comput. Sci. 18 (2) (2022)
Dominique Larchey-Wendling, Yannick Forster
Hilbert's Tenth Problem in Coq (Extended Version). Log. Methods Comput. Sci. 18 (1) (2022)
Dominik Kirst, Dominique Larchey-Wendling
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens. CoRR (2021)
Dominique Larchey-Wendling
Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq. FSCD (2021)
Dominique Larchey-Wendling
Constructive Decision via Redundancy-Free Proof-Search. J. Autom. Reason. 64 (7) (2020)
Dominik Kirst, Dominique Larchey-Wendling
Trakhtenbrot's Theorem in Coq - A Constructive Approach to Finite Model Theory. IJCAR (2) (2020)
Dominique Larchey-Wendling, Yannick Forster
Hilbert's Tenth Problem in Coq. CoRR (2020)
Dominik Kirst, Dominique Larchey-Wendling
Trakhtenbrot's Theorem in Coq, A Constructive Approach to Finite Model Theory. CoRR (2020)
Yannick Forster, Dominique Larchey-Wendling
Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines. CPP (2019)
Dominique Larchey-Wendling, Ralph Matthes
Certification of Breadth-First Algorithms by Extraction. MPC (2019)
Dominique Larchey-Wendling, Yannick Forster
Hilbert's Tenth Problem in Coq. FSCD (2019)
Dominique Larchey-Wendling
Constructive Decision via Redundancy-Free Proof-Search. IJCAR (2018)
Dominique Larchey-Wendling
Proof Pearl: Constructive Extraction of Cycle Finding Algorithms. ITP (2018)
Dominique Larchey-Wendling
Typing Total Recursive Functions in Coq. ITP (2017)
Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
Separation Logic with One Quantified Variable. Theory Comput. Syst. 61 (2) (2017)
Dominique Larchey-Wendling
The formal strong completeness of partial monoidal Boolean BI. J. Log. Comput. 26 (2) (2016)
Dominique Larchey-Wendling, Didier Galmiche
Looking at Separation Algebras with Boolean BI-eyes. IFIP TCS (2014)
Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
Separation Logic with One Quantified Variable. CSR (2014)
Dominique Larchey-Wendling, Didier Galmiche
Nondeterministic Phase Semantics and the Undecidability of Boolean BI. ACM Trans. Comput. Log. 14 (1) (2013)
Dominique Larchey-Wendling, Didier Galmiche
The Undecidability of Boolean BI through Phase Semantics. LICS (2010)
Dominique Larchey-Wendling
An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics. MFPS (2010)
Dominique Larchey-Wendling, Didier Galmiche
Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. Math. Struct. Comput. Sci. 19 (3) (2009)
Dominique Larchey-Wendling
Graph-based Decision for Gödel-Dummett Logics. J. Autom. Reason. 38 (1-3) (2007)
Didier Galmiche, Dominique Larchey-Wendling
Expressivity Properties of Boolean. FSTTCS (2006)
Dominique Larchey-Wendling
Bounding Resource Consumption with Gödel-Dummett Logics. LPAR (2005)
Dominique Larchey-Wendling
Gödel-Dummett Counter-models through Matrix Computation. Electron. Notes Theor. Comput. Sci. 125 (3) (2005)
Dominique Larchey-Wendling
Counter-Model Search in Gödel-Dummett Logics. IJCAR (2004)
Dominique Larchey-Wendling
Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic. CADE (2002)
Dominique Larchey-Wendling, Dominique Méry, Didier Galmiche
STRIP: Structural Sharing for Efficient Proof-Search. IJCAR (2001)
Dominique Larchey-Wendling, Didier Galmiche
Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. Electron. Notes Theor. Comput. Sci. 35 (2000)
Didier Galmiche, Dominique Larchey-Wendling
Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. ASIAN (1999)
Dominique Larchey-Wendling, Didier Galmiche
Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. Electron. Notes Theor. Comput. Sci. 17 (1998)