1. Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: 14th Computer Security Foundations Workshop (CSFW 2001), pp. 82–96. IEEE Computer Society (2001)
2. Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proceedings of the 14th Computer Security Foundations Workshop (CSFW 2001), pp. 174–190. IEEE Computer Society (2001)
3. Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: Proceedings of the 18th Annual Symposium on Logic in Computer Science (LICS 2003), pp. 271–280. IEEE Computer Society (2003)
4. Bhargavan, K., Corin, R., Fournet, C., Zalinescu, E.: Cryptographically verified implementations for TLS. In: Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS 2008), pp. 459–468, October 2008
5. Lecture Notes in Computer Science;S Kremer,2005