Yannick Zakowski
Orcid: 0000-0003-4585-6470
According to our database1,
Yannick Zakowski
authored at least 15 papers
between 2017 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2017
2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
4
1
1
1
1
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Monadic Interpreters for Concurrent Memory Models: Executable Semantics of a Concurrent Subset of LLVM IR.
Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2025
2024
Proc. ACM Program. Lang., 2024
A Two-Phase Infinite/Finite Low-Level Memory Model: Reconciling Integer-Pointer Casts, Finite Space, and undef at the LLVM IR Level of Abstraction.
Proc. ACM Program. Lang., 2024
2023
Proc. ACM Program. Lang., January, 2023
2022
2021
Proc. ACM Program. Lang., 2021
2020
Proc. ACM Program. Lang., 2020
An equational theory for weak bisimulation via generalized parameterized coinduction.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020
2019
J. Autom. Reason., 2019
Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress).
CoRR, 2019
2018
Verified compilation of linearizable data structures: mechanizing rely guarantee for semantic refinement.
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018
2017
Verification of a Concurrent Garbage Collector. (Vérification d'un glaneur de cellules concurrent).
PhD thesis, 2017
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017