Planning Attacks to Security Protocols: Case Studies in Logic Programming
Computational Logic: Logic Programming and Beyond, pp. 533-560, 2002.
Formal verification of security protocols has become a key issue in computer security. Yet, it has proven to be a hard task often error prone and discouraging for non-experts in formal methods.In this paper we show how security protocols can be specified and verified efficiently and effectively by embedding reasoning about actions into a ...More
Full Text (Upload PDF)
PPT (Upload PPT)