Arthur Azevedo de Amorim

Orcid: 0000-0001-9916-6614

According to our database1, Arthur Azevedo de Amorim authored at least 29 papers between 2013 and 2026.

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

2026
Reverse Online Guessing Attacks on PAKE Protocols.
CoRR, February, 2026

Cryptis: Cryptographic Reasoning in Separation Logic.
Proc. ACM Program. Lang., 2026

2025
Kleene Algebra with Commutativity Conditions Is Undecidable.
Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic, 2025

Memory Safety: Uniqueness as Separation.
Proceedings of the Programming Languages and Systems - 23rd Asian Symposium, 2025

2024
Pipelines and Beyond: Graph Types for ADTs with Futures.
Proc. ACM Program. Lang., January, 2024

Domain Reasoning in TopKAT.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

SECOMP: Formally Secure Compilation of Compartmentalized C Programs.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Bunched Fuzz: Sensitivity for Vector Metrics.
Proceedings of the Programming Languages and Systems, 2023

2022
On incorrectness logic and Kleene algebra with top and tests.
Proc. ACM Program. Lang., 2022

On Pitts' Relational Properties of Domains.
CoRR, 2022

2021
Netter: Probabilistic, Stateful Network Models.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2021

Learning Assumptions for Verifying Cryptographic Protocols Compositionally.
Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

2020
Reconciling noninterference and gradual typing.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Automating Compositional Analysis of Authentication Protocols.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

2019
Probabilistic Relational Reasoning via Metrics.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Metric Semantics for Probabilistic Relational Reasoning.
CoRR, 2018

The Meaning of Memory Safety.
Proceedings of the Principles of Security and Trust - 7th International Conference, 2018

When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Formally Secure Compilation of Unsafe Low-Level Components (Extended Abstract).
CoRR, 2017

A semantic account of metric preservation.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

2016
Testing noninterference, quickly.
J. Funct. Program., 2016

Binding Operators for Nominal Sets.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

Beyond Full Abstraction: Formalizing the Security Guarantees of Low-Level Compartmentalization.
CoRR, 2016

Beyond Good and Evil: Formalizing the Security Guarantees of Compartmentalizing Compilation.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
Towards a Fully Abstract Compiler Using Micro-Policies: Secure Compilation for Mutually Distrustful Components.
CoRR, 2015

Micro-Policies: Formally Verified, Tag-Based Security Monitors.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

2014
A verified information-flow architecture.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Really Natural Linear Indexed Type Checking.
Proceedings of the 26th 2014 International Symposium on Implementation and Application of Functional Languages, 2014

2013
Testing noninterference, quickly.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013


  Loading...