1. Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: CSFW, pp. 82–96 (2001)
2. Bugliesi, M., Rossi, S.: Non-interference proof techniques for the analysis of cryptographic protocols. Journal of Computer Security 13(1), 87–113 (2005)
3. Chatzikokolakis, K.: Probabilistic and Information-Theoretic Approaches to Anonymity. Ph.D. thesis, École polytechnique (2007)
4. Frühwirth, T.W., Shapiro, E.Y., Vardi, M.Y., Yardeni, E.: Logic programs as types for logic programs. In: LICS, pp. 314–328 (1991)
5. Godoy, G., Giménez, O., Ramos, L., Àlvarez, C.: The hom problem is decidable. In: STOC, pp. 485–494. ACM (2010)