Main content

FAST is an efficient decision procedure for message deducibility and static equivalence under (weak) subterm convergent equational theories.

FAST's algorithm has a significantly better asymptotic complexity than other algorithms implemented by existing tools for the same task, and its performance in practice is, accordingly, is significantly faster: for many examples, FAST terminates in under a second, whereas other tools take several minutes.


Bruno Conchinha


Page URL:
Fri May 26 04:14:09 CEST 2017
© 2017 Eidgenössische Technische Hochschule Zürich