Christopher Lynch

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 16

Top Topics

Cryptographic Algorithms

Equational Theories

Top Venues

Publications

Christopher Lynch, Stephen Miner
Complete Trigger Selection in Satisfiability Modulo First-Order Theories. SMT (2023)
Christopher Lynch, Stephen Miner
Complete Trigger Selection in Satisfiability modulo first-order Theories. CoRR (2023)
Hai Lin, Christopher Lynch
Local XOR Unification: Definitions, Algorithms and Application to Cryptography. ICTAC (2022)
Dalton Chichester, Wei Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Luis Rovira, Brandon Rozek
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms. GandALF (2022)
Dohan Kim, Christopher Lynch
Congruence Closure Modulo Permutation Equations. SCSS (2021)
Dohan Kim, Christopher Lynch
An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems. FSCD (2021)
Dohan Kim, Christopher Lynch
Equational Theorem Proving Modulo. CADE (2021)
Hai Lin, Christopher Lynch
Formal Analysis of Symbolic Authenticity. FroCoS (2021)
Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek
Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems. FroCoS (2021)
Hai Lin, Christopher Lynch
Local XOR Unification: Definitions, Algorithms and Application to Cryptography. IACR Cryptol. ePrint Arch. 2020 (2020)
Ajay Kumar Eeralla, Christopher Lynch
Bounded ACh unification. Math. Struct. Comput. Sci. 30 (6) (2020)
Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar
On Asymmetric Unification for the Theory of XOR with a Homomorphism. FroCos (2019)
Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar
On Asymmetric Unification for the Theory of XOR with a Homomorphism. CoRR (2019)
Dohan Kim, Christopher Lynch, Paliath Narendran
Reviving Basic Narrowing Modulo. FroCos (2019)
Erin Hanna, Christopher Lynch, David Jaz Myers, Corey Richardson
Finding Intruder Knowledge with Cap-Matching. Foundations of Security, Protocols, and Equational Reasoning (2019)
Ajay Kumar Eeralla, Christopher Lynch
Bounded ACh Unification. CoRR (2018)
Zhiqiang Liu, Christopher Lynch
Efficient general AGH-unification. Inf. Comput. 238 (2014)
Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, Paliath Narendran
On Forward Closure and the Finite Variant Property. FroCos (2013)
Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine A. Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. CADE (2013)
Christopher Lynch, Quang-Trung Ta, Duc-Khanh Tran
SMELS: Satisfiability Modulo Equality with Lazy Superposition. J. Autom. Reason. 51 (3) (2013)
Christopher Lynch
Constructing Bachmair-Ganzinger Models. Programming Logics (2013)
Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Synchronous Distributivity. IJCAR (2012)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Homomorphic Encryption. J. Autom. Reason. 48 (2) (2012)
Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine A. Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse
Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. ESORICS (2012)
Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura
On Deciding Satisfiability by Theorem Proving with Speculative Inferences. J. Autom. Reason. 47 (2) (2011)
Zhiqiang Liu, Christopher Lynch
Efficient General Unification for XOR with Homomorphism. CADE (2011)
Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine A. Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. PPDP (2011)
Christopher Lynch
Invited talk: Unification in Cryptographic Protocol Analysis. UNIF (2011)
Christopher Lynch, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran
Automatic decidability and combinability. Inf. Comput. 209 (7) (2011)
Serdar Erbatur, Christopher Lynch, Paliath Narendran
Unification in a Theory of Blind Signatures. TABLEAUX (Workshops, Tutorials, and Short Papers) (2011)
Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. UNIF (2011)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Cap unification: application to protocol security modulo homomorphic encryption. AsiaCCS (2010)
Christopher Lynch
Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List). RTA (2010)
Christopher Lynch
Preface. RTA (2010)
Christopher Lynch, Ralph Eric McGregor
Combining Instance Generation and Resolution. FroCoS (2009)
Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura
) and Unsound Theorem Proving. CADE (2009)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification Modulo Homomorphic Encryption. FroCoS (2009)
Christopher Lynch, Yuefeng Tang
Rewriting Interpolants. Electron. Notes Theor. Comput. Sci. 212 (2008)
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch
Unification modulo Homomorphic Encryption is Decidable. UNIF (2008)
Christopher Lynch, Duc-Khanh Tran
SMELS: Satisfiability Modulo Equality with Lazy Superposition. ATVA (2008)
Jeremy Bongio, Cyrus Katrak, Hai Lin, Christopher Lynch, Ralph Eric McGregor
Encoding First Order Proofs in SMT. Electron. Notes Theor. Comput. Sci. 198 (2) (2008)
Christopher Lynch, Yuefeng Tang
Interpolants for Linear Arithmetic in SMT. ATVA (2008)
Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin, Christopher Lynch, Ralph Eric McGregor
Encoding First Order Proofs in SAT. CADE (2007)
Christopher Lynch, Duc-Khanh Tran
Automatic Decidability and Combinability Revisited. CADE (2007)
Stéphanie Delaune, Hai Lin, Christopher Lynch
Protocol Verification Via Rigid/Flexible Resolution. LPAR (2007)
Christopher Lynch, Hani Hagras, Victor Callaghan
Parallel Type-2 Fuzzy Logic Co-Processors for Engine Management. FUZZ-IEEE (2007)
Christopher Lynch, Hani Hagras, Victor Callaghan
Using Uncertainty Bounds in the Design of an Embedded Real-Time Type-2 Neuro-Fuzzy Speed Controller for Marine Diesel Engines. FUZZ-IEEE (2006)
Christopher Lynch, Hani Hagras, Victor Callaghan
Embedded Type-2 FLC for Real-Time Speed Control of Marine and Traction Diesel Engines. FUZZ-IEEE (2005)
Christopher Lynch, Barbara Morawska
with Sorts for Some Separable Equational Theories. RTA (2005)
Christopher Lynch, Catherine A. Meadows
On the Relative Soundness of the Free Algebra Model for Public Key Encryption. Electron. Notes Theor. Comput. Sci. 125 (1) (2005)
Christopher Lynch
Unsound Theorem Proving. CSL (2004)
Christopher Lynch, Catherine A. Meadows
Sound Approximations to Diffie-Hellman Using Rewrite Rules. ICICS (2004)
Christopher Lynch
Schematic Saturation for Decision and Unification Problems. CADE (2003)
Christopher Lynch, Barbara Morawska
Basic Syntactic Mutation. CADE (2002)
Christopher Lynch, Barbara Morawska
Automatic Decidability. LICS (2002)
Christopher Lynch, Barbara Morawska
Decidability and Complexity of Finitely Closable Linear Equational Theories. IJCAR (2001)
Christopher Lynch, Barbara Morawska
Complexity of Linear Standard Theories. LPAR (2001)
Christopher Lynch, Barbara Morawska
Goal-Directed E-Unification. RTA (2001)
Christopher Lynch, Christelle Scharff
Basic Completion with E-cycle Simplification. Fundam. Informaticae 39 (1-2) (1999)
Christopher Lynch
Local Simplification. Inf. Comput. 142 (1) (1998)
Christopher Lynch
The Unification Problem for One Relation Thue Systems. AISC (1998)
Christopher Lynch, Polina Strogova
SOUR graphs for efficient completion. Discret. Math. Theor. Comput. Sci. 2 (1) (1998)
Christopher Lynch, Christelle Scharff
Basic Completion with E-cycle Simplification. AISC (1998)
Christopher Lynch
Oriented Equational Logic Programming is Complete. J. Symb. Comput. 23 (1) (1997)
Christopher Lynch
Goal-Directed Completion Using SOUR Graphs. RTA (1997)
Claude Kirchner, Christopher Lynch, Christelle Scharff
Fine-Grained Concurrent Completion. RTA (1996)
Christopher Lynch, Polina Strogova
PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups. AISMC (1996)
Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
Basic Paramodulation Inf. Comput. 121 (2) (1995)
Christopher Lynch
Paramodulation without Duplication LICS (1995)
Christopher Lynch, Wayne Snyder
Redundancy Criteria for Constrained Completion. Theor. Comput. Sci. 142 (2) (1995)
Christopher Lynch
Oriented Equational Logic Programming is Complete. UNIF (1995)
Christopher Lynch
Local Simplification. CCL (1994)
Christopher Lynch, Wayne Snyder
Redundancy Criteria for Constrained Completion. RTA (1993)
Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
Basic Paramodulation and Superposition. CADE (1992)
Wayne Snyder, Christopher Lynch
Goal Directed Strategies for Paramodulation. RTA (1991)
Wayne Snyder, Christopher Lynch
An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of Equality. CTRS (1990)