Newest papers

Blame-aware Recomposition for Secure Compilation Proofs of Low-Level Compartment Isolation

Basile Schlosser, Jérémy Thibault, Cătălin Hriţcu · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.26054 · cited by 0 works (OpenAlex) · open-access PDF

Japanese

C のような不安全な言語でパーティメント化されたプログラムのための既存の公式に検証されたコンパイラのセキュリティ保証はかなり高いレベルで停止し、組み込まれた保護メカニズムとブロックベースのメモリモデルを仮定します。 パーティメント隔離のための具体的、低レベルの執行メカニズムを検証することは、現在の証拠テクニックにとって依然として大きな課題です。 特に、Abate et al. の証拠テクニックは、彼らの証拠ステップの1つ、リコプションは、基本的に各パーティメントのコードに関するすべての情報を隠すことを必要とします。 低レベルで実現することは実用的ではありません。 我々は、彼らの証拠テクニックを低レベルの設定に拡張

Machine translation (Meta M2M100); the English original follows.

Abstract

The security guarantees of existing formally verified compilers for compartmentalized programs in unsafe languages like C stop at a rather high level, assuming a built-in protection mechanism and a block-based memory model. Verifying a concrete, low-level enforcement mechanism for compartment isolation is still a major challenge for current proof techniques. In particular, Abate et al.'s proof technique fails because one of their proof steps, recomposition, essentially requires hiding all information about the code of each compartment, which is not practically achievable at a low level. We propose an extension of their proof technique to a low-level setting where compartments can fully observe each other's code. To do so, we introduce an overlay semantics that allows us to characterize these observations as a form of undefined behaviour, and we use a novel variant of recomposition that we call blame-aware recomposition, which essentially allows recomposing executions as needed in the original high-level proof technique, even if the low-level context observes the code, because this context is ultimately going to be discarded. We apply this new proof to a compartment isolation mechanism that uses a programmable tag-based reference monitor.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Mathematical proof, Computer science, Context (archaeology), Isolation (microbiology), Operational semantics, Programming language

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.26054, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange