Andres Erbsen
Orcid: 0000-0002-9854-7500
According to our database1,
Andres Erbsen
authored at least 17 papers
between 2018 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
CoRR, September, 2025
Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs and Compilers.
Proc. ACM Program. Lang., 2025
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025
2024
J. Autom. Reason., September, 2024
Proc. ACM Program. Lang., 2024
2023
Proc. ACM Program. Lang., August, 2023
ACM Trans. Program. Lang. Syst., March, 2023
CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives.
Proc. ACM Program. Lang., 2023
Proceedings of the 45th IEEE/ACM International Conference on Software Engineering: ICSE 2023 Companion Proceedings, 2023
2022
Proc. ACM Program. Lang., 2022
CryptOpt: Verified Compilation with Random Program Search for Cryptographic Primitives.
CoRR, 2022
Relational compilation for performance-critical applications: extensible proof-producing translation of functional models into low-level code.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022
2021
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021
2019
Simple High-Level Code for Cryptographic Arithmetic - With Proofs, Without Compromises.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019
2018
Reification by Parametricity - Fast Setup for Proof by Reflection, in Two Lines of Ltac.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018