Information flow security on persistent memory

• URL: http://arxiv.org/abs/2606.25422v1
• Date: Wed, 24 Jun 2026 05:31:13 GMT
• Title: Information flow security on persistent memory
• Abstract summary: We provide an information flow logic for an unstructured language (i.e., with gotos rather than loops) modelling a simple assembly language.<n>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.
• Score: 2.6905021039717987
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 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.

Related papers

• StreamEMS: Streaming Video Understanding with Self-Evolving Memory Scheme for Vision-Language Models [14.764143801328759]
  We present StreamEMS, a general mechanism for improving streaming video understanding by re-structuring the historical data stored in memory.<n>We first introduce a Semantic Evolution Module to evolve the memory into more information-dense representations.<n>We further introduce a Prior-informed Evolution Module to evolve memory into more robust representations.
  arXiv  Detail & Related papers  (2026-08-28T03:41:53Z)
• A Modular Framework for Stack-Heap and Value Abstractions (Extended Version) [0.0]
  Advanced static program analysis requires reasoning on the semantics of non-trivial program behaviors.<n>In most programming languages, static and dynamic allocations are typically managed by the stack and the heap.<n>We propose and formalize a generic memory framework to handle stack and heap memory during the analysis.
  arXiv  Detail & Related papers  (2026-07-17T13:18:18Z)
• Memory is Reconstructed, Not Retrieved: Graph Memory for LLM Agents [51.30250860677378]
  We propose MRAgent, a framework that combines an associative memory graph with an active reconstruction mechanism.<n>Running on a Cue-Tag-Content graph, our active reconstruction mechanism integrates reasoning directly into memory access.<n>Experiments on the LoCoMo benchmark and LongMemEval benchmark demonstrate significant improvements over strong baselines.
  arXiv  Detail & Related papers  (2026-06-04T11:29:46Z)
• MemTrace: Tracing and Attributing Errors in Large Language Model Memory Systems [24.22940060094778]
  We study the new problem of error tracing and attribution in LLM memory systems.<n>We propose a novel framework that transforms memory pipelines into executable memory evolution graphs.<n>We then construct MemTraceBench, a benchmark collected from memory systems such as Long-Context, RAG, Mem0, and EverMemOS.
  arXiv  Detail & Related papers  (2026-05-27T16:53:53Z)
• MemGuard: Preventing Memory Contamination in Long-Term Memory-Augmented Large Language Models [56.31411457917676]
  We introduce MemGuard, a type-aware memory framework that preserves functional memory boundaries during memory construction and retrieval.<n>Across hallucination and long-horizon conversation benchmarks, MemGuard improves memory reliability by up to 28.27% while retrieving up to 5.8x fewer memory tokens than prior methods.
  arXiv  Detail & Related papers  (2026-05-27T06:04:19Z)
• MemCompiler: Compile, Don't Inject -- State-Conditioned Memory for Embodied Agents [29.872311031034368]
  We propose MemCompiler, which reframes memory utilization as State-Conditioned Memory Compilation.<n>Across Alf World, EmbodiedBench, and ScienceWorld, MemCompiler consistently improves over no-memory.
  arXiv  Detail & Related papers  (2026-05-08T11:07:04Z)
• Memory Transfer Learning: How Memories are Transferred Across Domains in Coding Agents [56.078070829341534]
  Memory-based self-evolution has emerged as a promising paradigm for coding agents.<n>We investigate textbfMemory Transfer Learning (MTL) by harnessing a unified memory pool from heterogeneous domains.
  arXiv  Detail & Related papers  (2026-04-15T15:50:29Z)
• FlashMem: Distilling Intrinsic Latent Memory via Computation Reuse [4.210760734549566]
  FlashMem is a framework that distills intrinsic memory directly from transient reasoning states via computation reuse.<n>Experiments demonstrate that FlashMem matches the performance of heavy baselines while reducing inference latency by 5 times.
  arXiv  Detail & Related papers  (2026-01-09T03:27:43Z)
• MemOS: A Memory OS for AI System [116.87568350346537]
  Large Language Models (LLMs) have become an essential infrastructure for Artificial General Intelligence (AGI)<n>Existing models mainly rely on static parameters and short-lived contextual states, limiting their ability to track user preferences or update knowledge over extended periods.<n>MemOS is a memory operating system that treats memory as a manageable system resource.
  arXiv  Detail & Related papers  (2025-07-04T17:21:46Z)
• Graceful forgetting: Memory as a process [0.0]
  A rational framework is proposed to explain how we accommodate sensory input within bounded memory.<n>The framework is intended as an aid to make sense of our extensive knowledge of memory, and bring us closer to an understanding of memory in functional and mechanistic terms.
  arXiv  Detail & Related papers  (2025-02-16T12:46:34Z)
• Constant Memory Attention Block [74.38724530521277]
  Constant Memory Attention Block (CMAB) is a novel general-purpose attention block that computes its output in constant memory and performs updates in constant computation. We show our proposed methods achieve results competitive with state-of-the-art while being significantly more memory efficient.
  arXiv  Detail & Related papers  (2023-06-21T22:41:58Z)
• Kanerva++: extending The Kanerva Machine with differentiable, locally block allocated latent memory [75.65949969000596]
  Episodic and semantic memory are critical components of the human memory model. We develop a new principled Bayesian memory allocation scheme that bridges the gap between episodic and semantic memory. We demonstrate that this allocation scheme improves performance in memory conditional image generation.
  arXiv  Detail & Related papers  (2021-02-20T18:40:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.