constant-time programming 1CT transparency 1decompilation 1side-channel attacks 1speculative execution 1static analysis 1
From the 1 of 2 linked papers with an AI index.
1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.PL2026★ 1 cited
Decompiling for Constant-Time Analysis
Santiago Arranz-Olmos, Gilles Barthe, Lionel Blatter +3
The paper investigates the reliability of the Decompile‑then‑Analyze (DtA) approach for verifying constant‑time (CT) security of compiled code, showing that existing decompilers ca…
cs.PL2024
SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations
Sören van der Wall, Roland Meyer
We address the problem of preserving non-interference across compiler transformations under speculative semantics. We develop a proof method that ensures the preservation uniformly…