Arthur Azevedo de Amorim

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 32

Top Topics

Information Flows

Probabilistic Relational

Bayesian Logic Programs

Top Venues

Proc. ACM Program. Lang.

Publications

Jérémy Thibault, Roberto Blanco, Dongjae Lee, Sven Argo, Arthur Azevedo de Amorim, Aïna Linn Georges, Catalin Hritcu, Andrew Tolmach
SECOMP: Formally Secure Compilation of Compartmentalized C Programs. CoRR (2024)
Francis Rinaldi, june wunder, Arthur Azevedo de Amorim, Stefan K. Muller
Pipelines and Beyond: Graph Types for ADTs with Futures. Proc. ACM Program. Lang. 8 (POPL) (2024)
Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi
Domain Reasoning in TopKAT. CoRR (2024)
Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi
Domain Reasoning in TopKAT. ICALP (2024)
june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi
Bunched Fuzz: Sensitivity for Vector Metrics. ESOP (2023)
Francis Rinaldi, june wunder, Arthur Azevedo de Amorim, Stefan K. Muller
Pipelines and Beyond: Graph Types for ADTs with Futures. CoRR (2023)
Arthur Azevedo de Amorim
On Pitts' Relational Properties of Domains. CoRR (2022)
june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi
Bunched Fuzz: Sensitivity for Vector Metrics. CoRR (2022)
Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi
On incorrectness logic and Kleene algebra with top and tests. Proc. ACM Program. Lang. 6 (POPL) (2022)
Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi
On Incorrectness Logic and Kleene Algebra With Top and Tests. CoRR (2021)
Zichao Zhang, Arthur Azevedo de Amorim, Limin Jia, Corina S. Pasareanu
Learning Assumptions for Verifying Cryptographic Protocols Compositionally. FACS (2021)
Han Zhang, Chi Zhang, Arthur Azevedo de Amorim, Yuvraj Agarwal, Matt Fredrikson, Limin Jia
Netter: Probabilistic, Stateful Network Models. VMCAI (2021)
Zichao Zhang, Arthur Azevedo de Amorim, Limin Jia, Corina S. Pasareanu
Automating Compositional Analysis of Authentication Protocols. FMCAD (2020)
Arthur Azevedo de Amorim, Matt Fredrikson, Limin Jia
Reconciling noninterference and gradual typing. LICS (2020)
Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata
Probabilistic Relational Reasoning via Metrics. LICS (2019)
Carmine Abate, Arthur Azevedo de Amorim, Roberto Blanco, Ana Nora Evans, Guglielmo Fachini, Catalin Hritcu, Théo Laurent, Benjamin C. Pierce, Marco Stronati, Andrew Tolmach
When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise. CCS (2018)
Guglielmo Fachini, Catalin Hritcu, Marco Stronati, Arthur Azevedo de Amorim, Ana Nora Evans, Carmine Abate, Roberto Blanco, Théo Laurent, Benjamin C. Pierce, Andrew Tolmach
When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise. CoRR (2018)
Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata
Metric Semantics for Probabilistic Relational Reasoning. CoRR (2018)
Arthur Azevedo de Amorim, Catalin Hritcu, Benjamin C. Pierce
The Meaning of Memory Safety. POST (2018)
Guglielmo Fachini, Catalin Hritcu, Marco Stronati, Ana Nora Evans, Théo Laurent, Arthur Azevedo de Amorim, Benjamin C. Pierce, Andrew Tolmach
Formally Secure Compilation of Unsafe Low-Level Components (Extended Abstract). CoRR (2017)
Arthur Azevedo de Amorim, Catalin Hritcu, Benjamin C. Pierce
The Meaning of Memory Safety. CoRR (2017)
Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, Ikram Cherigui
A semantic account of metric preservation. POPL (2017)
Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, Ikram Cherigui
A Semantic Account of Metric Preservation. CoRR (2017)
Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange, Catalin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack, Andrew Tolmach
A verified information-flow architecture. J. Comput. Secur. 24 (6) (2016)
Catalin Hritcu, Leonidas Lampropoulos, Antal Spector-Zabusky, Arthur Azevedo de Amorim, Maxime Dénès, John Hughes, Benjamin C. Pierce, Dimitrios Vytiniotis
Testing noninterference, quickly. J. Funct. Program. 26 (2016)
Yannis Juglaret, Catalin Hritcu, Arthur Azevedo de Amorim, Benjamin C. Pierce
Beyond Full Abstraction: Formalizing the Security Guarantees of Low-Level Compartmentalization. CoRR (2016)
Yannis Juglaret, Catalin Hritcu, Arthur Azevedo de Amorim, Boris Eng, Benjamin C. Pierce
Beyond Good and Evil: Formalizing the Security Guarantees of Compartmentalizing Compilation. CSF (2016)
Arthur Azevedo de Amorim
Binding Operators for Nominal Sets. MFPS (2016)
Arthur Azevedo de Amorim, Maxime Dénès, Nick Giannarakis, Catalin Hritcu, Benjamin C. Pierce, Antal Spector-Zabusky, Andrew Tolmach
Micro-Policies: Formally Verified, Tag-Based Security Monitors. IEEE Symposium on Security and Privacy (2015)
Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange, Catalin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack, Andrew Tolmach
A Verified Information-Flow Architecture. CoRR (2015)
Yannis Juglaret, Catalin Hritcu, Arthur Azevedo de Amorim, Benjamin C. Pierce, Antal Spector-Zabusky, Andrew Tolmach
Towards a Fully Abstract Compiler Using Micro-Policies: Secure Compilation for Mutually Distrustful Components. CoRR (2015)
Arthur Azevedo de Amorim, Emilio Jesús Gallego Arias, Marco Gaboardi, Justin Hsu
Really Natural Linear Indexed Type Checking. CoRR (2015)
Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange, Catalin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack, Andrew Tolmach
A verified information-flow architecture. POPL (2014)
Catalin Hritcu, Leonidas Lampropoulos, Antal Spector-Zabusky, Arthur Azevedo de Amorim, Maxime Dénès, John Hughes, Benjamin C. Pierce, Dimitrios Vytiniotis
Testing Noninterference, Quickly. CoRR (2014)
Arthur Azevedo de Amorim, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu
Really Natural Linear Indexed Type Checking. IFL (2014)
Catalin Hritcu, John Hughes, Benjamin C. Pierce, Antal Spector-Zabusky, Dimitrios Vytiniotis, Arthur Azevedo de Amorim, Leonidas Lampropoulos
Testing noninterference, quickly. ICFP (2013)