arXiv AI

PatchOptic for Shared-State LLM Workflows with Projected Views and Verified Structured Updates

arXiv:2607. 05483v1 Announce Type: cross Abstract: Agentic workflows often operate over shared, structured state.

arXiv Computation and Language
Sep 14

Local Edits, Global Ripples: Replay-Informed Policy Adaptation for Workflow Synthesis

The paper introduces RIPPLE, a method for adapting workflow-synthesizing agents through prompt-policy editing without retraining the underlying model. RIPPLE diagnoses failed execution trajectories, maps failures to specific policy segments, and restricts edits to those segments. It then evaluates candidate edits in isolation and replays only those that remain safe after composition, achieving up to a 23.1% improvement in validation success on a synthetic benchmark and positive gains on additional language‑model backbones.

By Manqing Mao, Hong Wang, Samson Koelle, Jie Yuan, Zhuoer Wang, James Feng, Yanjun Lin, Daniel Edmiston, Nikki Lijing Kuang, Zhecheng Sheng, Wei Niu
arXiv AI
Aug 26

When "Must" Becomes "Maybe": Constraint Weakening in LLM Agent Workflows

Large language model agents coordinate tasks via multi‑role, multi‑stage workflows that transform upstream state into intermediate artifacts such as summaries and plans. The study shows that when these artifacts are transformed—through compression, plan assimilation, or other handoff methods—the strict action‑binding constraints on upstream state can be weakened, turning mandatory requirements into optional information. In 1,296 synthetic episodes, direct handoff preserved all safety blockers, whereas transformed handoffs frequently deactivated or forbidden actions, but restoring full state fields or applying downstream verification can recover preservation.

By Yiheng Sun, Huifei Wang, Yancheng Zhu, Zhenyu Li, Zebin Zhao, Yifan Yuan
arXiv AI
4d ago

StateTape: Action-Conditioned Evidence Lifecycle Modeling for Long-Horizon Coding Agents

StateTape introduces a new framework for long‑horizon coding agents that rewrites the agent’s context as the code repository changes, rather than letting the context grow with every observation. It models the repository as a symbol‑level code graph, using a tape to mark symbols altered by each write and a manager model to resolve stale records. The authors provide theoretical analysis, a new benchmark called TraceBench, and empirical results showing higher resolve rates across six agents and three edit‑heavy benchmarks with minimal computational overhead.

By Ziyang Yu, Liang Zhao, Bowen Zhu, Hasibul Haque
arXiv AI
Sep 17

Symbolic Temporal Supervision of LLM Agents Using Contracts

ContrAgent is a contract‑based framework that provides symbolic temporal supervision for large language model agents. It records an agent’s tool‑call sequence as a trace of checkable predicates and formalizes desired behaviors with assume‑guarantee contracts expressed in linear temporal logic over finite traces (LTLf). Each contract is compiled into a deterministic finite automaton that both gates actions online and evaluates recorded traces offline, enabling deterministic, reproducible verdicts and significantly lower per‑call latency compared to existing LLM‑judge and rule‑based guardrail baselines.

By Yifeng Xiao, Pierluigi Nuzzo
arXiv AI
Sep 2

REVISE: Validity-Guided Recovery for Online Revisions in Agent Workflows

The paper introduces “Revise”, a runtime system that performs validity-guided, fine-grained recovery for online revisions in structured agent workflows. When a revision arrives, Revise intersects the change with recorded data and control dependencies, propagates the impact through the partially executed DAG, stops invalid work, preserves unaffected progress, and recomputes only the affected region. Experiments on real coding‑agent traces and LangGraph/LLMCompiler applications show that Revise matches a latest‑version oracle, reduces model calls by up to 56%, and improves service‑level objective goodput under load.

By Ruoling Qi, Xuaner Wu, Penghang Liu, Jian Chen, Yirui Liu
arXiv AI
2d ago

Revision-Aware Independent Agent Graphs for Dynamic Reasoning

The paper introduces Revision‑Aware Independent Agent Graphs (RIAG) to address dynamic task routing, where an event stream continually revises task bindings and a system must select the correct document version at query time. By repurposing six benchmarks into over 31,000 dynamic episodes, the authors demonstrate that RIAG balances recomputation and reuse, achieving 54.24 % joint routing‑and‑answer accuracy with only 0.62 calls per query—substantially better than the strongest baseline. The study highlights the trade‑off between stale conclusions and wasted work in dynamic reasoning settings.

By Yan Luo, Selim-Antoine Lali, Jeremy Moebel, Iliass Khoutaibi, Ahmadou Aidara, Mengyu Wang