Marco Patrignani

Orcid: 0000-0003-3411-9678

Affiliations:
  • University of Trento, Italy
  • CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
  • Stanford University, USA


According to our database1, Marco Patrignani authored at least 46 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Semantic Expressiveness of Iso- and Equi-Recursive Types.
Log. Methods Comput. Sci., 2024

Do You Even Lift? Strengthening Compiler Security Guarantees Against Spectre Attacks.
CoRR, 2024

Computationally Bounded Robust Compilation and Universally Composable Security.
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024

2023
MSWasm: Soundly Enforcing Memory-Safe Execution of Unsafe Code.
Proc. ACM Program. Lang., January, 2023

Robust Constant-Time Cryptography.
CoRR, 2023

Secure Composition of Robust and Optimising Compilers.
CoRR, 2023

Robust Safety for Move.
Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

2022
Two Parametricities Versus Three Universal Types.
ACM Trans. Program. Lang. Syst., December, 2022

MSWasm: Soundly Enforcing Memory-Safe Execution of Unsafe Code.
CoRR, 2022

Modular information flow through ownership.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Automatic Detection of Speculative Execution Combinations.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Robustly Safe Compilation, an Efficient Form of Secure Compilation.
ACM Trans. Program. Lang. Syst., 2021

An Extended Account of Trace-relating Compiler Correctness and Secure Compilation.
ACM Trans. Program. Lang. Syst., 2021

On the semantic expressiveness of recursive types.
Proc. ACM Program. Lang., 2021

CapablePtrs: Securely Compiling Partial Programs Using the Pointers-as-Capabilities Principle.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

Exorcising Spectres with Secure Compilers.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Contract-Aware Secure Compilation.
CoRR, 2020

Why Should Anyone use Colours? or, Syntax Highlighting Beyond Code Snippets.
CoRR, 2020

Type-directed scheduling of streaming accelerators.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Trace-Relating Compiler Correctness and Secure Compilation.
Proceedings of the Programming Languages and Systems, 2020

2019
Formal Approaches to Secure Compilation: A Survey of Fully Abstract Compilation and Related Work.
ACM Comput. Surv., 2019

Memory Safety Preservation for WebAssembly.
CoRR, 2019

Universal Composability is Secure Compilation.
CoRR, 2019

Trace-Relating Compiler Correctness and Secure Compilation.
CoRR, 2019

Robustly Safe Compilation.
Proceedings of the Programming Languages and Systems, 2019

Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018
Parametricity versus the universal type.
Proc. ACM Program. Lang., 2018

Exploring Robust Property Preservation for Secure Compilation.
CoRR, 2018

Robustly Safe Compilation or, Efficient, Provably Secure Compilation.
CoRR, 2018

2017
Modular, Fully-abstract Compilation by Approximate Back-translation.
Log. Methods Comput. Sci., 2017

Robust Hyperproperty Preservation for Secure Compilation (Extended Abstract).
CoRR, 2017

Secure Compilation and Hyperproperty Preservation.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016
On Modular and Fully-Abstract Compilation - Technical Appendix.
CoRR, 2016

Implementing a secure abstract machine.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Fully-abstract compilation by approximate back-translation.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

On Modular and Fully-Abstract Compilation.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
The Tome of Secure Compilation: Fully Abstract Compilation to Protected Modules Architectures ; Het boek van veilige compilatie: Volledig abstracte compilatie naar beschermende modulearchitecturen.
PhD thesis, 2015

Secure Compilation to Protected Module Architectures.
ACM Trans. Program. Lang. Syst., 2015

Fully abstract trace semantics for protected module architectures.
Comput. Lang. Syst. Struct., 2015

A High-Level Model for an Assembly Language Attacker by Means of Reflection.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2015

A Secure Compiler for ML Modules.
Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014
Fully abstract trace semantics for low-level isolation mechanisms.
Proceedings of the Symposium on Applied Computing, 2014

Operational Semantics for Secure Interoperation.
Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, 2014

2013
Secure Compilation of Object-Oriented Components to Protected Module Architectures.
Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012
Formal analysis of policies in wireless sensor network applications.
Proceedings of the Third International Workshop on Software Engineering for Sensor Network Applications, 2012

2011
Ownership Types for the Join Calculus.
Proceedings of the Formal Techniques for Distributed Systems, 2011


  Loading...