Christopher Lynch

Available identifiers

zbMath Open lynch.christopher-aMaRDI QIDQ437036

List of research outcomes

Publication	Date of Publication	Type
PATCH graphs: an efficient data structure for completion of finitely presented groups	2024-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q6191017	2024-02-08	Paper
An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems	2023-06-23	Paper
Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems	2022-03-24	Paper
Equational theorem proving modulo	2021-12-01	Paper
Reviving basic narrowing modulo	2020-05-13	Paper
On asymmetric unification for the theory of XOR with a homomorphism	2020-05-13	Paper
Efficient general AGH-unification	2014-10-20	Paper
Encoding first order proofs in SMT	2013-12-06	Paper
On the relative soundness of the free algebra model for public key encryption	2013-09-25	Paper
On Forward Closure and the Finite Variant Property	2013-09-20	Paper
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis	2013-06-14	Paper
Unification Modulo Synchronous Distributivity	2012-09-05	Paper
On deciding satisfiability by theorem proving with speculative inferences	2012-07-31	Paper
Unification modulo homomorphic encryption	2012-07-17	Paper
Efficient General Unification for XOR with Homomorphism	2011-07-29	Paper
Unification modulo homomorphic encryption	2010-01-07	Paper
Combining instance generation and resolution	2010-01-07	Paper
On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving	2009-07-28	Paper
Encoding First Order Proofs in SAT	2009-03-06	Paper
Protocol Verification Via Rigid/Flexible Resolution	2008-05-15	Paper
Information and Communications Security	2005-08-19	Paper

Research outcomes over time

This page was built for person: Christopher Lynch