Guillaume Burel

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 7

Top Venues

CoRR

PxTP@CADE

FroCos

FMTea

Henri Poincaré University, Nancy, France (PHD)

Education History

Henri Poincaré University, Nancy, France

PHD

Publications

Ali Assaf, Guillaume Burel, Raphaël Cauderlier, David Delahaye, Gilles Dowek, Catherine Dubois, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant, Ronan Saillard
Dedukti: a Logical Framework based on the λΠ-Calculus Modulo Theory. CoRR (2023)
Guillaume Burel, Gilles Dowek
How can we prove that a proof search method is not an instance of another? CoRR (2023)
Guillaume Burel, Guillaume Bury, Raphaël Cauderlier, David Delahaye, Pierre Halmagrand, Olivier Hermant
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice. J. Autom. Reason. 64 (6) (2020)
Guillaume Burel
Linking Focusing and Resolution with Selection. ACM Trans. Comput. Log. 21 (3) (2020)
Catherine Dubois, Virgile Prevosto, Guillaume Burel
Teaching Formal Methods to Future Engineers. FMTea (2019)
Mohamed Yacine El Haddad, Guillaume Burel, Frédéric Blanqui
EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract). PxTP (2019)
Guillaume Burel
Linking Focusing and Resolution with Selection. MFCS (2018)
Guillaume Burel, Gilles Dowek, Ying Jiang
A Completion Method to Decide Reachability in Rewrite Systems. FroCos (2015)
Ali Assaf, Guillaume Burel
Translating HOL to Dedukti. PxTP@CADE (2015)
Guillaume Burel
Cut Admissibility by Saturation. RTA-TLCA (2014)
Guillaume Burel, Simon Cruanes
Detection of First Order Axiomatic Theories. FroCos (2013)
Guillaume Burel
A Shallow Embedding of Resolution and Superposition Proofs into the λΠ-Calculus Modulo. PxTP@CADE (2013)
Mathieu Boespflug, Guillaume Burel
CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo. PxTP (2012)
Guillaume Burel
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo Log. Methods Comput. Sci. 7 (1) (2011)
Guillaume Burel
Experimenting with Deduction Modulo. CADE (2011)
Guillaume Burel, Claude Kirchner
Regaining cut admissibility in deduction modulo using abstract completion. Inf. Comput. 208 (2) (2010)
Guillaume Burel
Embedding Deduction Modulo into a Prover. CSL (2010)
Guillaume Burel, Gilles Dowek
How can we prove that a proof search method is not an instance of another? LFMTP (2009)
Guillaume Burel
Automating Theories in Intuitionistic Logic. FroCoS (2009)
Guillaume Burel
A First-Order Representation of Pure Type Systems Using Superdeduction. LICS (2008)
Guillaume Burel, Claude Kirchner
Cut Elimination in Deduction Modulo by Abstract Completion. LFCS (2007)
Guillaume Burel
Unbounded Proof-Length Speed-Up in Deduction Modulo. CSL (2007)
Guillaume Burel, Claude Kirchner
Completion Is an Instance of Abstract Canonical System Inference. Essays Dedicated to Joseph A. Goguen (2006)

Guillaume Burel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guillaume Burel