FAST: An Efficient Decision Procedure for Deduction and Static Equivalence

Bruno Conchinha, David A. Basin & Carlos Caleiro
Message deducibility and static equivalence are central problems in symbolic security protocol analysis. We present FAST, an efficient decision procedure for these problems under subterm-convergent equational theories. FAST is a C++ implementation of an improved version of the algorithm presented in our previous work. This algorithm has a better asymptotic complexity than other algorithms implemented by existing tools for the same task, and FAST's optimizations further improve these complexity results. We describe here the main...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.