Fröschle, Sibylle B.Sibylle B.Fröschle2021-11-262021-11-262015Lecture Notes in Computer Science 9036: 176-195 (2015)http://hdl.handle.net/11420/11092A limit to algorithmic verification of security protocols is posed by the fact that checking whether a security property such as secrecy is satisfied is undecidable in general. In this paper we introduce the class of well-founded protocols. It is designed to exclude what seems to be common to all protocols used in undecidability proofs: the protocol syntax ensures that honest information cannot be propagated unboundedly without the intruder manipulating it. We show that the secrecy property of leakiness is decidable for well-founded protocols.enInformatikConference Paper10.1007/978-3-662-46666-7_10Other