Researchers

Eugen Zălinescu
Former member
PostDoc researcher
Presentation

Reaserch Interests: Formal Methods, Runtime Verification, Verification of Security Protocols.

I’ve developed and maintain the MonPoly tool, which is a monitor that checks compliance of log files with respect to policies specified by formulas in metric first-order temporal logic.

From 2007 to 2009, I was a post-doc at the Microsoft Research-Inria Joint Centre in Orsay, working in the Security project.I obtained my PhD in 2007 from the Henri Poincaré - Nancy 1 University. My supervisors were Véronique Cortier and Michaël Rusinowitch. I worked in the INRIA project CASSIS at LORIA.I completed the MDFI master (in fact the former French DEA) in 2004 at IML, Marseille.I graduated from the Faculty of Computer Science, “Al. I. Cuza” University, in Iaşi, Romania in 2003.

Since 2009, I am a researcher at ETHZ in David Basin‘s group working on topics related to runtime verification.

Contact:
+41 44 632 91 83
Publications at the Joint Centre:

2012

Journal articles

titre
Verified Cryptographic Implementations for TLS
auteur
Karthikeyan Bhargavan, Ricardo Corin, Cédric Fournet, Eugen Zalinescu
article
ACM Transactions on Information and System Security, Association for Computing Machinery, 2012, 15 (1), pp.3:1-3:32. <10.1145/2133375.2133378>
Accès au texte intégral et bibtex
http://hal.inria.fr/hal-00863381/file/cryptographically-verified-implementations-for-tls-tissec.pdf BibTex

2011

Journal articles

titre
Analysis of Kasami-Welch Functions in Odd Dimension using Stickelberger’s Theorem
auteur
Philippe Langevin, Gregor Leander, Gary Mcguire, Eugen Zalinescu
article
Journal of Combinatorics and Number Theory, 2011, 2 (1), pp.55 — 72
Accès au bibtex
BibTex

2010

Journal articles

titre
Deciding security properties for cryptographic protocols. Application to key cycles.
auteur
Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
article
ACM Transactions on Computational Logic, Association for Computing Machinery, 2010, 11 (2), pp.Article 9. <10.1145/1656242.1656244>
Accès au bibtex
BibTex