arXiv (All)
open access
SLED-IFV: Solver-Validated LLM-Guided Decomposition for Scalable Hardware Information-Flow Verification
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 dom
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
- SLED-IFV: Solver-Validated LLM-Guided Decomposition for Scalable Hardware Information-Flow Verification#1043032
- State-Separation and Hybrid Argument for Circuit Lower Bounds: A Structural Approach Toward P̸=NP#101306
- CHARGE: Leveraging CWE Hierarchies for Hardware Security SystemVerilog Assertion Generation#414049
- Deception as Computational Drag: Why False-State Coordination Becomes Structurally Expensive Over Time#693145
- MIPSBLEED: Uncovering Microarchitectural Timing Leaks in Pervasive Embedded Processors#280110
Record · ID 1061274
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