A Modular Framework for Stack-Heap and Value Abstractions (Extended Version)

• URL: http://arxiv.org/abs/2607.15932v1
• Date: Fri, 17 Jul 2026 13:18:18 GMT
• Title: A Modular Framework for Stack-Heap and Value Abstractions (Extended Version)
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Advanced static program analysis requires reasoning on the semantics of non-trivial program behaviors (e.g., pointers and complex data structures such as lists and sets, functions, and objects) and how they affect the memory. In most programming languages, static and dynamic allocations are typically managed by the stack and the heap, respectively. However, how allocations behave and how the memory is managed at runtime can vary significantly depending on the programming language being analyzed. Proper handling of these aspects is essential, as an accurate memory model enables the detection of critical issues such as buffer overflows and underflows, use-after-free errors, and null pointer exceptions prior to execution, that is, before such erroneous behaviors occur. In this paper, we propose and formalize a generic memory framework to handle stack and heap memory during the analysis, that is able to support various behaviors from different programming languages (e.g., C, C++, Java, and Python), while remaining parametric, allowing different memory and value analyses to be independently chosen and combined. It relies on the Abstract Interpretation theory and enables sound approximation of different memory models and program behaviors. We introduce a split state abstraction that separates value and memory analyses into two modular abstract domains. These domains interact through a set of memory identifiers, along with a set of operations defined by the domains to manipulate them, allowing the framework to capture both value information and structural memory relationships.

Related papers

• MemTools: A Unified Research Framework for Interoperable Agent Memory [35.007598094076485]
  We introduce MemTools, an interoperability research framework that decouples memory system components from their underlying deployment environments.<n>MemTools standardizes the memory lifecycle through declarative data contracts, enabling the interchangeable assembly of components across different systems.<n>MemTools provides a unified computational interface for coordinating symbolic, neural, and multimodal memory representations within a shared runtime.
  arXiv  Detail & Related papers  (2026-07-23T15:04:34Z)
• Information flow security on persistent memory [2.6905021039717987]
  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.
  arXiv  Detail & Related papers  (2026-06-24T05:31:13Z)
• 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)
• M$^\star$: Every Task Deserves Its Own Memory Harness [28.900347612231513]
  Large language model agents rely on specialized memory systems to accumulate and reuse knowledge during extended interactions.<n>Recent architectures typically adopt a fixed memory design tailored to specific domains, such as semantic retrieval for conversations or skills reused for coding.<n>We introduce M$star$, a method that automatically discovers task-optimized memory harnesses through program evolution.
  arXiv  Detail & Related papers  (2026-04-10T03:22:26Z)
• RMBench: Memory-Dependent Robotic Manipulation Benchmark with Insights into Policy Design [77.30163153176954]
  RMBench is a simulation benchmark comprising 9 manipulation tasks that span multiple levels of memory complexity.<n>Mem-0 is a modular manipulation policy with explicit memory components designed to support controlled ablation studies.<n>We identify memory-related limitations in existing policies and provide empirical insights into how architectural design choices influence memory performance.
  arXiv  Detail & Related papers  (2026-03-01T18:59:59Z)
• Graph-based Agent Memory: Taxonomy, Techniques, and Applications [63.70340159016138]
  Memory emerges as the core module in the Large Language Model (LLM)-based agents for long-horizon complex tasks.<n>Among diverse paradigms, graph stands out as a powerful structure for agent memory due to the intrinsic capabilities to model relational dependencies.<n>This survey presents a comprehensive review of agent memory from the graph-based perspective.
  arXiv  Detail & Related papers  (2026-02-05T13:49:05Z)
• AtomMem : Learnable Dynamic Agentic Memory with Atomic Memory Operation [40.1709026042412]
  We propose AtomMem, which reframes memory management as a dynamic decision-making problem.<n>By combining supervised fine-tuning with reinforcement learning, AtomMem learns an autonomous, task-aligned policy to orchestrate memory behaviors.<n> Experimental results across 3 long-context benchmarks demonstrate that the trained AtomMem-8B consistently outperforms prior static-workflow memory methods.
  arXiv  Detail & Related papers  (2026-01-13T08:22:28Z)
• LaMemo: Language Modeling with Look-Ahead Memory [50.6248714811912]
  We propose Look-Ahead Memory (LaMemo) that enhances the recurrence memory by incrementally attending to the right-side tokens. LaMemo embraces bi-directional attention and segment recurrence with an additional overhead only linearly proportional to the memory length. Experiments on widely used language modeling benchmarks demonstrate its superiority over the baselines equipped with different types of memory.
  arXiv  Detail & Related papers  (2022-04-15T06:11:25Z)
• Pin the Memory: Learning to Generalize Semantic Segmentation [68.367763672095]
  We present a novel memory-guided domain generalization method for semantic segmentation based on meta-learning framework. Our method abstracts the conceptual knowledge of semantic classes into categorical memory which is constant beyond the domains.
  arXiv  Detail & Related papers  (2022-04-07T17:34:01Z)
• Memory-Based Semantic Parsing [79.48882899104997]
  We present a memory-based model for context-dependent semantic parsing. We learn a context memory controller that manages the memory by maintaining the cumulative meaning of sequential user utterances.
  arXiv  Detail & Related papers  (2021-09-07T16:15:13Z)

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.