Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Arthur Azevedo de Amorim"'
Publikováno v:
ESOP 2023-European Symposium on Programming
ESOP 2023-European Symposium on Programming, Apr 2023, Paris, France. ⟨10.48550/arXiv.2202.01901⟩
Programming Languages and Systems ISBN: 9783031300431
ESOP 2023-European Symposium on Programming, Apr 2023, Paris, France. ⟨10.48550/arXiv.2202.01901⟩
Programming Languages and Systems ISBN: 9783031300431
Program sensitivity measures the distance between the outputs of a program when run on two related inputs. This notion, which plays a key role in areas such as data privacy and optimization, has been the focus of several program analysis techniques i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdeb59aa716660e50bb648ea526b3161
https://hal.science/hal-03870966
https://hal.science/hal-03870966
Kleene algebra with tests (KAT) is a foundational equational framework for reasoning about programs, which has found applications in program transformations, networking and compiler optimizations, among many other areas. In his seminal work, Kozen pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcfa3982ffc60d3669128ae162799561
http://arxiv.org/abs/2108.07707
http://arxiv.org/abs/2108.07707
Publikováno v:
Formal Aspects of Component Software ISBN: 9783030906351
FACS
FACS
Automated analysis tools for cryptographic protocols can verify sophisticated designs, but lack compositionality. To address this limitation, we investigate the use of automata learning for verifying authentication protocols in an automatic and compo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9db9661575ba7a73f5135f4b9cb5f48
https://doi.org/10.1007/978-3-030-90636-8_1
https://doi.org/10.1007/978-3-030-90636-8_1
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030670665
VMCAI
VMCAI
We study the problem of using probabilistic network models to formally analyze their quantitative properties, such as the effect of different load-balancing strategies on the long-term traffic on a server farm. Compared to prior work, we explore a di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24855681fa112fa2957f1b7e90665ecd
https://doi.org/10.1007/978-3-030-67067-2_22
https://doi.org/10.1007/978-3-030-67067-2_22
Publikováno v:
LICS
One of the standard correctness criteria for gradual typing is the dynamic gradual guarantee, which ensures that loosening type annotations in a program does not affect its behavior in arbitrary ways. Though natural, prior work has pointed out that t
Autor:
Arthur Azevedo de Amorim
Publikováno v:
MFPS
The theory of nominal sets is a rich mathematical framework for studying syntax and variable binding. Within it, we can describe several binding disciplines and derive convenient reasoning principles that respect α-equivalence. In this article, we i
Publikováno v:
LICS
The Fuzz programming language by Reed and Pierce uses an elegant linear type system combined with a monad-like type to express and reason about probabilistic sensitivity properties, most notably $\varepsilon$ -differential privacy. We show how to ext
Autor:
Théo Laurent, Roberto Blanco, Arthur Azevedo de Amorim, Catalin Hritcu, Marco Stronati, Andrew Tolmach, Carmine Abate, Guglielmo Fachini, Benjamin C. Pierce, Ana Nora Evans
Publikováno v:
CCS
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security-CCS 18
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security -CCS '18
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security-CCS 18
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security -CCS '18
We propose a new formal criterion for evaluating secure compilation schemes for unsafe languages, expressing end-to-end security guarantees for software components that may become compromised after encountering undefined behavior---for example, by ac
Publikováno v:
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages.
Program sensitivity measures how robust a program is to small changes in its input, and is a fundamental notion in domains ranging from differential privacy to cyber-physical systems. A natural way to formalize program sensitivity is in terms of metr
Publikováno v:
29th IEEE Symposium on Computer Security Foundations (CSF)
29th IEEE Symposium on Computer Security Foundations (CSF), 2016, Lisabon, Portugal. pp.45--60, ⟨10.1109/CSF.2016.11⟩
CSF
29th IEEE Symposium on Computer Security Foundations (CSF), 2016, Lisabon, Portugal. pp.45--60, ⟨10.1109/CSF.2016.11⟩
CSF
Compartmentalization is good security-engineering practice. By breaking a large software system into mutually distrustful components that run with minimal privileges, restricting their interactions to conform to well-defined interfaces, we can limit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07491133ff449ffd069dcc1457698deb
https://hal.archives-ouvertes.fr/hal-01424795
https://hal.archives-ouvertes.fr/hal-01424795