A two-phase infinite/finite low-level memory model: Reconciling integer–pointer casts, finite space, and undef at the llvm ir level of abstraction
C Beck, I Yoon, H Chen, Y Zakowski… - Proceedings of the ACM …, 2024 - dl.acm.org
This paper provides a novel approach to reconciling complex low-level memory model
features, such as pointer--integer casts, with desired refinements that are needed to justify …
features, such as pointer--integer casts, with desired refinements that are needed to justify …
[PDF][PDF] A concurrency model based on monadic interpreters: executable semantics for a concurrent subset of LLVM IR
N Chappe, L Henrio, Y Zakowski - 2024 - hal.science
In recent years, large-scale verification of industrial-strength software has become
increasingly 29 common [52] following the inspirational success of CompCert [38] in Coq, or …
increasingly 29 common [52] following the inspirational success of CompCert [38] in Coq, or …
[PDF][PDF] Choice Trees: Representing and Reasoning About Nondeterministic, Recursive, and Impure Programs in Coq (draft)
Abstract This paper introduces Choice Trees (CTrees), a monad for modeling
nondeterministic, recursive, and impure programs in Coq. Inspired by Xia et al.'s ITrees, this …
nondeterministic, recursive, and impure programs in Coq. Inspired by Xia et al.'s ITrees, this …