Tamarin-to-ProVerif Translation Across 121 Models: The Two Verifiers Agree on 246 of 247 Tasks, but ProVerif Is 6.7x Faster

arXiv 2608.06315·low signalXBlueskyLinkedInCopy link

arXiv 2608.06315 (Aug 6) presents a sound translation from Tamarin's multiset rewrite rules to ProVerif's applied-pi calculus, with formal proofs that any property verified in ProVerif holds in the original Tamarin model within the faithful fragment. Evaluated on 121 Tamarin models covering 562 of 566 lemma tasks, the two tools agreed on 246 of 247 non-XOR tasks with definitive results, and the single disagreement was explicitly flagged as an incomplete model. ProVerif was faster in 334 of 362 comparable tasks (92.3%), with median per-task runtime and peak-memory ratios of 6.74x and 6.24x — a concrete argument for running ProVerif first when verifying protocol designs.