( en | de | ru )

 

Disambiguation of "Graham-Lengrand, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
Tight typings and split bounds, fully developed.

, , and . J. Funct. Program., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stéphane Müller

Stéphane Haussler

Stéphane Klein

Stéphane Aubry

Stéphane Audière

 

Other publications of authors with the same name

Polarities & Focussing: a journey from Realisability to Automated Reasoning.. CoRR, (2014)QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment., , and . CADE, volume 14132 of Lecture Notes in Computer Science, page 78-95. Springer, (2023)Special Issue on Computational Logic in Honour of Roy Dyckhoff., and . J. Log. Comput., 26 (2): 463-465 (2016)Proofs in conflict-driven theory combination., , and . CPP, page 186-200. ACM, (2018)Solving Bitvectors with MCSAT: Explanations from Bits and Pieces., , and . IJCAR (1), volume 12166 of Lecture Notes in Computer Science, page 103-121. Springer, (2020)Psyche: A Proof-Search Engine Based on Sequent Calculus with an LCF-Style Architecture.. TABLEAUX, volume 8123 of Lecture Notes in Computer Science, page 149-156. Springer, (2013)Realisability semantics of abstract focussing, formalised.. WoF'15, volume 197 of EPTCS, page 15-28. (2015)MCSat-based Finite Field Reasoning in the Yices2 SMT Solver., , , , and . CoRR, (2024)Machine-checked ZKP for NP-relations: Formally Verified Security Proofs and Implementations of MPC-in-the-Head., , , , , and . CoRR, (2021)Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs., , and . J. Autom. Reason., 66 (1): 43-91 (2022)