Formal verification of thread safety and reentrancy

Establish formal thread-safety and reentrancy guarantees for the CompProv computation-context layer across arbitrary usage patterns and concurrent execution scenarios.

Background

The CompProv computation-context layer uses immutable variable and operation nodes so that concurrent threads can append graph nodes without invalidating previously recorded state or requiring a global lock. A four-thread execution benchmark showed scaling comparable to native execution for the tested workload, but the authors explicitly distinguish this empirical observation from a formal guarantee. The unresolved problem is therefore to verify thread safety and reentrancy beyond the specific concurrency pattern evaluated in the paper.

References

A 4-threaded execution benchmark (Section~\ref{Subsec: complexity}) shows that wrapped execution scales in line with native execution under this workload, which is consistent with this design rationale; that benchmark measures throughput under one concurrency pattern, however, and does not by itself constitute formal verification of thread safety or reentrancy across arbitrary usage patterns, which remains a direction for future work.

— CompProv Produces Machine Readable Graphs Encoding Microscopic Algebraic Provenance for Reproducible Computation  (2610.01203 - Abramyan et al., 1 Oct 2026) in Section 3, CompProv Architecture: Microscopic Provenance Capture and Deterministic Replay