We investigate a resolution-based verification method for secrecy and authentication properties of cryptographic protocols. In experiments, we could enforce its termination by tagging, a syntactic transformation of messages that leaves attack-free executions invariant. In this paper, we generalize the experimental evidence: we prove that the verification method always terminates for tagged protocols. © 2005 Elsevier B.V. All rights reserved.
Blanchet, B., & Podelski, A. (2005). Verification of cryptographic protocols: Tagging enforces termination. In Theoretical Computer Science (Vol. 333, pp. 67–90). https://doi.org/10.1016/j.tcs.2004.10.018