CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◬ AI & Machine Learning Jun 25, 2026

Information flow security on persistent memory

arXiv Security Archived Jun 25, 2026 ✓ Full text saved

arXiv:2606.25422v1 Announce Type: cross Abstract: Persistent memory is a recently proposed memory paradigm that delivers many system-wide benefits, including improved runtime efficiency and the ability of programs to recover from power outages and system crashes. While recent research has investigated techniques for proving functional correctness of programs running on related architectures, this is not the case for the orthogonal concept of information flow security. In this paper, we provide a

Full text archived locally
✦ AI Summary · Claude Sonnet


    Computer Science > Logic in Computer Science [Submitted on 24 Jun 2026] Information flow security on persistent memory Graeme Smith Persistent memory is a recently proposed memory paradigm that delivers many system-wide benefits, including improved runtime efficiency and the ability of programs to recover from power outages and system crashes. While recent research has investigated techniques for proving functional correctness of programs running on related architectures, this is not the case for the orthogonal concept of information flow security. In this paper, we provide an information flow logic for an unstructured language (i.e., with gotos rather than loops) modelling a simple assembly language. We apply this logic to x86 assembly using a notion of reordering interference freedom (rif) to reason about potential out-of-order propagation of instructions to memory. We then show how this same notion of rif can be used to similarly reason about information flow on persistent memory. Subjects: Logic in Computer Science (cs.LO); Cryptography and Security (cs.CR); Programming Languages (cs.PL) Cite as: arXiv:2606.25422 [cs.LO]   (or arXiv:2606.25422v1 [cs.LO] for this version)   https://doi.org/10.48550/arXiv.2606.25422 Focus to learn more Submission history From: Graeme Smith [view email] [v1] Wed, 24 Jun 2026 05:31:13 UTC (62 KB) Access Paper: HTML (experimental) view license Current browse context: cs.LO < prev   |   next > new | recent | 2026-06 Change to browse by: cs cs.CR cs.PL References & Citations NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Security
    Category
    ◬ AI & Machine Learning
    Published
    Jun 25, 2026
    Archived
    Jun 25, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗