Christopher Lynch

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
PATCH graphs: an efficient data structure for completion of finitely presented groups	2024-06-21	Paper
CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms (available as arXiv preprint)	2024-02-08	Paper
CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms	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 (available as arXiv preprint)	2020-05-13	Paper
Efficient general AGH-unification Information and Computation	2014-10-20	Paper
Encoding first order proofs in SMT Electronic Notes in Theoretical Computer Science	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 Frontiers of Combining Systems	2013-09-20	Paper
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis Automated Deduction – CADE-24	2013-06-14	Paper
Unification modulo synchronous distributivity Automated Reasoning	2012-09-05	Paper
On deciding satisfiability by theorem proving with speculative inferences Journal of Automated Reasoning	2012-07-31	Paper
Unification modulo homomorphic encryption Journal of Automated Reasoning	2012-07-17	Paper
Efficient general unification for XOR with homomorphism Lecture Notes in Computer Science	2011-07-29	Paper
Unification modulo homomorphic encryption Frontiers of Combining Systems	2010-01-07	Paper
Combining instance generation and resolution Frontiers of Combining Systems	2010-01-07	Paper
On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving Automated Deduction – CADE-22	2009-07-28	Paper
Encoding First Order Proofs in SAT Automated Deduction – CADE-21	2009-03-06	Paper
Protocol Verification Via Rigid/Flexible Resolution Logic for Programming, Artificial Intelligence, and Reasoning	2008-05-15	Paper
Information and Communications Security Lecture Notes in Computer Science	2005-08-19	Paper

Research outcomes over time

This page was built for person: Christopher Lynch