arXiv (All)
open access
Episodic Loops: Finitary Event Structures and Operational Semantics for C11 Programs with Retries
Lock-free synchronisation algorithms are often implemented with fallible operations, such as compare-and-swap (CAS), wrapped in unbounded retry loops. Verifying such algorithms requires considering arbitrarily many failing iterations, yielding large state spaces, compounded by the interleavings of c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An automatic C-code instrumentation framework for high level algorithmic complexity analysis and system design#445184
- Metamorphic Testing of Transpilers via Mutation Consistency of Programs#422323
- 45 CFR Part 1302 — Program Operations#510470
- A methodology for designing and using a hardware system specification environment#445092
- Designing a Producer-driven Stream Protocol by Formal Refinement#1118886
Record · ID 1128908
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive