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

Korean

C와 같은 불안정한 언어로 구간화된 프로그램을 위한 기존 공식적으로 검증된 컴파일러의 보안 보장은 상당히 높은 수준에서 중지되며, 내장된 보호 메커니즘과 블록 기반 메모리 모델을 가정합니다. 구간 고립에 대한 구체적이고 낮은 수준의 집행 메커니즘을 검증하는 것은 여전히 현재의 증거 기술에 대한 주요 도전입니다. 특히 Abate et al.의 증거 기술은 그들의 증거 단계 중 하나인 recomposition이 기본적으로 각 구간의 코드에 대한 모든 정보를 숨길 필요가 있기 때문에 실패합니다. 우리는 구간이 서로의 코드를 완전히 관찰할 수 있는 낮은 수준의 설정으로 그들의 증거 기술을 확장할 것을 제안합니다. 이를 위해, 우리는 이러한 관찰을 미리 정의되지 않은

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