Yannick Zakowski

Orcid: 0000-0003-4585-6470

According to our database1, Yannick Zakowski authored at least 21 papers between 2017 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
HELIX: Verified compilation of cyber-physical control systems to LLVM IR.
CoRR, April, 2026

Layers of Confluence for Actors.
Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2026

2025
Structural Temporal Logic for Mechanized Program Verification.
Proc. ACM Program. Lang., 2025

Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq.
J. Funct. Program., 2025

Front Matter, Table of Contents, Preface, Conference Organization.
Dagstuhl Artifacts Ser., 2025

Artifact Report: an Abstract, Certified Account of Operational Game Semantics.
Proceedings of the Programming Languages and Systems, 2025

An abstract, certified account of operational game semantics.
Proceedings of the Programming Languages and Systems, 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
Abstract Interpreters: A Monadic Approach to Modular Verification.
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

A Two-Phase Infinite/Finite Low-Level Memory Model.
CoRR, 2024

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...