default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher Lynch
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c59]Christopher Lynch, Stephen Miner:
Complete Trigger Selection in Satisfiability Modulo First-Order Theories. SMT 2023: 18-32- [i5]Christopher Lynch, Stephen Miner:
Complete Trigger Selection in Satisfiability modulo first-order Theories. CoRR abs/2306.09436 (2023) - 2022
- [c58]Hai Lin
, Christopher Lynch:
Local XOR Unification: Definitions, Algorithms and Application to Cryptography. ICTAC 2022: 272-289 - [c57]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: 147-161 - 2021
- [c56]Dohan Kim, Christopher Lynch:
Equational Theorem Proving Modulo. CADE 2021: 166-182 - [c55]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: 253-270 - [c54]Hai Lin, Christopher Lynch:
Formal Analysis of Symbolic Authenticity. FroCoS 2021: 271-286 - [c53]Dohan Kim, Christopher Lynch:
An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems. FSCD 2021: 19:1-19:17 - [c52]Dohan Kim, Christopher Lynch:
Congruence Closure Modulo Permutation Equations. SCSS 2021: 86-98 - 2020
- [j12]Ajay Kumar Eeralla, Christopher Lynch:
Bounded ACh unification. Math. Struct. Comput. Sci. 30(6): 664-682 (2020) - [i4]Hai Lin, Christopher Lynch:
Local XOR Unification: Definitions, Algorithms and Application to Cryptography. IACR Cryptol. ePrint Arch. 2020: 929 (2020)
2010 – 2019
- 2019
- [c51]Erin Hanna, Christopher Lynch, David Jaz Myers, Corey Richardson:
Finding Intruder Knowledge with Cap-Matching. Foundations of Security, Protocols, and Equational Reasoning 2019: 39-53 - [c50]Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. FroCos 2019: 297-312 - [c49]Dohan Kim, Christopher Lynch, Paliath Narendran:
Reviving Basic Narrowing Modulo. FroCos 2019: 313-329 - [i3]Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. CoRR abs/1907.00227 (2019) - 2018
- [i2]Ajay Kumar Eeralla, Christopher Lynch:
Bounded ACh Unification. CoRR abs/1811.05602 (2018) - 2014
- [j11]Zhiqiang Liu, Christopher Lynch:
Efficient general AGH-unification. Inf. Comput. 238: 128-156 (2014) - 2013
- [j10]Christopher Lynch, Quang-Trung Ta, Duc-Khanh Tran:
SMELS: Satisfiability Modulo Equality with Lazy Superposition. J. Autom. Reason. 51(3): 325-356 (2013) - [c48]Christopher Lynch:
Constructing Bachmair-Ganzinger Models. Programming Logics 2013: 285-301 - [c47]Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse:
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis. CADE 2013: 231-248 - [c46]Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, Paliath Narendran:
On Forward Closure and the Finite Variant Property. FroCos 2013: 327-342 - 2012
- [j9]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption. J. Autom. Reason. 48(2): 135-158 (2012) - [c45]Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Synchronous Distributivity. IJCAR 2012: 14-29 - [c44]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 - 2011
- [j8]Christopher Lynch, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
Automatic decidability and combinability. Inf. Comput. 209(7): 1026-1047 (2011) - [j7]Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura:
On Deciding Satisfiability by Theorem Proving with Speculative Inferences. J. Autom. Reason. 47(2): 161-189 (2011) - [c43]Zhiqiang Liu, Christopher Lynch:
Efficient General Unification for XOR with Homomorphism. CADE 2011: 407-421 - [c42]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 - [c41]Christopher Lynch:
Invited talk: Unification in Cryptographic Protocol Analysis. UNIF 2011: 1 - [c40]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: 59-64 - [i1]Serdar Erbatur, Christopher Lynch, Paliath Narendran:
Unification in a Theory of Blind Signatures. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 31-44 - 2010
- [c39]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Cap unification: application to protocol security modulo homomorphic encryption. AsiaCCS 2010: 192-203 - [c38]Christopher Lynch:
Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List). RTA 2010 - [c37]Christopher Lynch:
Preface. RTA 2010 - [e1]Christopher Lynch:
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 für Informatik 2010, ISBN 978-3-939897-18-7 [contents]
2000 – 2009
- 2009
- [c36]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 - [c35]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption. FroCoS 2009: 100-116 - [c34]Christopher Lynch, Ralph Eric McGregor:
Combining Instance Generation and Resolution. FroCoS 2009: 304-318 - 2008
- [c33]Christopher Lynch, Yuefeng Tang:
Interpolants for Linear Arithmetic in SMT. ATVA 2008: 156-170 - [c32]Christopher Lynch, Duc-Khanh Tran:
SMELS: Satisfiability Modulo Equality with Lazy Superposition. ATVA 2008: 186-200 - [c31]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification modulo Homomorphic Encryption is Decidable. UNIF 2008: 1-15 - [c30]Christopher Lynch, Yuefeng Tang:
Rewriting Interpolants. FICS 2008: 163-176 - 2007
- [c29]Christopher Lynch, Duc-Khanh Tran:
Automatic Decidability and Combinability Revisited. CADE 2007: 328-344 - [c28]Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin, Christopher Lynch, Ralph Eric McGregor:
Encoding First Order Proofs in SAT. CADE 2007: 476-491 - [c27]Christopher Lynch, Hani Hagras, Victor Callaghan:
Parallel Type-2 Fuzzy Logic Co-Processors for Engine Management. FUZZ-IEEE 2007: 1-6 - [c26]Stéphanie Delaune, Hai Lin, Christopher Lynch:
Protocol Verification Via Rigid/Flexible Resolution. LPAR 2007: 242-256 - [c25]Jeremy Bongio, Cyrus Katrak, Hai Lin, Christopher Lynch, Ralph Eric McGregor:
Encoding First Order Proofs in SMT. SMT@CAV 2007: 71-84 - 2006
- [c24]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: 1446-1453 - 2005
- [c23]Christopher Lynch, Hani Hagras, Victor Callaghan:
Embedded Type-2 FLC for Real-Time Speed Control of Marine and Traction Diesel Engines. FUZZ-IEEE 2005: 347-352 - [c22]Christopher Lynch, Barbara Morawska:
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. RTA 2005: 90-104 - 2004
- [c21]Christopher Lynch:
Unsound Theorem Proving. CSL 2004: 473-487 - [c20]Christopher Lynch, Catherine Meadows:
Sound Approximations to Diffie-Hellman Using Rewrite Rules. ICICS 2004: 262-277 - [c19]Christopher Lynch, Catherine Meadows:
On the Relative Soundness of the Free Algebra Model for Public Key Encryption. ARSPA@IJCAR 2004: 43-54 - 2003
- [c18]Christopher Lynch:
Schematic Saturation for Decision and Unification Problems. CADE 2003: 427-441 - 2002
- [c17]Christopher Lynch, Barbara Morawska:
Basic Syntactic Mutation. CADE 2002: 471-485 - [c16]Christopher Lynch, Barbara Morawska:
Automatic Decidability. LICS 2002: 7- - 2001
- [c15]Christopher Lynch, Barbara Morawska:
Decidability and Complexity of Finitely Closable Linear Equational Theories. IJCAR 2001: 499-513 - [c14]Christopher Lynch, Barbara Morawska:
Complexity of Linear Standard Theories. LPAR 2001: 186-200 - [c13]Christopher Lynch, Barbara Morawska:
Goal-Directed E-Unification. RTA 2001: 231-245
1990 – 1999
- 1999
- [j6]Christopher Lynch, Christelle Scharff:
Basic Completion with E-cycle Simplification. Fundam. Informaticae 39(1-2): 145-165 (1999) - 1998
- [j5]Christopher Lynch, Polina Strogova:
SOUR graphs for efficient completion. Discret. Math. Theor. Comput. Sci. 2(1): 1-25 (1998) - [j4]Christopher Lynch:
Local Simplification. Inf. Comput. 142(1): 102-126 (1998) - [c12]Christopher Lynch:
The Unification Problem for One Relation Thue Systems. AISC 1998: 195-208 - [c11]Christopher Lynch, Christelle Scharff:
Basic Completion with E-cycle Simplification. AISC 1998: 209-221 - 1997
- [j3]Christopher Lynch:
Oriented Equational Logic Programming is Complete. J. Symb. Comput. 23(1): 23-45 (1997) - [c10]Christopher Lynch:
Goal-Directed Completion Using SOUR Graphs. RTA 1997: 8-22 - 1996
- [c9]Christopher Lynch, Polina Strogova:
PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups. AISMC 1996: 176-190 - [c8]Claude Kirchner, Christopher Lynch, Christelle Scharff:
Fine-Grained Concurrent Completion. RTA 1996: 3-17 - 1995
- [j2]Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder:
Basic Paramodulation. Inf. Comput. 121(2): 172-192 (1995) - [j1]Christopher Lynch, Wayne Snyder:
Redundancy Criteria for Constrained Completion. Theor. Comput. Sci. 142(2): 141-177 (1995) - [c7]Christopher Lynch:
Paramodulation without Duplication. LICS 1995: 167-177 - [c6]Christopher Lynch:
Oriented Equational Logic Programming is Complete. UNIF 1995: 39-42 - 1994
- [c5]Christopher Lynch:
Local Simplification. CCL 1994: 3-18 - 1993
- [c4]Christopher Lynch, Wayne Snyder:
Redundancy Criteria for Constrained Completion. RTA 1993: 2-16 - 1992
- [c3]Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder:
Basic Paramodulation and Superposition. CADE 1992: 462-476 - 1991
- [c2]Wayne Snyder, Christopher Lynch:
Goal Directed Strategies for Paramodulation. RTA 1991: 150-161 - 1990
- [c1]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
Coauthor Index
aka: Catherine A. Meadows
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
