Almost-Sure Termination by Guarded Refinement

SO Gregersen, A Aguirre, PG Haselwarter… - Proceedings of the …, 2024 - dl.acm.org
Almost-sure termination is an important correctness property for probabilistic programs, and
a number of program logics have been developed for establishing it. However, these logics …

Verifying a C Implementation of Derecho's Coordination Mechanism Using VST and Coq

R Nagasamudram, L Beringer, K Birman… - NASA Formal Methods …, 2024 - Springer
Derecho is a C++ framework for distributed programming leveraging high performance
communication primitives such as RDMA. At its core is the shared state table (SST), a …

Reasoning about Weak Isolation Levels in Separation Logic

AA Mathiasen, L Gondelman, L Ducruet… - arXiv preprint arXiv …, 2025 - arxiv.org
Isolation levels, consistency guarantees among concurrently execution transactions in local-
and distributed systems, have been formalized in a number of models. Thus far, no model …

Expressive modular verification of termination for busy-waiting programs

J Fasse, B Jacobs - arXiv preprint arXiv:2312.15379, 2023 - arxiv.org
Busy-waiting is an important, low-level synchronization pattern that is used to implement
higher-level abstractions for synchronization. Its termination depends on cooperation by …

[PDF][PDF] Verifying Concurrent Systems Code

T Hance - 2024 - reports-archive.adm.cs.cmu.edu
Concurrent software is notoriously difficult to write correctly, so to increase confidence in it, it
is often desirable to apply formal verification techniques. One technique that is especially …

[PDF][PDF] Verifying Liveness Properties of Distributed Systems via Trace Refinement in Higher-Order Concurrent Separation Logic

JK HINRICHSEN, LÉO STEFANESCO, L BIRKEDAL… - jihgfee.github.io
Distributed systems are notoriously difficult to design, implement, and reason about. This is
especially true for liveness properties which state that a desired state of the system is …

[PDF][PDF] Coinductive Reasoning about CRDT Emulation

N Liittschwager, S Tsampas, J Castello, L Kuper - coalg.org
Conflict-free replicated data types (CRDTs) are distributed 6 data structures designed for
fault tolerance and high availability. CRDTs 7 have historically been taxonomized into …

[PDF][PDF] 非Step-Indexed な分離論理

松下祐介 - 2023 - kb.is.su-tokyo.ac.jp
Today, computer software is playing a remarkable role, and improving its quality and
robustness has become vital for the development and safety of society. For this purpose …