@InProceedings{	  conchinha.ea:fast:2011,
  abstract	= {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. },
  author	= {Bruno Conchinha and David Basin and Carlos Caleiro},
  booktitle	= {22nd International Conference on Rewriting Techniques and
		  Applications, RTA 2011},
  editor	= {Manfred Schmidt-Schauss},
  language	= {USenglish},
  month		= 6,
  pages		= {11--20},
  pdf		= {papers/2011/0_rta11-lipics.pdf},
  publisher	= {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  series	= {LIPIcs},
  title		= {FAST: An Efficient Decision Procedure for Deduction and
		  Static Equivalence},
  url		= {http://drops.dagstuhl.de/opus/volltexte/2011/3136/},
  volume	= 10,
  year		= 2011,
  user		= {brunoco}
}