C. Lynch

发表

Resolution Theorem Proving

Harald Ganzinger, David A. McAllester, Leo Bachmair, 2001, Handbook of Automated Reasoning.

Model Elimination with Basic Ordered Paramodulation

Christopher Lynch, Max Moser, C. Lynch, 1995 .

Unification Modulo Homomorphic Encryption

Michaël Rusinowitch, Paliath Narendran, Siva Anantharaman, 2009, FroCoS.

L O ] 1 4 N ov 2 01 8 Bounded ACh Unification

Ajay Kumar Eeralla, C. Lynch, 2018 .

Sour Graphs for Eecient Completion

Christopher Lynch, Polina Strogova, C. Lynch, 1995 .

SMT Interpolants

C. Lynch, Yuefeng Tang, 2008 .

Had One Invited Talk by Catherine Meadows (a Crypto- Grapher's Garden of Equational Theories: Interesting Unification Problems from Cryptography). External Reviewer a Cryptographer's Garden of Equational Theories: Interesting Unification Problems from Cryptography Order-sorted Unification with Regul

P. Narendran, C. Lynch, 2009 .

Unification in Blind Signatures

P. Narendran, C. Lynch, Serdar Erbatur, 2022 .

Basic Paramodulation List of Symbols

H. Ganzinger, L. Bachmair, C. Lynch, 1995 .

Efficient general AGH-unification

Zhiqiang Liu, Christopher Lynch, C. Lynch, 2014, Inf. Comput..

On Forward Closure and the Finite Variant Property

Paliath Narendran, Kimberly A. Gero, Christopher Bouchard, 2013, FroCos.

Basic Syntactic Mutation

Christopher Lynch, Barbara Morawska, C. Lynch, 2002, CADE.

Goal-Directed E-Unification

Christopher Lynch, Barbara Morawska, C. Lynch, 2001, RTA.

Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis

José Meseguer, Paliath Narendran, Santiago Escobar, 2013, CADE.

On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Maria Paola Bonacina, Leonardo Mendonça de Moura, Christopher Lynch, 2011, Journal of Automated Reasoning.

Basic Paramodulation

Wayne Snyder, Harald Ganzinger, Leo Bachmair, 1995, Inf. Comput..

On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving

Maria Paola Bonacina, Leonardo Mendonça de Moura, Christopher Lynch, 2009, CADE.

Efficient General Unification for XOR with Homomorphism

Zhiqiang Liu, Christopher Lynch, C. Lynch, 2011, CADE.

Complete Trigger Selection in Satisfiability modulo first-order Theories

C. Lynch, Stephen Miner, 2023, SMT.

Automatic decidability and combinability

Christophe Ringeissen, Silvio Ranise, Duc-Khanh Tran, 2011, Inf. Comput..

SMELS: Satisfiability Modulo Equality with Lazy Superposition

C. Lynch, Quang-Trung Ta, Duc-Khanh Tran, 2008, Journal of Automated Reasoning.

Rewriting Interpolants

Christopher Lynch, Yuefeng Tang, C. Lynch, 2008, FICS.

Automatic Decidability and Combinability Revisited

Duc-Khanh Tran, Christopher Lynch, C. Lynch, 2007, CADE.

Unsound Theorem Proving

Christopher Lynch, C. Lynch, 2004, CSL.

Decidability and Complexity of Finitely Closable Linear Equational Theories

Christopher Lynch, Barbara Morawska, C. Lynch, 2001, IJCAR.

An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems

Christopher Lynch, Dohan Kim, C. Lynch, 2021, FSCD.

Basic Completion with E-cycle Simplification

Christopher Lynch, Christelle Scharff, C. Lynch, 1999, Fundam. Informaticae.

Redundancy Criteria for Constrained Completion

Wayne Snyder, Christopher Lynch, C. Lynch, 1993, Theor. Comput. Sci..

Basic Paramodulation and Superposition

Wayne Snyder, Harald Ganzinger, Leo Bachmair, 1992, CADE.

Goal Directed Strategies for Paramodulation

Wayne Snyder, Christopher Lynch, C. Lynch, 1991, RTA.

Oriented Equational Logic Programming is Complete

Christopher Lynch, C. Lynch, 1995, J. Symb. Comput..

Automatic decidability

Christopher Lynch, Barbara Morawska, C. Lynch, 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

Sound Approximations to Diffie-Hellman Using Rewrite Rules

Catherine A. Meadows, Christopher Lynch, C. Lynch, 2004, ICICS.

Congruence Closure Modulo Permutation Equations

Christopher Lynch, Dohan Kim, C. Lynch, 2021, SCSS.

Unification Modulo Homomorphic Encryption

Michaël Rusinowitch, Paliath Narendran, Siva Anantharaman, 2009, Journal of Automated Reasoning.

Complexity of Linear Standard Theories

Christopher Lynch, Barbara Morawska, C. Lynch, 2001, LPAR.

Encoding First Order Proofs in SMT

Hai Lin, Christopher Lynch, Jeremy Bongio, 2008, SMT@CAV.

Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories

Christopher Lynch, Barbara Morawska, C. Lynch, 2005, RTA.

PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups

Christopher Lynch, Polina Strogova, C. Lynch, 1996, AISMC.

Protocol analysis in Maude-NPA using unification modulo homomorphic encryption

José Meseguer, Paliath Narendran, Santiago Escobar, 2011, PPDP.

Cap unification: application to protocol security modulo homomorphic encryption

Michaël Rusinowitch, Paliath Narendran, Siva Anantharaman, 2010, ASIACCS '10.

Protocol Verification Via Rigid/Flexible Resolution

Stéphanie Delaune, Hai Lin, Christopher Lynch, 2007, LPAR.

On the Relative Soundness of the Free Algebra Model for Public Key Encryption

Catherine A. Meadows, Christopher Lynch, C. Lynch, 2005, ARSPA@IJCAR.

SMELS: Satisfiability Modulo Equality with Lazy Superposition

Quang-Trung Ta, Duc-Khanh Tran, Christopher Lynch, 2012, Journal of Automated Reasoning.

Unification Modulo Synchronous Distributivity

P. Narendran, C. Lynch, M. Rusinowitch, 2012, IJCAR.

Goal-Directed Completion Using SOUR Graphs

Christopher Lynch, C. Lynch, 1997, RTA.

Paramodulation without duplication

Christopher Lynch, C. Lynch, 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

A Fine-Grained Concurrent Completion Procedure

Claude Kirchner, Christopher Lynch, Christelle Scharff, 1996 .

Interpolants for Linear Arithmetic in SMT

Christopher Lynch, Yuefeng Tang, C. Lynch, 2008, ATVA.