Christopher Lynch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Christopher Lynch has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Hai Lin
Clarkson University
3 shared publications - Andrew M. Marshall
University of Mary Washington
1 shared publication - Brandon Rozek
Rensselaer Polytechnic Institute (RPI), Troy, USA
1 shared publication Catherine A. Meadows
Naval Research Laboratory
1 shared publication- Dohan Kim
Department of Computer Science University of Innsbruck Innsbruck Austria
1 shared publication Paliath Narendran
University at Albany–SUNY
1 shared publication
Latest Publications
- 3 October 2022
- Published by Springer Nature
- p. 272-289
Local XOR Unification: Definitions, Algorithms and Application to Cryptography
- 3 October 2022
- Published by Springer Nature
- p. 272-289
Local XOR Unification: Definitions, Algorithms and Application to Cryptography
- 1 September 2021
- Published by Springer Nature
- p. 271-286
Formal Analysis of Symbolic Authenticity
- 1 September 2021
- Published by Springer Nature
- p. 253-270
Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems
- 1 September 2021
- Published by Springer Nature
- p. 253-270
Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems
- Open Access
- 5 July 2021
- Published by Springer Nature
- p. 166-182
Equational Theorem Proving Modulo
Unlike other methods for theorem proving modulo with constrained clauses [12, 13], equational theorem proving modulo with constrained clauses along with its simplification techniques has not been well studied. We introduce a basic paramodulation calculus modulo equational theories E satisfying certain properties of E and present a new framework for equational theorem proving modulo E with constrained clauses. We propose an inference rule called Generalized E-Parallel for constrained clauses, which makes our inference system completely basic, meaning that we do not need to allow any paramodulation in the constraint part of a constrained clause for refutational completeness. We present a saturation procedure for constrained clauses based on relative reducibility and show that our inference system including our contraction rules is refutationally complete.
- 5 July 2021
- Published by Springer Nature
- p. 166-182
Open AccessEquational Theorem Proving Modulo
Unlike other methods for theorem proving modulo with constrained clauses [12, 13], equational theorem proving modulo with constrained clauses along with its simplification techniques has not been well studied. We introduce a basic paramodulation calculus modulo equational theories E satisfying certain properties of E and present a new framework for equational theorem proving modulo E with constrained clauses. We propose an inference rule called Generalized E-Parallel for constrained clauses, which makes our inference system completely basic, meaning that we do not need to allow any paramodulation in the constraint part of a constrained clause for refutational completeness. We present a saturation procedure for constrained clauses based on relative reducibility and show that our inference system including our contraction rules is refutationally complete.