Christopher Lynch

Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch: Unification Modulo Homomorphic Encryption. J. Autom. Reasoning 48(2): 135-158 (2012)

Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch: Unification Modulo Synchronous Distributivity. IJCAR 2012: 14-29

Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse: Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. ESORICS 2012: 73-90

Christopher Lynch, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran: Automatic decidability and combinability. Inf. Comput. 209(7): 1026-1047 (2011)

Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura: On Deciding Satisfiability by Theorem Proving with Speculative Inferences. J. Autom. Reasoning 47(2): 161-189 (2011)

Christopher Lynch, Ross Lambert, Frederic D. McKenzie, Adam Williams: A remote monitoring system for treating Pectus Carinatum. BMEI 2011: 2365-2369

Zhiqiang Liu, Christopher Lynch: Efficient General Unification for XOR with Homomorphism. CADE 2011: 407-421

Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse: Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. PPDP 2011: 65-76

Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch: Cap unification: application to protocol security modulo homomorphic encryption. ASIACCS 2010: 192-203

Christopher Lynch: Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List). RTA 2010

Christopher Lynch: Preface. RTA 2010

Christopher Lynch (Ed.): Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, July 11-13, 2010, Edinburgh, Scottland, UK. LIPIcs 6, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010, isbn 978-3-939897-18-7

Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura: On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving. CADE 2009: 35-50

Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch: Unification Modulo Homomorphic Encryption. FroCoS 2009: 100-116

Christopher Lynch, Ralph Eric McGregor: Combining Instance Generation and Resolution. FroCoS 2009: 304-318

Jeremy Bongio, Cyrus Katrak, Hai Lin, Christopher Lynch, Ralph Eric McGregor: Encoding First Order Proofs in SMT. Electr. Notes Theor. Comput. Sci. 198(2): 71-84 (2008)

Christopher Lynch, Yuefeng Tang: Rewriting Interpolants. Electr. Notes Theor. Comput. Sci. 212: 163-176 (2008)

Christopher Lynch, Yuefeng Tang: Interpolants for Linear Arithmetic in SMT. ATVA 2008: 156-170

Christopher Lynch, Duc-Khanh Tran: SMELS: Satisfiability Modulo Equality with Lazy Superposition. ATVA 2008: 186-200

Christopher Lynch, Duc-Khanh Tran: Automatic Decidability and Combinability Revisited. CADE 2007: 328-344

Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin, Christopher Lynch, Ralph Eric McGregor: Encoding First Order Proofs in SAT. CADE 2007: 476-491

Christopher Lynch, Hani Hagras, Victor Callaghan: Parallel Type-2 Fuzzy Logic Co-Processors for Engine Management. FUZZ-IEEE 2007: 1-6

Stéphanie Delaune, Hai Lin, Christopher Lynch: Protocol Verification Via Rigid/Flexible Resolution. LPAR 2007: 242-256

Christopher Lynch, Catherine Meadows: On the Relative Soundness of the Free Algebra Model for Public Key Encryption. Electr. Notes Theor. Comput. Sci. 125(1): 43-54 (2005)

Christopher Lynch, Barbara Morawska: Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. RTA 2005: 90-104

Christopher Lynch: Unsound Theorem Proving. CSL 2004: 473-487

Christopher Lynch, Catherine Meadows: Sound Approximations to Diffie-Hellman Using Rewrite Rules. ICICS 2004: 262-277

Christopher Lynch: Schematic Saturation for Decision and Unification Problems. CADE 2003: 427-441

Christopher Lynch, Barbara Morawska: Basic Syntactic Mutation. CADE 2002: 471-485

Christopher Lynch, Barbara Morawska: Automatic Decidability. LICS 2002: 7-

Christopher Lynch, Barbara Morawska: Decidability and Complexity of Finitely Closable Linear Equational Theories. IJCAR 2001: 499-513

Christopher Lynch, Barbara Morawska: Complexity of Linear Standard Theories. LPAR 2001: 186-200

Christopher Lynch, Barbara Morawska: Goal-Directed E-Unification. RTA 2001: 231-245

Christopher Lynch, Christelle Scharff: Basic Completion with E-cycle Simplification. Fundam. Inform. 39(1-2): 145-165 (1999)

Christopher Lynch, Polina Strogova: SOUR graphs for efficient completion. Discrete Mathematics & Theoretical Computer Science 2(1): 1-25 (1998)

Christopher Lynch: Local Simplification. Inf. Comput. 142(1): 102-126 (1998)

Christopher Lynch: The Unification Problem for One Relation Thue Systems. AISC 1998: 195-208

Christopher Lynch, Christelle Scharff: Basic Completion with E-cycle Simplification. AISC 1998: 209-221

Christopher Lynch: Oriented Equational Logic Programming is Complete. J. Symb. Comput. 23(1): 23-45 (1997)

Christopher Lynch: Goal-Directed Completion Using SOUR Graphs. RTA 1997: 8-22

Christopher Lynch, Polina Strogova: PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups. AISMC 1996: 176-190

Claude Kirchner, Christopher Lynch, Christelle Scharff: Fine-Grained Concurrent Completion. RTA 1996: 3-17

Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder: Basic Paramodulation. Inf. Comput. 121(2): 172-192 (1995)

Christopher Lynch, Wayne Snyder: Redundancy Criteria for Constrained Completion. Theor. Comput. Sci. 142(2): 141-177 (1995)

Christopher Lynch: Paramodulation without Duplication. LICS 1995: 167-177

Christopher Lynch: Local Simplification. CCL 1994: 3-18

Christopher Lynch, Wayne Snyder: Redundancy Criteria for Constrained Completion. RTA 1993: 2-16

Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder: Basic Paramodulation and Superposition. CADE 1992: 462-476

Wayne Snyder, Christopher Lynch: Goal Directed Strategies for Paramodulation. RTA 1991: 150-161

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: 454-461