Date Added: Apr 2011
Message deducibility and static equivalence are central problems in symbolic security protocol analysis. The authors 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 their 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. They describe here the main ideas of their implementation and compare its performance with competing tools.