An Efficient Canonical Narrowing Implementation with Irreducibility and SMT Constraints for Generic Symbolic Protocol Analysis

TL;DR

This paper introduces an improved canonical narrowing algorithm capable of handling rewrite theories with conditional rules and SMT constraints, enhancing symbolic protocol analysis tools.

Contribution

It presents a novel canonical narrowing implementation that integrates SMT constraints and irreducibility, advancing symbolic analysis of cryptographic protocols.

Findings

Enhanced narrowing algorithm processes conditional rewrite rules.

SMT constraints are used to filter unsatisfiable solutions.

Improves efficiency and accuracy in protocol analysis.

Abstract

Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol analysis, which is why narrowing and unification are used in tools such as Maude-NPA, Tamarin and Akiss. In this work we present the implementation of a canonical narrowing algorithm, which improves the standard narrowing algorithm, extended to be able to process rewrite theories with conditional rules. The conditions of the rules will contain SMT constraints, which will be carried throughout the execution of the algorithm to determine if the solutions have associated satisfiable or unsatisfiable constraints, and in the latter case, discard them.