M. Abadi and B. Blanchet, Secrecy types for asymmetric communication, Theoretical Computer Science, vol.298, issue.3, pp.387-415, 2003.
DOI : 10.1016/S0304-3975(02)00863-0

M. Backes, A Cryptographically Sound Security Proof of the Otway-Rees Protocol, proc. ESORICS, pp.89-108, 2004.

M. Backes and B. Pfitzmann, A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol, proc. FST TCS 2003, pp.1-12
DOI : 10.1007/978-3-540-24597-1_1

M. Backes and B. Pfitzmann, Relating Symbolic and Cryptographic Secrecy, proc. IEEE S& P 2005, pp.171-182

M. Backes, B. Pfitzmann, and M. Waidner, A Universally Composable Cryptographic Library, proc. ACM CCS 2003, pp.220-230

C. Fecht and H. Seidl, An even faster solver for general systems of equations, proc. SAS '96, pp.189-204
DOI : 10.1007/3-540-61739-6_42

P. Laud, Secrecy types for a simulatable cryptographic library, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.26-35
DOI : 10.1145/1102120.1102126

C. Sprenger, M. Backes, D. Basin, B. Pfitzmann, and M. Waidner, Cryptographically Sound Theorem Proving, 19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006.
DOI : 10.1109/CSFW.2006.10

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. Vojdani, Mitmelõimeliste C-programmide kraasimine analüsaatoriga Goblin (Linting multi-threaded C programs with the Goblin), 2006.