Toward Semantically-Seeded, Graph-Propagated Impact Analysis Across Software Artifacts: A Vision

• URL: http://arxiv.org/abs/2606.18855v1
• Date: Wed, 17 Jun 2026 09:34:56 GMT
• Title: Toward Semantically-Seeded, Graph-Propagated Impact Analysis Across Software Artifacts: A Vision
• Abstract summary: We argue for a training-free and interpretable analyzer that fuses both signals over the same embeddings.<n>A small but complete proof-of-concept on a payment subsystem labelled change scenarios shows the mechanism we care about.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: When a single software artifact changes - a requirement, a configuration value, or a function - engineers must determine what else is impacted. Existing change-impact-analysis (CIA) tooling tends to rely on one of two signals in isolation: semantic similarity recovered from text (information-retrieval traceability, code search, embeddings), or structural dependency following (call graphs, IDE "find usages", test-impact selection). Each has a characteristic blind spot. A semantically driven tool misses an impacted artifact whose text shares no vocabulary with the change; a structurally driven tool misses artifacts related in meaning but not joined by an edge, and most operate only over code rather than the Requirement-Config-Service-Test chain. We argue for a training-free and interpretable analyzer that fuses both signals over the same embeddings. We model the system as a heterogeneous artifact graph with typed edges recovered by static analysis, compute a semantic prior by cosine similarity to the changed artifact, propagate impact multi-hop with decay over a row-normalized propagation matrix, and blend the two with a single tunable weight lambda. A small but complete proof-of-concept on a payment subsystem (5 labelled change scenarios) shows the mechanism we care about: artifacts with zero textual overlap with the change are still recovered through propagation, and helper functions that propagation alone cannot reach are recovered through the semantic layer. The fusion is the only configuration that covers both blind spots, and lambda acts as an explicit precision/recall control. Drawing on four publicly documented production failures, we argue that the same formulation extends to operational artifacts (images, metrics, dashboards, data schemas) that code-only analysis cannot reach.

Related papers

• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• TraceViT: Grounded Trace Supervision for Visual Abstract Reasoning [5.703211775506213]
  We introduce TraceViT, a looped visual reasoner trained with semantically monotonic transformation chains.<n>TraceViT achieves 67.8% pass@2 on ARC-AGI-1 and 24.3% on ARC-AGI-2.
  arXiv  Detail & Related papers  (2026-07-31T16:09:44Z)
• Do Unified Multimodal Models Think in One Space? A Lens Through Cross-Branch Steering [7.62772056485722]
  We introduce emphcross-branch semantic steering, an intervention-based framework that extracts semantic directions from one branch and applies them to the other.<n>We show that steering vectors learned from the understanding branch can transfer to generation, enabling controllable image synthesis and improved semantic faithfulness.<n>Our results reveal that architectural unification does not guarantee semantic alignment, and establish cross-branch steering as a practical tool for probing multimodal representations.
  arXiv  Detail & Related papers  (2026-07-29T02:46:20Z)
• Semantic Drift in Bug Resolution: How Behavioral Signals Propagate from Reports to Tests and Patches [18.727291516223115]
  Desc2Fix is a framework for measuring semantic alignment between bug reports, triggering tests, and developer-written fixes.<n>We analyze 2,857 report-test-patch triplets from Defects4J and SWT-Bench using GPT-4o and DeepSeek-Chat.
  arXiv  Detail & Related papers  (2026-07-20T22:32:23Z)
• Tool-Call Dependency Structure is Linearly Decodable in LLM Agent Residual Streams [1.0971997884861282]
  LLM agents produce trajectories whose calls form a directed dependency graph.<n>Prior structural probes have targeted static code or chain-of-thought text, not an agent's run-time call graph.<n>A low-capacity edge probe on the residual stream of Qwen3-32B decodes the tool-call dependency graph.
  arXiv  Detail & Related papers  (2026-05-25T00:16:32Z)
• Dynamic analysis enhances issue resolution [53.50448142467294]
  DAIRA (Dynamic Analysis-enhanced Issue Resolution Agent) is an automated repair framework that embeds dynamic analysis into the agent's reasoning cycle.<n> Driven by a Test Tracing-Driven methodology, DAIRA utilizes lightweight monitors to extract critical runtime data.<n>When powered by Gemini 3 Flash Preview, DAIRA establishes a new state-of-the-art (SOTA) performance, achieving a 79.4% resolution rate on the SWE-bench Verified dataset.
  arXiv  Detail & Related papers  (2026-03-23T14:48:54Z)
• How a Bit Becomes a Story: Semantic Steering via Differentiable Fault Injection [1.690922615975256]
  This work investigates how low-level, bitwise perturbations (fault injection) can influence the semantic meaning of its generated descriptions.<n>In image captioning models, a single flipped bit might subtly alter how visual features map to words, shifting the entire narrative an AI tells about the world.<n>We design a differentiable fault analysis framework, BLADE, that uses gradient-based sensitivity estimation to locate semantically critical bits.
  arXiv  Detail & Related papers  (2025-12-09T04:04:19Z)
• Octree Latent Diffusion for Semantic 3D Scene Generation and Completion [2.8992197334880268]
  We develop a single framework that can perform scene completion, extension, and generation in both indoor and outdoor scenes.<n>Our approach operates directly on an efficient dual octree graph latent representation.<n>We demonstrate highquality structure, coherent semantics, and robust completion from single LiDAR scans.
  arXiv  Detail & Related papers  (2025-09-20T00:53:13Z)
• Detect Changes like Humans: Incorporating Semantic Priors for Improved Change Detection [52.62459671461816]
  This paper explores incorporating semantic priors from visual foundation models to improve the ability to detect changes.<n>Inspired by the human visual paradigm, a novel dual-stream feature decoder is derived to distinguish changes by combining semantic-aware features and difference-aware features.
  arXiv  Detail & Related papers  (2024-12-22T08:27:15Z)
• Evaluating Semantic Variation in Text-to-Image Synthesis: A Causal Perspective [50.261681681643076]
  We propose a novel metric called SemVarEffect and a benchmark named SemVarBench to evaluate the causality between semantic variations in inputs and outputs in text-to-image synthesis.<n>Our work establishes an effective evaluation framework that advances the T2I synthesis community's exploration of human instruction understanding.
  arXiv  Detail & Related papers  (2024-10-14T08:45:35Z)
• TRIAD: Automated Traceability Recovery based on Biterm-enhanced Deduction of Transitive Links among Artifacts [53.92293118080274]
  Traceability allows stakeholders to extract and comprehend the trace links among software artifacts introduced across the software life cycle. Most rely on textual similarities among software artifacts, such as those based on Information Retrieval (IR)
  arXiv  Detail & Related papers  (2023-12-28T06:44:24Z)
• AutoPruner: Transformer-Based Call Graph Pruning [7.319973664340497]
  We present a novel call graph pruning technique, AutoPruner, for eliminating false positives in call graphs via both statistical semantic and structural analysis. Our empirical evaluation on a benchmark dataset of real-world programs shows that AutoPruner outperforms the state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-09-07T15:35:28Z)
• Mitigating Generation Shifts for Generalized Zero-Shot Learning [52.98182124310114]
  Generalized Zero-Shot Learning (GZSL) is the task of leveraging semantic information (e.g., attributes) to recognize the seen and unseen samples, where unseen classes are not observable during training. We propose a novel Generation Shifts Mitigating Flow framework for learning unseen data synthesis efficiently and effectively. Experimental results demonstrate that GSMFlow achieves state-of-the-art recognition performance in both conventional and generalized zero-shot settings.
  arXiv  Detail & Related papers  (2021-07-07T11:43:59Z)

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.