Secure compilation studies compilers that generate target-level components that are as secure as their source-level counterparts. Full abstraction is the most widely-proven property when defining a secure compiler. A compiler is modular if it allows different components to be compiled independently and then to be linked together to form a whole program. Unfortunately, many existing fully-abstract compilers to untyped machine code are not modular. So, while fully-abstractly compiled components are secure from malicious attackers, if they are linked against each other the resulting component may become vulnerable to attacks. This paper studies how to devise modular, fully-abstract compilers. It first analyses the attacks arising when compiled programs are linked together, identifying security threats that are due to linking. Then, it defines a compiler from an object-based language with method calls and dynamic memory allocation to untyped assembly language extended with a memory isolati...

On Modular and Fully-Abstract Compilation / Patrignani, Marco; Devriese, Dominique; Piessens, Frank. - 2016-:(2016), pp. 17-30. ( 29th IEEE Computer Security Foundations Symposium, CSF 2016 Lisbon,Portugal, June 27 - July 1, 2016) [10.1109/CSF.2016.9].

On Modular and Fully-Abstract Compilation

Patrignani , Marco;
2016-01-01

Abstract

Secure compilation studies compilers that generate target-level components that are as secure as their source-level counterparts. Full abstraction is the most widely-proven property when defining a secure compiler. A compiler is modular if it allows different components to be compiled independently and then to be linked together to form a whole program. Unfortunately, many existing fully-abstract compilers to untyped machine code are not modular. So, while fully-abstractly compiled components are secure from malicious attackers, if they are linked against each other the resulting component may become vulnerable to attacks. This paper studies how to devise modular, fully-abstract compilers. It first analyses the attacks arising when compiled programs are linked together, identifying security threats that are due to linking. Then, it defines a compiler from an object-based language with method calls and dynamic memory allocation to untyped assembly language extended with a memory isolati...
2016
{IEEE} 29th Computer Security Foundations Symposium, {CSF} 2016, Lisbon,Portugal, June 27 - July 1, 2016
345 E 47TH ST, NEW YORK, NY 10017 USA
IEEE Computer Society
9781509026074
Patrignani, Marco; Devriese, Dominique; Piessens, Frank
On Modular and Fully-Abstract Compilation / Patrignani, Marco; Devriese, Dominique; Piessens, Frank. - 2016-:(2016), pp. 17-30. ( 29th IEEE Computer Security Foundations Symposium, CSF 2016 Lisbon,Portugal, June 27 - July 1, 2016) [10.1109/CSF.2016.9].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/336521
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 19
  • ???jsp.display-item.citation.isi??? 7
  • OpenAlex 21
social impact