Daniel Le Métayer. Daniel Le Métayer. Privacy by design: a
matter of choice. In International Conference on Computers,
Privacy and Data Protection, (CPDP'2009), Springer Verlag, to
appear.
Daniel Le Métayer. A formal privacy management framework. In
Formal Aspects in Security and Trust (FAST), volume 5491 of
Lecture Notes in Computer Science, pages 162-176. Springer,
2009.
Daniel Le Métayer, Shara Monteleone. Automated consent through
privacy agents: Legal requirements and technical architecture.Computer Law & Security Review, Elsevier, 25(2):136-144,
2009
Daniel Le Métayer, Claire Loiseaux. ASTRA: a security analysis
method based on asset tracking. . In Proc. of the IFIP TC 11 23d
International Information Security Conference (IFIP SEC
2008), Springer Verlag.
Daniel Le Métayer. IT security analysis: best practices and formal
approaches. In Proc. of Foundations of Security Analysis and
Design IV (FOSAD), SpringerVerlag,
LNCS, Vol. 4677, 2007.
Frédéric Besson, Thomas Jensen, Daniel Le Métayer, Tommy Thorn.
Model checking security properties of control flow graphs. In
Journal of Computer Security (JCS), Vol. 9, pp.
217-250, 2001.
Jean-Pierre Banâtre, Pascal Fradet, Daniel Le Métayer. Gamma and the
chemical reaction model: fifteen years after. In Multiset
Processing, Springer Verlag, LNCS, Vol. 2235, 2001.
Pascal Fradet, Daniel Le Métayer, Michaël Périn. Consistency
checking for multiple view software architectures. In Proc. of the
Joint European Software Engineering Conference and Symp. on Foundations
of Software Engineering (ESEC/FSE'99), Software
Engineering Notes 24 (6) and LNCS Vol 1687 pp.
410-428, 1999.
Valérie Gouranton, Daniel Le Métayer. Dynamic slicing: a generic
analysis based on a natural semantics format, Journal of Logic and
Computation (JLC), Vol 9, No. 6, 1999.
Daniel Le Métayer. Describing software architecture styles using
graph grammars. In IEEE Transactions on Software Engineering
(TSE), Vol. 25, No 7, 1998.
Geoffrey Burn, Daniel Le Métayer. Proving the correctness of
compiler optimisations based on a global analysis. Journal of
Functional Programming (JFP), 31(2-3), pp. 263-289, 1998.
Chris Hankin, Daniel Le Métayer. Deriving algorithms from type
inference systems: application to strictness analysis, In Proc. of
Principles of Programming Languages (POPL'94), ACM Press, pp.
202-212, 1994.
Pascal Fradet and Daniel Le Métayer. Compilation of functional
languages by program transformation. ACM Transactions on
Programming Languages and Systems (TOPLAS), 13(1), pp. 21-51,
1991.