Get started
Author

Egor Namakonov

Observed names: Namakonov, Egor, Namakonov, Egor Sergeevich; id_orcid 0000-0002-7517-9389
Institution: Aarhus University
ORCID: 0000-0002-7517-9389
Observed ORCID: 0000-0002-7517-9389
OpenAlex ID: A5075797889
Making weak memory models fair
2021 · Ori Lahav, Egor Namakonov, et al. · Proceedings of the ACM on Programming Languages · 21
PDF
The Java Pathfinder Workshop 2019
2020 · Cyrille Artho, Quoc-Sang Phan, et al. · ACM SIGSOFT Software Engineering Notes · 2
Artifact for the "Lawyer: Modular Obligations-Based Liveness Reasoning in Higher-Order Impredicative Concurrent Separation Logic" paper of OOPSLA'26
2026 · Namakonov, Egor, Fasse, Justus, et al. · Zenodo (CERN European Organization for Nuclear Research) · 1
Symbolic data race detection for Habanero programs
2019 · Egor Namakonov, Eric Mercer, et al. · ACM SIGSOFT Software Engineering Notes · 1
Modular verification of liveness properties in higher-order concurrent languages
2026 · Namakonov, Egor Sergeevich; id_orcid 0000-0002-7517-9389
PDF
Verifying wait-freedom for concurrent higher-order programs (Artifact)
2026 · Namakonov, Egor, Birkedal, Lars, et al. · Zenodo (CERN European Organization for Nuclear Research)
Lawyer: Modular Obligations-Based Liveness Reasoning in Higher-Order Impredicative Concurrent Separation Logic
2026 · Egor Namakonov, Justus Fasse, et al. · Proceedings of the ACM on Programming Languages
Verifying Wait-Freedom for Concurrent Higher-Order Programs (Artifact)
2026 · Namakonov, Egor, Birkedal, Lars, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Verifying Wait-Freedom for Concurrent Higher-Order Programs
2026 · Namakonov, Egor, Birkedal, Lars, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Works count: 11
Citation count: 25
H-index: 2
I10-index: 1
Year
Topic
Type