Dominique Larchey-Wendling
Dominique Larchey-Wendling
Researcher, LORIA, CNRS
Verified email at - Homepage
Cited by
Cited by
Expressivity Properties of Boolean BI Through Relational Models
D Galmiche, D Larchey-Wendling
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006
The undecidability of boolean BI through phase semantics
D Larchey-Wendling, D Galmiche
2010 25th Annual IEEE Symposium on Logic in Computer Science, 140-149, 2010
Exploring the relation between intuitionistic BI and Boolean BI: An unexpected embedding
D Larchey-Wendling, D Galmiche
Mathematical Structures in Computer Science 19 (3), 435-500, 2009
Hilbert's Tenth Problem in Coq (Extended Version)
D Larchey-Wendling, Y Forster
arXiv preprint arXiv:2003.04604, 2020
A Coq library of undecidable problems
Y Forster, D Larchey-Wendling, A Dudenhefner, E Heiter, D Kirst, F Kunze, ...
CoqPL 2020 The Sixth International Workshop on Coq for Programming Languages, 2020
Separation logic with one quantified variable
S Demri, D Galmiche, D Larchey-Wendling, D Méry
Theory of Computing Systems 61 (2), 371-461, 2017
The formal strong completeness of partial monoidal Boolean BI
D Larchey-Wendling
Journal of Logic and Computation 26 (2), 605-640, 2016
Certified undecidability of intuitionistic linear logic via binary stack machines and Minsky machines
Y Forster, D Larchey-Wendling
Proceedings of the 8th ACM SIGPLAN International Conference on Certified …, 2019
Nondeterministic phase semantics and the undecidability of Boolean BI
D Larchey-Wendling, D Galmiche
ACM Transactions on Computational Logic (TOCL) 14 (1), 1-41, 2013
STRIP: Structural sharing for efficient proof-search
D Larchey-Wendling, D Méry, D Galmiche
IJCAR 2083, 696-700, 2001
Trakhtenbrot’s theorem in coq: a constructive approach to finite model theory
D Kirst, D Larchey-Wendling
Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris …, 2020
Counter-Model Search in Gödel-Dummett Logics.
D Larchey-Wendling
IJCAR 3097, 274-288, 2004
Combining proof-search and counter-model construction for deciding Gödel-Dummett logic
D Larchey-Wendling
Automated Deduction—CADE-18: 18th International Conference on Automated …, 2002
Structural sharing and efficient proof-search in propositional intuitionistic logic
D Galmiche, D Larchey-Wendling
Advances in Computing Science—ASIAN’99: 5th Asian Computing Science …, 1999
Graph-based decision for Gödel-Dummett logics
D Larchey-Wendling
Journal of Automated Reasoning 38 (1-3), 201-225, 2007
High intensity ion beams prospects for accelerators with Phoenix 28 GHz
T Thuillier, JL Bouly, JC Curdy, E Froidefond, T Lamy, C Peaucelle, ...
EPAC 2002 European Particle Accelerator Conference 8, 1744-1746, 2002
Typing total recursive functions in Coq
D Larchey-Wendling
Interactive Theorem Proving: 8th International Conference, ITP 2017 …, 2017
Looking at separation algebras with Boolean BI-eyes
D Larchey-Wendling, D Galmiche
Theoretical Computer Science: 8th IFIP TC 1/WG 2.2 International Conference …, 2014
Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets
D Larchey-Wendling, D Galmiche
Electronic Notes in Theoretical Computer Science 17, 1-18, 1998
Simulating induction-recursion for partial algorithms
D Larchey-Wendling, JF Monin
24th International Conference on Types for Proofs and Programs, TYPES 2018, 2018
The system can't perform the operation now. Try again later.
Articles 1–20