M. Abadi, Protection in programming-language translations. Secure Internet Programming, vol.77, p.78, 1999.

M. Abadi and C. Fournet, Access control based on execution history, vol.82, 2003.

M. Abadi and J. Planul, On layout randomization for arrays and functions

M. Abadi and G. D. Plotkin, On protection by layout randomization, ACM TISSEC, vol.15, issue.2, p.79, 2012.

M. Abadi, C. Fournet, and G. Gonthier, Secure implementation of channel abstractions. Information and Computation, vol.174, p.79, 2002.

M. Abadi, B. Blanchet, and C. Fournet, The applied pi calculus: Mobile values, new names, and secure communication, J. ACM, vol.65, issue.1, p.44, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01423924

C. Abate, A. Azevedo-de-amorim, R. Blanco, A. N. Evans, G. Fachini et al., When good components go bad: Formally secure compilation despite dynamic compromise. CCS, vol.45, p.81, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01949202

C. Abate, R. Blanco, D. Garg, C. Hriicu, M. Patrignani et al., Journey beyond full abstraction: Exploring robust property preservation for secure compilation, vol.48, p.81, 2011.

P. Agten, R. Strackx, B. Jacobs, and F. Piessens, Secure compilation to modern processors

P. Agten, B. Jacobs, and F. Piessens, Sound modular veriication of C code executing in an unveriied context, vol.43, p.48, 2015.

D. Ahman, C. Hriicu, K. Maillard, G. Martínez, G. Plotkin et al., Dijkstra monads for free, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01424794

D. Ahman, C. Fournet, C. Hriicu, K. Maillard, A. Rastogi et al., Recalling a witness: Foundations and applications of monotonic state, vol.2, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01672733

A. Ahmed, Veriied compilers for a multi-language world, vol.19, p.78

A. Ahmed and M. Blume, Typed closure conversion preserves observational equivalence, vol.42, p.79, 2008.

A. Ahmed and M. Blume, An equivalence-preserving CPS translation via multi-language semantics. ICFP, vol.42, p.79, 2011.

B. Alpern and F. B. Schneider, Deening liveness, vol.IPL, p.29, 1985.

K. Asanovi? and D. A. Patterson, Instruction sets should be free: The case for RISC-V, p.12, 2014.

A. Askarov, S. Hunt, A. Sabelfeld, and D. Sands, Termination-insensitive noninterference leaks more than just a bit, vol.15, p.28, 2008.

A. Azevedo-de-amorim, A methodology for micro-policies, vol.74, p.82, 2017.

A. Azevedo-de-amorim, N. Collins, A. Dehon, D. Demange, C. Hriicu et al., A veriied information-ow architecture, POPL, p.83, 2014.

A. Azevedo-de-amorim, M. Dénès, N. Giannarakis, C. Hriicu, B. C. Pierce et al., Micro-policies: Formally veriied, tag-based security monitors. Oakland S&P, vol.46, p.83, 2015.

A. Azevedo-de-amorim, N. Collins, A. Dehon, D. Demange, C. Hriicu et al., A veriied information-ow architecture, Journal of Computer Security (JCS

, Special Issue on Veriied Information Flow Security, vol.24, issue.6, p.12, 2016.

A. Azevedo-de-amorim, C. Hriicu, and B. C. Pierce, The meaning of memory safety, 7th International Conference on Principles of Security and Trust (POST), vol.76, p.82, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01949201

M. Backes, C. Hriicu, and M. Maaei, Type-checking zero-knowledge. CCS, p.44, 2008.

M. Backes, M. P. Grochulla, C. Hriicu, and M. Maaei, Achieving security despite compromise using zero-knowledge. CSF, p.80, 2009.
DOI : 10.1109/csf.2009.24
URL : http://www.infsec.cs.uni-saarland.de/~hritcu/publications/zk-compromise-wits.pdf

M. Backes, C. Hriicu, and M. Maaei, Union and intersection types for secure protocol implementations. TOSCA (precursor of POST), 2011.
URL : https://hal.archives-ouvertes.fr/hal-01102192

D. Baelde, S. Delaune, and L. Hirschi, A reduced semantics for deciding trace equivalence, LMCS, vol.13, issue.2, p.44, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01906639

G. Barthe, B. Grégoire, and V. Laporte, Secure compilation of side-channel countermeasures: the case of cryptographic "constant-time, vol.14, p.84, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01959560

D. A. Basin and C. Cremers, Know your enemy: Compromising adversaries in protocol analysis, TISSEC, vol.17, issue.2, p.80, 2014.

B. Beurdouche, K. Bhargavan, F. Kiefer, J. Protzenko, E. Rescorla et al., HACL* in Mozilla Firefox: Formal methods and high assurance applications for the web, Real World Crypto Symposium, issue.13, 2018.

K. Bhargavan, B. Bond, A. Delignat-lavaud, C. Fournet, C. Hawblitzel et al., , 2017.

K. Bhargavan, A. Delignat-lavaud, C. Fournet, M. Kohlweiss, J. Pan et al., Implementing and proving the TLS 1.3 record layer, IEEE Security & Privacy, vol.10, issue.8, p.13, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01674096

A. Bittau, P. Marchenko, M. Handley, and B. Karp, Wedge: Splitting applications into reducedprivilege compartments, USENIX NSDI, vol.10, p.46, 2008.

M. Castro and B. Liskov, Practical byzantine fault tolerance and proactive recovery, TOCS, vol.20, issue.4, p.80, 2002.
DOI : 10.1145/571637.571640

E. Cecchetti, A. C. Myers, and O. Arden, Nonmalleable information ow control, vol.28, p.84, 2017.
DOI : 10.1145/3133956.3134054

V. Cheval, V. Cortier, and S. Delaune, Deciding equivalence-based properties using constraint solving, TCS, vol.492, p.45, 2013.
DOI : 10.1016/j.tcs.2013.04.016
URL : https://hal.archives-ouvertes.fr/hal-00881060

V. Cheval, S. Kremer, and I. Rakotonirina, DEEPSEC: Deciding equivalence properties in security protocols theory and practice, S&P, vol.30, p.44, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01698177

D. Chisnall, C. Rothwell, R. N. Watson, J. Woodruu, M. Vadera et al., Beyond the PDP-11: Architectural support for a memory-safe C abstract machine, ASPLOS, vol.10, p.46, 2015.

K. Claessen and J. Hughes, QuickCheck: a lightweight tool for random testing of Haskell programs, 2000.

M. R. Clarkson and F. B. Schneider, Hyperproperties. JCS, vol.18, issue.6, p.79, 2010.

M. Conti, S. Crane, L. Davi, M. Franz, P. Larsen et al., Losing control: On the eeectiveness of control-ow integrity under stack attacks, 2015.

R. De-nicola and M. Hennessy, Testing equivalences for processes, TCS, vol.34, p.31, 1984.

S. Delaune and L. Hirschi, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, JLAMP, vol.87, p.44, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01906634

D. Devriese, M. Patrignani, and F. Piessens, Fully-abstract compilation by approximate backtranslation. POPL, vol.37, p.78, 2016.

D. Devriese, F. Piessens, and L. Birkedal, Reasoning about object capabilities with logical relations and eeect parametricity, EuroS&P, p.83, 2016.

D. Devriese, M. Patrignani, F. Piessens, and S. Keuchel, Modular, fully-abstract compilation by approximate back-translation, LMCS, vol.13, issue.4, p.79

D. Devriese, M. Patrignani, and F. Piessens, , vol.14, p.79, 2018.

U. Dhawan and A. Dehon, Area-eecient near-associative memories on FPGAs. FPGA, 2013.

U. Dhawan, A. Kwon, E. Kadric, C. Hriicu, B. C. Pierce et al., Hardware support for safety interlocks and introspection, SASO Workshop on Adaptive Host and Network Security, 2012.

U. Dhawan, C. Hriicu, R. Rubin, N. Vasilakis, S. Chiricescu et al., Architectural support for software-deened metadata processing, ASPLOS, vol.74, p.84, 2015.

U. Dhawan, C. Hriicu, R. Rubin, N. Vasilakis, S. Chiricescu et al., Architectural support for software-deened metadata processing, ASPLOS, vol.7, p.74, 2015.

V. Silva, M. Payer, and D. X. Song, The correctness-security gap in compiler optimization. S&P Workshops, p.19, 2015.

G. J. Duck and R. H. Yap, EEectiveSan: Type and memory error detection using dynamically typed C/C++. PLDI, vol.9, p.47, 2018.

Z. Durumeric, J. Kasten, D. Adrian, J. A. Halderman, M. Bailey et al., The matter of Heartbleed. IMC, vol.9, p.13, 2014.

A. El-korashy, S. Tsampas, M. Patrignani, D. Devriese, D. Garg et al., Compiling a secure variant of C to capabilities. Dagstuhl Seminar 18201 on Secure Compilation, p.19, 2018.

J. Engelfriet, Determinacy implies (observation equivalence = trace equivalence), TCS, vol.36, p.45, 1985.

A. Erbsen, J. Philipoom, J. Gross, R. Sloan, and A. Chlipala, Simple high-level code for cryptographic arithmetic-with proofs, without compromises, IEEE S&P, issue.13, 2019.

I. Evans, F. Long, U. Otgonbaatar, H. Shrobe, M. Rinard et al., , 2015.

J. S. Fenton, Memoryless subsystems, The Computer Journal, vol.17, issue.2, p.28, 1974.

R. Focardi and R. Gorrieri, A taxonomy of security properties for process algebras, JCS, vol.3, issue.1, p.17, 1995.

C. Fournet, A. D. Gordon, and S. Maaeis, A type discipline for authorization policies, ACM Trans. Program. Lang. Syst, vol.29, issue.5, p.80, 2007.

C. Fournet, N. Swamy, J. Chen, P. Dagand, P. Strub et al., Fully abstract compilation to JavaScript, vol.42, p.79
URL : https://hal.archives-ouvertes.fr/hal-00780803

J. A. Goguen and J. Meseguer, Security policies and security models, S&P, vol.15, p.26, 1982.

A. Gollamudi and C. Fournet, Building secure SGX enclaves using F*, C/C++ and X64. 2nd Workshop on Principles of Secure Compilation (PriSC), vol.10, p.46, 2018.

A. D. Gordon and A. Jeerey, Typing correspondence assertions for communication protocols, TCS, vol.300, issue.1-3, p.53, 2003.

A. D. Gordon and A. Jeerey, Types and eeects for asymmetric cryptographic protocols, JCS, vol.12, issue.3-4, p.79, 2004.

A. D. Gordon and A. Jeerey, Secrecy despite compromise: Types, cryptography, and the picalculus. CONCUR, p.80, 2005.

N. Grimm, K. Maillard, C. Fournet, C. Hriicu, M. Maaei et al., A monadic framework for relational veriication: Applied to information security, program equivalence, and optimizations, CPP, issue.8, 2018.

K. Gudka, R. N. Watson, J. Anderson, D. Chisnall, B. Davis et al., Clean application compartmentalization with SOAAP. CCS, vol.10, p.82, 2015.

A. Haas, A. Rossberg, D. L. Schuu, B. L. Titzer, M. Holman et al., Bringing the web up to speed with WebAssembly, vol.10, p.46, 2017.

I. Haller, Y. Jeon, H. Peng, M. Payer, C. Giuurida et al., TypeSan: Practical type confusion detection, CCS, vol.9, p.47, 2016.

C. Hathhorn, C. Ellison, and G. Rosu, Deening the undeenedness of C. PLDI, vol.9, p.47, 2015.

. Heartbleed, The Heartbleed bug, p.47, 2014.

J. L. Henning, SPEC CPU2006 benchmark descriptions, SIGARCH Comput. Archit. News, vol.34, issue.4, p.81, 2006.

C. Hriicu, M. Greenberg, B. Karel, B. C. Pierce, and G. Morrisett, All your IFCException are belong to us. Oakland S&P, 2013.

C. Hriicu, J. Hughes, B. C. Pierce, A. Spector-zabusky, D. Vytiniotis et al., Testing noninterference, quickly. ICFP. 2013b. 6, vol.7

C. Hriicu, L. Lampropoulos, A. Spector-zabusky, A. Azevedo-de-amorim, M. Dénès et al., Testing noninterference, quickly, JFP, vol.26, issue.6, p.4, 2016.

. Intel, Software guard extensions (SGX) programming reference, vol.10, p.78, 2014.

I. Iso/, IEC, vol.9899, p.47, 2011.

R. Jagadeesan, C. Pitcher, J. Rathke, and J. Riely, Local memory via layout randomization. CSF, vol.14, p.79, 2011.
DOI : 10.1109/csf.2011.18
URL : http://fpl.cs.depaul.edu/rjagadeesan/ftp/layout.pdf

A. Jeerey and J. Rathke, Java Jr: Fully abstract trace semantics for a core Java language, ESOP, vol.36, p.79, 2005.

A. Jeerey and J. Rathke, A fully abstract may testing semantics for concurrent objects, TCS, vol.338, issue.1-3, p.44, 2005.

L. Jia, S. Sen, D. Garg, and A. Datta, A logic of programs with interface-connned code, p.83, 2015.

Y. Juglaret, C. Hriicu, A. A. De-amorim, B. C. Pierce, A. Spector-zabusky et al., Towards a fully abstract compiler using micro-policies: Secure compilation for mutually distrustful components, vol.46, p.77, 2011.

Y. Juglaret, C. Hriicu, A. Azevedo-de-amorim, B. Eng, and B. C. Pierce, Beyond good and evil: Formalizing the security guarantees of compartmentalizing compilation. CSF, vol.79, p.81, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01424795

J. Kang, Y. Kim, C. Hur, D. Dreyer, and V. Vafeiadis, Lightweight veriication of separate compilation, POPL, vol.60, p.62, 1920.

A. Kennedy, Securing the .net programming model, Theoretical Computer Science, vol.364, issue.3, p.78, 2006.

D. Kilpatrick, Privman: A library for partitioning applications. USENIX FREENIX, vol.10, p.46, 2003.

T. F. Knight, A. Dehon, A. Sutherland, U. Dhawan, A. Kwon et al., SAFE ISA (version 3.0 with interrupts per thread), p.76, 2012.

R. Krebbers, The C Standard Formalized in Coq, vol.9, p.47, 2015.

J. Kroll, G. Stewart, and A. Appel, Portable software fault isolation. CSF, p.80, 2014.

R. Kumar, M. O. Myreen, M. Norrish, and S. Owens, CakeML: a veriied implementation of ML, The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, vol.10, p.21, 2014.

O. Kupferman and M. Y. Vardi, Robust satisfaction. CONCUR, vol.15, p.79, 1999.

L. Lamport, Specifying systems: the TLA+ language and tools for hardware and software engineers, vol.18, p.21, 2002.

L. Lamport and F. B. Schneider, Formal foundation for speciication and veriication, Distributed Systems: Methods and Tools for Speciication, An Advanced Course, vol.48, p.53, 1984.

L. Lamport, R. E. Shostak, and M. C. Pease, The byzantine generals problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, p.80, 1982.

L. Lampropoulos, D. Gallois-wong, C. Hriicu, J. Hughes, B. C. Pierce et al., Beginner's Luck: A language for random generators, 2017.

L. Lampropoulos, Z. Paraskevopoulou, and B. C. Pierce, Generating good generators for inductive relations, PACMPL, vol.2, issue.8, 2018.

A. Larmuseau, M. Patrignani, and D. Clarke, A secure compiler for ML modules, APLAS, vol.14, p.78, 2015.

C. Lattner, What every C programmer should know about undeened behavior #1/3. LLVM Project Blog, p.47, 2011.

J. Lee, Y. Kim, Y. Song, C. Hur, S. Das et al., Taming undeened behavior in LLVM. PLDI, p.67, 2017.

X. Leroy, Formal veriication of a realistic compiler, CACM, vol.52, issue.7, p.71, 2009.

X. Leroy, Formal veriication of a realistic compiler, CACM, vol.52, issue.7, p.82, 2009.

X. Leroy and S. Blazy, Formal veriication of a C-like memory model and its uses for verifying program transformations, JAR, vol.41, issue.1, p.67, 2008.

Z. Manna and A. Pnueli, Temporal veriication of reactive systems: safety, vol.18, p.21, 2012.

G. Martínez, D. Ahman, V. Dumitrescu, N. Giannarakis, C. Hawblitzel et al., Proof automation with SMT, tactics, and metaprograms, 2018.

J. Mclean, Proving noninterference and functional correctness using traces, Journal of Computer Security, vol.1, issue.1, p.28, 1992.

B. Montagu, B. C. Pierce, and R. Pollack, A theory of information-ow labels. CSF, 2013.

G. Morrisett, G. Tan, J. Tassarotti, J. Tristan, and E. Gan, RockSalt: better, faster, stronger SFI for the x86, vol.73, p.80

E. Mullen, D. Zuniga, Z. Tatlock, and D. Grossman, Veriied peephole optimizations for CompCert. PLDI, p.66, 2016.

S. Nagarakatte, J. Zhao, M. M. Martin, and S. Zdancewic, CETS: compiler enforced temporal safety for C. ISMM, vol.9, p.82, 2010.

S. Nagarakatte, M. M. Martin, and S. Zdancewic, Everything you want to know about pointer-based checking

G. Neis, C. Hur, J. Kaiser, C. Mclaughlin, D. Dreyer et al., Pilsner: a compositionally veriied compiler for a higher-order imperative language

M. S. New, W. J. Bowman, and A. Ahmed, Fully abstract compilation via universal embedding, ICFP, vol.78, p.79, 2016.

Z. Paraskevopoulou, C. Hriicu, M. Dénès, L. Lampropoulos, and B. C. Pierce, Foundational property-based testing, ITP, vol.8, p.73, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01162898

M. Patrignani and D. Clarke, Fully abstract trace semantics for protected module architectures, CL, vol.42, p.79, 2015.

M. Patrignani and D. Garg, Secure compilation and hyperproperty preservation, p.44, 2017.

M. Patrignani and D. Garg, Robustly safe compilation. CoRR, vol.14, p.79, 2018.

M. Patrignani, P. Agten, R. Strackx, B. Jacobs, D. Clarke et al., Secure compilation to protected module architectures, TOPLAS, vol.69, p.78, 2015.

M. Patrignani, D. Devriese, and F. Piessens, On modular and fully-abstract compilation, vol.43, p.78, 2016.

M. Patrignani, A. Ahmed, and D. Clarke, Formal approaches to secure compilation: A survey of fully abstract compilation and related work, ACM Computing Surveys, vol.14, p.45, 2019.

J. T. Perconti and A. Ahmed, Verifying an open compiler using multi-language semantics, ESOP, 1920.

J. Protzenko, J. Zinzindohoué, A. Rastogi, T. Ramananandro, P. Wang et al., , vol.17, p.81, 2017.

N. Provos, M. Friedl, and P. Honeyman, Preventing privilege escalation, 12th USENIX Security Symposium, vol.10, p.46, 2003.

W. Rafnsson, L. Jia, and L. Bauer, Timing-sensitive noninterference through composition, Principles of Security and Trust-6th International Conference, POST 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, p.84, 2017.

J. Regehr, A guide to undeened behavior in C and C++, part 3. Embedded in Academia blog, vol.47, p.65, 2010.

C. Reis and S. D. Gribble, Isolating web programs in modern browser architectures, EuroSys, vol.10, p.82, 2009.

N. Roessler and A. Dehon, Protecting the stack with metadata policies and tagged hardware, IEEE S&P, p.82, 2018.

A. W. Roscoe, CSP and determinism in security modelling, S&P, p.28, 1995.

A. Sabelfeld and A. C. Myers, Language-based information-ow security, IEEE Journal on Selected Areas in Communications, vol.21, issue.1, p.26, 2003.

A. Sabelfeld and D. Sands, A PER model of secure information ow in sequential programs, HOSC, vol.14, issue.1, p.28, 2001.

F. Schneider, On Concurrent Programming. Texts in Computer Science, vol.18, p.21, 1997.

L. Simon, D. Chisnall, and R. J. Anderson, What you get is what you C: Controlling side eeects in mainstream C compilers, EuroS&P, p.19, 2018.

L. Skorstengaard, D. Devriese, and L. Birkedal, Reasoning about a machine with local capabilities-provably safe stack and return pointer management, ESOP, vol.10, p.80, 2018.

L. Skorstengaard, D. Devriese, and L. Birkedal, Enforcing well-bracketed control ow and stack encapsulation using linear capabilities

G. Stewart, L. Beringer, S. Cuellar, and A. W. Appel, Compositional CompCert. POPL, 1920.

G. T. Sullivan, S. Chiricescu, A. Dehon, D. Demange, S. Iyer et al., SAFE: A clean-slate architecture for secure systems, Proceedings of the IEEE International Conference on Technologies for Homeland Security, 2013.

N. Swamy, C. Hriicu, C. Keller, A. Rastogi, A. Delignat-lavaud et al., Dependent types and multi-monadic eeects in F*. POPL, vol.8, p.10, 2016.

D. Swasey, D. Garg, and D. Dreyer, Robust and compositional veriication of object capability patterns, vol.44, p.79, 2017.

L. Szekeres, M. Payer, T. Wei, and D. Song, SoK: Eternal war in memory, IEEE S&P, vol.13, issue.9, p.73, 2013.

G. Tan, Principles and implementation techniques of software-based fault isolation, FTSEC, vol.1, issue.3, p.46, 2017.

S. Tsampas, A. El-korashy, M. Patrignani, D. Devriese, D. Garg et al., Towards automatic compartmentalization of C programs on capability machines, vol.11, p.46, 2017.

N. Van-ginkel, R. Strackx, J. T. Muehlberg, and F. Piessens, Towards safe enclaves. HotSpot, vol.11, p.46, 2016.

T. Van-strydonck, D. Devriese, and F. Piessens, Linear capabilities for modular fully-abstract compilation of veriied code, vol.11, p.46, 2018.

N. Vasilakis, B. Karel, N. Roessler, N. Dautenhahn, A. Dehon et al., BreakApp: Automated, exible application compartmentalization

R. Wahbe, S. Lucco, T. E. Anderson, and S. L. Graham, EEcient software-based fault isolation, SOSP, vol.46, p.72, 1993.

X. Wang, N. Zeldovich, M. F. Kaashoek, and A. Solar-lezama, Towards optimization-safe systems: Analyzing the impact of undeened behavior

R. N. Watson, J. Woodruu, P. G. Neumann, S. W. Moore, J. Anderson et al., CHERI: A hybrid capability-system architecture for scalable software compartmentalization. S&P, p.82, 2015.

R. N. Watson, J. Woodruu, P. G. Neumann, S. W. Moore, J. Anderson et al., CHERI: A hybrid capability-system architecture for scalable software compartmentalization, IEEE S&P, vol.10, p.66, 2015.

P. Wilke, F. Besson, S. Blazy, and A. Dang, CompCert for software fault isolation, Secure Compilation Meeting (SCM

T. Y. Woo and S. S. Lam, A semantic model for authentication protocols, IEEE S&P, p.53, 1993.

G. Wood, Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, vol.151, p.25, 2014.

B. Yee, D. Sehr, G. Dardyk, J. B. Chen, R. Muth et al., Native Client: A sandbox for portable, vol.53, p.82, 2010.

A. Zakinthinos and E. S. Lee, A general theory of security properties, p.17, 1997.

S. Zdancewic and A. C. Myers, Observational determinism for concurrent program security, vol.15, p.28, 2003.

L. Zhao, G. Li, B. D. Sutter, and J. Regehr, ARMor: Fully veriied software fault isolation. EMSOFT, p.80, 2011.

J. Zinzindohoué, K. Bhargavan, J. Protzenko, and B. Beurdouche, HACL*: A veriied modern cryptographic library, vol.10, p.13, 2017.

, The results presented in this habilitation have previously appeared in a series of research papers that are appended below. I have substantially contributed to each of these papers, which I coauthored with my students and several external collaborations

C. Abate, R. Blanco, D. Garg, C. Hriicu, M. Patrignani et al., Journey beyond full abstraction: Exploring robust property preservation for secure compilation, 2018.

C. Abate, A. Azevedo-de, R. Amorim, A. N. Blanco, G. Evans et al., When good components go bad: Formally secure compilation despite dynamic compromise, 25th ACM Conference on Computer and Communications Security (CCS 2018), pp.1351-1368, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01949202

Y. Juglaret, C. Hriicu, A. Azevedo-de-amorim, B. Eng, and B. C. Pierce, Beyond good and evil: Formalizing the security guarantees of compartmentalizing compilation, 29th IEEE Symposium on Computer Security Foundations (CSF), pp.45-60, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01424795

A. Azevedo-de-amorim, M. Dénès, N. Giannarakis, C. Hriicu, B. C. Pierce et al., Micro-Policies: Formally veriied, tag-based security monitors, 36th IEEE Symposium on Security and Privacy (Oakland S&P), pp.813-830, 2015.

A. Azevedo-de-amorim, N. Collins, A. Dehon, D. Demange, C. Hriicu et al., A veriied information-ow architecture, Journal of Computer Security (JCS); Special Issue on Veriied Information Flow Security, vol.24, issue.6, pp.689-734, 2016.