Christopher Lynch

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