10.4230/LIPICS.RTA.2011.11
Conchinha, Bruno
Bruno
Conchinha
Basin, David A.
David A.
Basin
Caleiro, Carlos
Carlos
Caleiro
FAST: An Efficient Decision Procedure for Deduction and Static Equivalence
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Article
Efficient algorithms
Equational theories
Deducibility
Static equivalence
Security protocols
Schmidt-Schauß, Manfred
Manfred
Schmidt-Schauß
2011
2011-04-26
2011-04-26
2011-04-26
en
urn:nbn:de:0030-drops-31369
10.4230/LIPIcs.RTA.2011
978-3-939897-30-9
1868-8969
10.4230/LIPIcs.RTA.2011
LIPIcs, Volume 10, RTA 2011
22nd International Conference on Rewriting Techniques and Applications (RTA'11)
2013
10
4
11
20
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Schmidt-Schauß, Manfred
Manfred
Schmidt-Schauß
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2011
10
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
10 pages
551504 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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 ideas of our implementation and compare its
performance with competing tools. The results show that our
implementation is significantly faster: for many examples, FAST
terminates in under a second, whereas other tools take several
minutes.
LIPIcs, Vol. 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11), pages 11-20