Yannick Zakowski

Orcid: 0000-0003-4585-6470

According to our database1, Yannick Zakowski authored at least 10 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq.
Proc. ACM Program. Lang., January, 2023

2022
Formal reasoning about layered monadic interpreters.
Proc. ACM Program. Lang., 2022

2021
Modular, compositional, and executable formal semantics for LLVM IR.
Proc. ACM Program. Lang., 2021

2020
Interaction trees: representing recursive and impure programs in Coq.
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
Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology.
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

Verifying a Concurrent Garbage Collector Using a Rely-Guarantee Methodology.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017


  Loading...