3 citations · 6 across the 5 of their papers we have counts for
5 papers · 1 filter
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms
Dalton Chichester, Wei Du, Raymond Kauffman +8
Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable pr…
On Problems Dual to Unification
Zümrüt Akçam, Daniel S. Hono, Paliath Narendran
In this paper, we investigate a problem dual to the unification problem, namely the Common Term (CT) problem for string rewriting systems. Our main motivation was in computing fixe…
Asymmetric Unification and Disunification
Veena Ravishankar, Kimberly A. Gero, Paliath Narendran
We compare two kinds of unification problems: Asymmetric Unification and Disunification, which are variants of Equational Unification. Asymmetric Unification is a type of Equationa…
Lynch-Morawska Systems on Strings
Daniel S. Hono, Paliath Narendran, Rafael Veras
We investigate properties of convergent and forward-closed string rewriting systems in the context of the syntactic criteria introduced in \cite{LynchMorawska} by Christopher Lynch…
Notes on Lynch-Morawska Systems
Daniel S. Hono, Namrata Galatage, Kimberly A. Gero +2
In this paper we investigate convergent term rewriting systems that conform to the criteria set out by Christopher Lynch and Barbara Morawska in their seminal paper "Basic Syntacti…