default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur Azevedo de Amorim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]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): 482-511 (2024)- [c17]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. CCS 2024: 1061-1075 - [c16]Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi:
Domain Reasoning in TopKAT. ICALP 2024: 157:1-157:18 - [i17]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 abs/2401.16277 (2024) - [i16]Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi:
Domain Reasoning in TopKAT. CoRR abs/2404.18417 (2024) - [i15]Arthur Azevedo de Amorim, Cheng Zhang, Marco Gaboardi:
Kleene algebra with commutativity conditions is undecidable. CoRR abs/2411.15979 (2024) - 2023
- [c15]june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi:
Bunched Fuzz: Sensitivity for Vector Metrics. ESOP 2023: 451-478 - [i14]Francis Rinaldi, june wunder, Arthur Azevedo de Amorim, Stefan K. Muller:
Pipelines and Beyond: Graph Types for ADTs with Futures. CoRR abs/2311.06984 (2023) - 2022
- [j3]Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi:
On incorrectness logic and Kleene algebra with top and tests. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - [i13]june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi:
Bunched Fuzz: Sensitivity for Vector Metrics. CoRR abs/2202.01901 (2022) - [i12]Arthur Azevedo de Amorim:
On Pitts' Relational Properties of Domains. CoRR abs/2207.07053 (2022) - 2021
- [c14]Zichao Zhang, Arthur Azevedo de Amorim, Limin Jia, Corina S. Pasareanu:
Learning Assumptions for Verifying Cryptographic Protocols Compositionally. FACS 2021: 3-23 - [c13]Han Zhang, Chi Zhang, Arthur Azevedo de Amorim, Yuvraj Agarwal, Matt Fredrikson, Limin Jia:
Netter: Probabilistic, Stateful Network Models. VMCAI 2021: 486-508 - [i11]Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi:
On Incorrectness Logic and Kleene Algebra With Top and Tests. CoRR abs/2108.07707 (2021) - 2020
- [c12]Zichao Zhang, Arthur Azevedo de Amorim, Limin Jia, Corina S. Pasareanu:
Automating Compositional Analysis of Authentication Protocols. FMCAD 2020: 113-118 - [c11]Arthur Azevedo de Amorim, Matt Fredrikson, Limin Jia:
Reconciling noninterference and gradual typing. LICS 2020: 116-129
2010 – 2019
- 2019
- [c10]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Probabilistic Relational Reasoning via Metrics. LICS 2019: 1-19 - 2018
- [c9]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: 1351-1368 - [c8]Arthur Azevedo de Amorim, Catalin Hritcu, Benjamin C. Pierce:
The Meaning of Memory Safety. POST 2018: 79-105 - [i10]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 abs/1802.00588 (2018) - [i9]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Metric Semantics for Probabilistic Relational Reasoning. CoRR abs/1807.05091 (2018) - 2017
- [c7]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, Ikram Cherigui:
A semantic account of metric preservation. POPL 2017: 545-556 - [i8]Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, Ikram Cherigui:
A Semantic Account of Metric Preservation. CoRR abs/1702.00374 (2017) - [i7]Arthur Azevedo de Amorim, Catalin Hritcu, Benjamin C. Pierce:
The Meaning of Memory Safety. CoRR abs/1705.07354 (2017) - [i6]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 abs/1710.07308 (2017) - 2016
- [j2]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): 689-734 (2016) - [j1]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: e4 (2016) - [c6]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: 45-60 - [c5]Arthur Azevedo de Amorim:
Binding Operators for Nominal Sets. MFPS 2016: 3-27 - [i5]Yannis Juglaret, Catalin Hritcu, Arthur Azevedo de Amorim, Benjamin C. Pierce:
Beyond Full Abstraction: Formalizing the Security Guarantees of Low-Level Compartmentalization. CoRR abs/1602.04503 (2016) - 2015
- [c4]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: 813-830 - [i4]Arthur Azevedo de Amorim, Emilio Jesús Gallego Arias, Marco Gaboardi, Justin Hsu:
Really Natural Linear Indexed Type Checking. CoRR abs/1503.04522 (2015) - [i3]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 abs/1509.06503 (2015) - [i2]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 abs/1510.00697 (2015) - 2014
- [c3]Arthur Azevedo de Amorim, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu:
Really Natural Linear Indexed Type Checking. IFL 2014: 5:1-5:12 - [c2]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: 165-178 - [i1]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 abs/1409.0393 (2014) - 2013
- [c1]Catalin Hritcu, John Hughes, Benjamin C. Pierce, Antal Spector-Zabusky, Dimitrios Vytiniotis, Arthur Azevedo de Amorim, Leonidas Lampropoulos:
Testing noninterference, quickly. ICFP 2013: 455-468
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
