LATIDIA · Ciberseguridad

SLED-IFV: Descomposición guiada por LLM validada por el solucionador para la verificación de flujo de información de hardware escalable

arXiv: 2609.25637v1Tipo de anuncio: nuevo Resumen: La verificación formal del flujo de información (IFV) del hardware proporciona fuertes garantías contra el comportamiento de control y tiempo dependiente del secreto, pero a menudo se escala mal en RT realista

La noticia

arXiv:2609.25637v1 Announce Type: new Abstract: Formal hardware information-flow verification (IFV) provides strong guarantees against secret-dependent timing and control behavior, but often scales poorly on realistic RTL. We identify two recurring proof barriers in self-composed IFV: implementation complexity, where proof-hard datapath logic dominates even though the property needs only a compact boundary relation, and relational inductive complexity, where the proof depends on cross-copy public-control facts that the backend prover does not infer efficiently. To address them, we introduce two semantic proof decomposition forms: functional simplification, which replaces a proof-hard RTL region with a validated over-approximate summary, and relational strengthening, which exposes and proves the cross-copy relations needed for induction. We further