<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "http://jats.nlm.nih.gov/publishing/1.0/JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="1.0" article-type="other">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">Intell. Netw. Comput.</journal-id>
      <journal-id journal-id-type="publisher-id">inect</journal-id>
      <journal-title-group>
        <journal-title>Intelligent Networking and Computing</journal-title>
      </journal-title-group>
      <issn pub-type="epub"/>
      <publisher>
        <publisher-name>OAE Publishing Inc.</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.20517/inect.2026.13</article-id>
      <article-id pub-id-type="publisher-id">INECT-2026-13</article-id>
      <article-categories>
        <subj-group>
          <subject>Survey</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Architecture-level reliability in LLM-based agentic AI</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Ma</surname>
            <given-names>Xiaoyue</given-names>
          </name>
          <xref ref-type="aff" rid="I1">
            <sup>1</sup>
          </xref>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Wang</surname>
            <given-names>Jie</given-names>
          </name>
          <xref ref-type="aff" rid="I2">
            <sup>2</sup>
          </xref>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Zhang</surname>
            <given-names>Yunjian</given-names>
          </name>
          <xref ref-type="aff" rid="I3">
            <sup>3</sup>
          </xref>
          <xref ref-type="corresp" rid="cor1">*</xref>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Tian</surname>
            <given-names>Cong</given-names>
          </name>
          <xref ref-type="aff" rid="I4">
            <sup>4</sup>
          </xref>
          <xref ref-type="corresp" rid="cor1">*</xref>
        </contrib>
      </contrib-group>
      <aff id="I1"><sup>1</sup>Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Kowloon, Hong Kong 999077, China.</aff>
      <aff id="I2"><sup>2</sup>National Institute of Excellent Engineers, Guangzhou Institute of Technology, Xidian University, Guangzhou 510555, Guangdong, China.</aff>
      <aff id="I3"><sup>3</sup>Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China.</aff>
      <aff id="I4"><sup>4</sup>School of Computer Science and Technology, Xidian University, Xi’an 710071, Shaanxi, China.</aff>
      <author-notes>
        <corresp id="cor1">Correspondence to: Dr. Yunjian Zhang, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China. E-mail: <email>zhangyunjian17@mails.ucas.ac.cn</email>; Prof. Cong Tian, School of Computer Science and Technology, Xidian University, Xi’an 710071, Shaanxi, China. E-mail: <email>ctian@mail.xidian.edu.cn</email></corresp>
        <fn fn-type="other">
          <p><bold>Received:</bold> 24 Aug 2026 | <bold>First Decision:</bold> 11 Sep 2026 | <bold>Revised:</bold> 24 Sep 2026 | <bold>Accepted:</bold> 13 Oct 2026 | <bold>Published:</bold> 30 Oct 2026</p>
        </fn>
        <fn fn-type="other">
          <p><bold>Academic Editor:</bold> Jiawen Kang | <bold>Copy Editor:</bold> Shu-Yuan Duan | <bold>Production Editor:</bold> Shu-Yuan Duan </p>
        </fn>
      </author-notes>
      <pub-date pub-type="ppub">
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>30</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <volume>1</volume>
	  <issue>1</issue>
      <elocation-id>4</elocation-id>
      <permissions>
        <copyright-statement>© The Author(s) 2026.</copyright-statement>
        <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
          <license-p>© The Author(s) 2026.<bold>Open Access</bold>This article is licensed under a Creative Commons Attribution 4.0 International License (<uri xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</uri>), which permits unrestricted use, sharing, adaptation, distribution and reproduction in any medium or format, for any purpose, even commercially, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.</license-p>
        </license>
      </permissions>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>INTRODUCTION</title>
      <p>Large language model (LLM)-based agentic AI systems have rapidly emerged as a major paradigm for building autonomous and semi-autonomous artificial intelligence (AI) applications, as reflected in agent frameworks, developer toolkits, and deployment guidance<sup>[<xref ref-type="bibr" rid="B1">1</xref>-<xref ref-type="bibr" rid="B3">3</xref>]</sup>. Application research also includes agentic formal-specification generation and proposed multi-agent requirements-to-code workflows<sup>[<xref ref-type="bibr" rid="B4">4</xref>,<xref ref-type="bibr" rid="B5">5</xref>]</sup>. In this survey, we use <italic>LLM-based agentic AI systems</italic> to refer to systems built around LLM agent frameworks that support long-horizon decision-making, state or memory management, tool-mediated execution, environment feedback, and, in some cases, multi-agent coordination. Unlike single-turn prompting systems, these systems operate over extended horizons through iterative reasoning and acting, persistent state, and interaction with external tools and environments<sup>[<xref ref-type="bibr" rid="B3">3</xref>,<xref ref-type="bibr" rid="B6">6</xref>,<xref ref-type="bibr" rid="B7">7</xref>]</sup>. Such capabilities enable applications ranging from web and computer-use automation to multi-agent collaboration and tool-mediated actions<sup>[<xref ref-type="bibr" rid="B8">8</xref>,<xref ref-type="bibr" rid="B9">9</xref>]</sup>. Yet these same properties make reliability a central deployment challenge: failures can accumulate over long horizons, propagate across components, and become difficult to attribute or recover from<sup>[<xref ref-type="bibr" rid="B9">9</xref>-<xref ref-type="bibr" rid="B11">11</xref>]</sup>.</p>
      <p>Across LLM-based agentic AI systems, prior studies have identified several recurring forms of reliability failure. The evidence includes goal drift in extended interactions<sup>[<xref ref-type="bibr" rid="B12">12</xref>]</sup>, tool-invocation failures<sup>[<xref ref-type="bibr" rid="B13">13</xref>]</sup>, limited error recovery through self-critique<sup>[<xref ref-type="bibr" rid="B14">14</xref>]</sup>, and framework bugs<sup>[<xref ref-type="bibr" rid="B15">15</xref>]</sup>. ToolHijacker studies adversarial manipulation through tool documentation<sup>[<xref ref-type="bibr" rid="B16">16</xref>]</sup>, while Qu <italic>et al.</italic> organize the broader tool-learning pipeline<sup>[<xref ref-type="bibr" rid="B17">17</xref>]</sup>. We synthesize these findings into control drift, state inconsistency, silent execution errors, and ineffective self-correction. Prior work has begun to document and categorize failures in tool-augmented and multi-agent LLM systems, but these accounts are often scoped to particular tasks, modules, or threat models, such as tool invocation, long-horizon planning, multi-agent coordination, or prompt injection. This motivates our organizing question: which architectural conditions can connect similar breakdowns across otherwise different LLM agent frameworks?</p>
      <p>Existing surveys organize agent construction, applications, and evaluation<sup>[<xref ref-type="bibr" rid="B3">3</xref>]</sup> or develop taxonomies of agent evaluation objectives and processes<sup>[<xref ref-type="bibr" rid="B18">18</xref>,<xref ref-type="bibr" rid="B19">19</xref>]</sup>. Durante <italic>et al.</italic> examine multimodal agents that connect perception and embodied action in physical and virtual environments<sup>[<xref ref-type="bibr" rid="B20">20</xref>]</sup>. Here, the central question is how reliability requirements are preserved, violated, observed, and enforced across architectural interfaces. <xref ref-type="table" rid="t1">Table 1</xref> relates this focus to the organizing emphases of those surveys.</p>
      <table-wrap id="t1">
        <label>Table 1</label>
        <caption>
          <p>Comparison of related surveys on LLM-based agents</p>
        </caption>
        <table frame="hsides" rules="groups">
  <tbody>
    <tr>
      <td>
        <bold>Survey</bold>
      </td>
      <td>
        <bold>Organizing emphasis</bold>
      </td>
      <td>
        <bold>Connection to this synthesis</bold>
      </td>
    </tr>
    <tr>
      <td>Wang <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B3">3</xref>]</sup></td>
      <td>Agent construction, applications, and evaluation; architecture organized around profiling, memory, planning, and action</td>
      <td>Provides a component-level foundation for examining reliability premises, failure propagation, and interventions across interfaces</td>
    </tr>
    <tr>
      <td>Yehudai <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B18">18</xref>]</sup></td>
      <td>Capability, application, and generalist-agent evaluation; benchmark dimensions and evaluation frameworks, including stepwise and trajectory assessment</td>
      <td>Provides evaluation perspectives related to architectural premises, cross-layer failures, and the evidence needed to assess interventions</td>
    </tr>
    <tr>
      <td>Mohammadi <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B19">19</xref>]</sup></td>
      <td>Evaluation objectives and processes, including reliability, safety, tooling, and enterprise operating constraints</td>
      <td>Supplies complementary evaluation dimensions that this survey links to layer-specific evidence, architectural premises, and enforcement points</td>
    </tr>
    <tr>
      <td>Durante <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B20">20</xref>]</sup></td>
      <td>Multimodal interaction, embodied action, and learning in physical and virtual environments</td>
      <td>Provides an interaction perspective for examining the reliability of perception, action, and environmental feedback interfaces</td>
    </tr>
    <tr>
      <td>This survey</td>
      <td>Architecture-level reliability</td>
      <td>Connects layers and premises to failure propagation, observable evidence, and mechanism placement</td>
    </tr>
  </tbody>
</table>
        <table-wrap-foot>
          <fn id="t1FN1">
            <p>The comparison summarizes principal perspectives rather than exhaustive topic coverage.</p>
          </fn>
        </table-wrap-foot>
      </table-wrap>
      <p>This survey makes three contributions. First, it defines five architectural layers and four cross-cutting premises for analyzing reliability across control, state, execution, feedback, and oversight. Second, it distinguishes requirements, failure modes, observables, metrics, and oracles so that outcome success is not mistaken for evidence of correct intermediate behavior. Third, it connects mechanism families to their operational interfaces and uses cross-layer failure chains to derive four survey findings and a corresponding research agenda. These contributions connect reported evidence to architectural requirements and their evaluation boundaries.</p>
      <p>The survey begins with the architectural model and research questions, followed by reliability definitions and recurring failure modes. It then examines metrics, benchmarks, and evaluation validity before reviewing reliability mechanisms and their placement in agent pipelines. The subsequent architectural comparison connects interfaces, evaluation evidence, and mechanisms across layers. The discussion addresses open challenges, future directions, and threats to validity, followed by the conclusion.</p>
    </sec>
    <sec id="sec2">
      <title>ARCHITECTURAL MODEL AND RESEARCH QUESTIONS</title>
      <p>Building on the motivation above, this section defines the architectural model used throughout the survey and introduces the research questions that structure the analysis<sup>[<xref ref-type="bibr" rid="B3">3</xref>,<xref ref-type="bibr" rid="B6">6</xref>,<xref ref-type="bibr" rid="B21">21</xref>-<xref ref-type="bibr" rid="B23">23</xref>]</sup>. For the multi-step systems introduced in Section “<bold>INTRODUCTION</bold>”, reliability failures such as drift from intended control, inconsistent state, unreported tool errors, and ineffective self-correction have been documented in non-adversarial settings<sup>[<xref ref-type="bibr" rid="B9">9</xref>,<xref ref-type="bibr" rid="B12">12</xref>-<xref ref-type="bibr" rid="B14">14</xref>,<xref ref-type="bibr" rid="B24">24</xref>]</sup>. These recurring issues point to structural causes that are not fully explained by isolated benchmarks or individual design patterns<sup>[<xref ref-type="bibr" rid="B18">18</xref>,<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B25">25</xref>]</sup>. The analysis distinguishes five functional layers and four cross-cutting premises. Layers locate decisions, state, execution, feedback, and oversight; premises specify the conditions needed to preserve reliability across their interfaces.</p>
      <sec id="sec2-1">
        <title>Five-layer architectural model</title>
        <p>To analyze reliability across heterogeneous agent frameworks, we abstract LLM agent frameworks into five architectural layers: <italic>decision/control</italic>, <italic>state/memory</italic>, <italic>action/execution</italic>, <italic>environment/feedback</italic>, and <italic>governance/monitoring</italic>. This abstraction is not intended to prescribe a specific implementation. Rather, it provides an analytical model for comparing how failures arise, propagate, are measured, and are mitigated across different LLM-based agentic AI systems.</p>
        <p><bold>Decision/control layer.</bold> This layer determines what the agentic system should do next. It includes goal interpretation, task decomposition, planning, reasoning, policy selection, and action selection. Failures at this layer include goal drift, instruction misinterpretation, unsafe planning, incorrect tool selection, and deviation from user or system constraints.</p>
        <p><bold>State/memory layer.</bold> This layer maintains information across steps. It includes short-term task state, long-term memory, intermediate artifacts, retrieved context, shared multi-agent state, and summaries of previous interactions. Reliability failures arise when this state becomes stale, inconsistent, incomplete, hallucinated, or misaligned with the true environment.</p>
        <p><bold>Action/execution layer.</bold> This layer converts agent decisions into executable operations. It includes tool invocation, application programming interface (API) calls, code execution, workflow execution, external system interaction, and side-effectful actions. Failures at this layer include malformed calls, incorrect parameters, missed actions, partial execution, unreported tool errors, and unsafe side effects.</p>
        <p><bold>Environment/feedback layer.</bold> This layer captures observations returned from tools, users, external systems, simulators, or other agents. It determines how the system interprets execution results and updates its subsequent behavior. Failures include ignored feedback, misinterpreted tool outputs, delayed or partial observations, noisy environment signals, and recovery decisions based on incorrect feedback.</p>
        <p><bold>Governance/monitoring layer.</bold> This layer provides oversight over the agent loop. It includes runtime monitoring, policy enforcement, permission control, auditing, anomaly detection, logging, human intervention, rollback, and recovery mechanisms. Failures occur when monitors lack visibility, policies are incomplete, alerts are missed, or recovery mechanisms hide rather than resolve underlying faults.</p>
      </sec>
      <sec id="sec2-2">
        <title>Architectural premises and failure propagation</title>
        <p>Layers identify where a function operates; architectural premises identify what must hold for that function to remain reliable. We distinguish four premises that cut across the five layers [<xref ref-type="table" rid="t2">Table 2</xref>]. Semantic fidelity concerns whether a representation preserves task-relevant meaning. Instruction stability concerns whether valid goals and authority boundaries persist across steps. Observability concerns whether deviations leave accessible evidence. Recoverability concerns whether the system can reach an acceptable state after a detected deviation. These premises are analytical lenses, not guarantees supplied by natural-language reasoning.</p>
        <table-wrap id="t2">
          <label>Table 2</label>
          <caption>
            <p>Architectural premises, violation signals, and intervention points</p>
          </caption>
          <table frame="hsides" rules="groups">
  <tbody>
    <tr>
      <td>
        <bold>Premise</bold>
      </td>
      <td>
        <bold>Required property</bold>
      </td>
      <td>
        <bold>Violation signal</bold>
      </td>
      <td>
        <bold>Intervention</bold>
      </td>
    </tr>
    <tr>
      <td>Semantic fidelity</td>
      <td>Plans, memories, and tool arguments preserve relevant meaning and state</td>
      <td>A stored completion claim conflicts with the tool result</td>
      <td>Check state provenance and action postconditions⁠<sup>[<xref ref-type="bibr" rid="B9">9</xref>,<xref ref-type="bibr" rid="B34">34</xref>]</sup></td>
    </tr>
    <tr>
      <td>Instruction stability</td>
      <td>Authorized goals and constraints persist despite later content</td>
      <td>An external observation is followed as a new instruction</td>
      <td>Preserve instruction provenance and gate sensitive actions<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B59">59</xref>,<xref ref-type="bibr" rid="B60">60</xref>]</sup></td>
    </tr>
    <tr>
      <td>Observability</td>
      <td>Relevant events and effects can be inspected and linked</td>
      <td>A tool attempt has no recorded result or state transition</td>
      <td>Record returns, state versions, and correlated event identifiers<sup>[<xref ref-type="bibr" rid="B24">24</xref>,<xref ref-type="bibr" rid="B34">34</xref>,<xref ref-type="bibr" rid="B48">48</xref>]</sup></td>
    </tr>
    <tr>
      <td>Recoverability</td>
      <td>Detected errors have a feasible, permitted correction path</td>
      <td>A retry duplicates a side effect or exceeds its budget</td>
      <td>Use bounded retries, compensation, rollback, or escalation where supported<sup>[<xref ref-type="bibr" rid="B14">14</xref>,<xref ref-type="bibr" rid="B34">34</xref>,<xref ref-type="bibr" rid="B80">80</xref>]</sup></td>
    </tr>
  </tbody>
</table>
          <table-wrap-foot>
            <fn id="t2FN1">
              <p>The examples describe design requirements, not estimates of failure prevalence.</p>
            </fn>
          </table-wrap-foot>
        </table-wrap>
        <p>A premise violation can explain a failure only when the required evidence is available. A stale memory item may produce an incorrect plan, but the same plan may also result from misinterpreting a current observation. We therefore distinguish a plausible architectural explanation from an experimentally isolated cause. Controlled interventions and traces are needed to discriminate between such explanations. Section “<bold>Representative cross-layer failure chains</bold>” develops representative analytical chains that specify the originating layer, propagation path, detection signal, and possible interruption point.</p>
        <p>Reliability mechanisms protect different links in these chains. State validation addresses fidelity, pre-action policy checks address instruction stability, trace capture enables observability, and bounded repair or escalation supports recoverability. No single placement ensures all four premises: a monitor may observe a fault without authority to block it, while an action gate may prevent one unsafe call without repairing corrupted memory. This distinction connects the architectural model to the measurement dimensions in Section “<bold>OPERATIONALIZING AND MEASURING RELIABILITY</bold>” and the mechanism interfaces in Section “<bold>RELIABILITY MECHANISMS AND THEIR INTERFACES</bold>”.</p>
      </sec>
      <sec id="sec2-3">
        <title>Research questions and survey roadmap</title>
        <p>Based on this architectural model, this survey is organized around four research questions. The survey progresses from problem formulation, through measurement and mitigation, to a synthesis of architectural and evaluation design choices. This structure enables a premise-driven mapping from architectural layers to failure mechanisms, evaluation validity, and intervention points. <xref ref-type="table" rid="t3">Table 3</xref> summarizes the roadmap.</p>
        <table-wrap id="t3">
          <label>Table 3</label>
          <caption>
            <p>Research questions, scope, and contributions of the survey</p>
          </caption>
          <table frame="hsides" rules="groups">
  <tbody>
    <tr>
      <td>
        <bold>RQ</bold>
      </td>
      <td>
        <bold>Focus</bold>
      </td>
      <td>
        <bold>Analytical scope</bold>
      </td>
      <td>
        <bold>Synthesis contribution</bold>
      </td>
    </tr>
    <tr>
      <td>1</td>
      <td>Definitions and scope</td>
      <td>Reliability constructs, recurring failure modes, deployment scenarios, task boundaries, architectural layers, and premise-to-failure mappings<sup>[<xref ref-type="bibr" rid="B3">3</xref>,<xref ref-type="bibr" rid="B9">9</xref>,<xref ref-type="bibr" rid="B25">25</xref>,<xref ref-type="bibr" rid="B26">26</xref>]</sup></td>
      <td>A normalized vocabulary and scope, a catalog of representative failure scenarios, and a mapping from observed failures to architectural assumptions that supports cross-paper comparison</td>
    </tr>
    <tr>
      <td>2</td>
      <td>Measurement and validity</td>
      <td>Metrics, operational definitions, benchmarks, datasets, gold standards, evaluation protocols, observability, ground truth construction, biases, and validity threats<sup>[<xref ref-type="bibr" rid="B18">18</xref>,<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B25">25</xref>,<xref ref-type="bibr" rid="B48">48</xref>]</sup></td>
      <td>A structured catalog of evaluation practices, guidance for cross-benchmark comparability, analysis of bias and validity threats, and recommendations for protocol design and generalization claims</td>
    </tr>
    <tr>
      <td>3</td>
      <td>Mitigation paradigm mapping</td>
      <td>Solution taxonomies, prompting and planning strategies, memory mechanisms, tool execution safeguards, runtime monitoring, verification techniques, required signals, input/output interfaces, and integration patterns<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B33">33</xref>,<xref ref-type="bibr" rid="B34">34</xref>,<xref ref-type="bibr" rid="B59">59</xref>]</sup></td>
      <td>A taxonomy of reliability interventions, a pipeline-level placement map, the signals and interfaces required by each intervention type, and trade-offs in cost, latency, robustness, and brittleness</td>
    </tr>
    <tr>
      <td>4</td>
      <td>Architectural comparison</td>
      <td>Architectural responsibilities, evaluation evidence, mitigation interfaces, and their reliability implications⁠<sup>[<xref ref-type="bibr" rid="B3">3</xref>,<xref ref-type="bibr" rid="B6">6</xref>,<xref ref-type="bibr" rid="B7">7</xref>,<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B34">34</xref>]</sup></td>
      <td>A comparison of architectural and evaluation design choices, their motivations, and the reliability obligations introduced by additional interfaces</td>
    </tr>
  </tbody>
</table>
<table-wrap-foot>
            <fn id="t3FN1">
              <p>RQ: Research question.</p>
            </fn>
          </table-wrap-foot>
        </table-wrap>
        <p>RQ1 examines how reliability is defined and operationalized across LLM agent frameworks, including how recurring failures are named, scoped, and mapped to architectural premises. RQ2 studies how reliability is measured through metrics, benchmarks, datasets, oracles, and protocol design, with particular attention to observability and validity threats. RQ3 organizes reliability mechanisms by solution paradigm, pipeline placement, required signals, and input/output interfaces. RQ4 compares how architectural choices change reliability requirements, evaluation evidence, and mitigation interfaces.</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>FAILURE MODES AND RELIABILITY CONSTRUCTS IN LLM AGENT FRAMEWORKS</title>
      <p>The literature on LLM agents shows substantial variation in how failure modes and reliability constructs are named, scoped, and operationalized. Existing studies offer tool-specific failure taxonomies, system-level conceptual taxonomies, multidimensional reliability profiles, and empirical red-team catalogs<sup>[<xref ref-type="bibr" rid="B25">25</xref>-<xref ref-type="bibr" rid="B28">28</xref>]</sup>. Reliability is consequently measured through different observables, including task outcomes, consistency across runs, tool-execution validity, policy conformance, and recovery behavior<sup>[<xref ref-type="bibr" rid="B25">25</xref>,<xref ref-type="bibr" rid="B26">26</xref>,<xref ref-type="bibr" rid="B29">29</xref>]</sup>. This diversity reflects the rapid evolution of the field, but it also makes cross-paper comparison difficult without shared constructs and observables.</p>
      <sec id="sec3-1">
        <title>Failure modes and reliability constructs</title>
        <p>Reliability analysis requires two linked vocabularies: one for evaluating behavior and one for explaining how it breaks down. A <italic>reliability construct</italic> is a property of interest, such as functional correctness, state consistency, policy conformance, or recoverability. A <italic>requirement</italic> makes that property concrete for a task and operating condition. A <italic>failure</italic> is a violation of such a requirement, whether or not it is detected; detection requires observable evidence. A <italic>failure mode</italic> is a recurring pattern of violation, such as control drift or inconsistent state. These terms do not identify the cause on their own.</p>
        <p>A <italic>cause</italic> is a condition or event that contributes to a failure; an unmet architectural premise is a candidate explanation at the system-design level. A <italic>symptom</italic> is evidence that a failure may have occurred, such as contradictory messages. An <italic>observable</italic> is a recorded variable or event, such as tool return status or a state version. A <italic>metric</italic> summarizes specified observables under a scoring rule, such as the proportion of checked states that contradict an authoritative record. An <italic>oracle</italic> supplies the criterion used to judge those observations. Thus, control drift is a failure mode, while contradiction rate is a metric; neither term can replace the other.</p>
        <p>Consider an illustrative scheduling task. The construct is execution correctness, and the requirement is that a confirmed booking corresponds to an actual calendar event. A stored “booked” state without an event is a failure instance; repeated unsupported completion claims form a failure mode. An ignored API error is a possible cause, the mismatch between the confirmation and the absent event is a symptom, and the API return and calendar state are observables. The proportion of confirmed bookings lacking events is a metric evaluated against the calendar record. The full trace is needed to establish whether the fault arose in execution, feedback interpretation, or memory updating. This example is an analytical illustration, not an additional empirical finding.</p>
        <p>Several studies formalize failure naming schemes to support comparison. Winston and Just analyze tool-augmented LLMs and distinguish failures rooted in tool selection, tool use, and the surrounding augmentation pipeline<sup>[<xref ref-type="bibr" rid="B26">26</xref>]</sup>. Sapkota <italic>et al.</italic> distinguish AI agents from agentic AI at the system-concept level, emphasizing differences in autonomy, coordination, and operational scope<sup>[<xref ref-type="bibr" rid="B27">27</xref>]</sup>. By contrast, Bullwinkel <italic>et al.</italic> report empirical lessons from red teaming 100 generative AI products; their evidence broadens the catalog of observed safety and security failures but is not itself a tool-agent reliability taxonomy<sup>[<xref ref-type="bibr" rid="B28">28</xref>]</sup>. Together, these works show that comparisons require an explicit level of analysis and clearly specified observables.</p>
        <p>Safety- and security-oriented studies define reliability primarily through policy conformance. For example, tool-augmented and governance-oriented work emphasizes whether agent behavior remains within permitted control and execution boundaries<sup>[<xref ref-type="bibr" rid="B29">29</xref>-<xref ref-type="bibr" rid="B31">31</xref>]</sup>. This framing shifts the reliability question from whether the agent completes a task to whether it does so while respecting policies, constraints, and enforcement mechanisms.</p>
        <p>In multi-agent settings, reliability is often defined through state consistency, control agreement, and fault tolerance. Zheng <italic>et al.</italic> study robustness to erroneous messages and adversarial agents across multi-agent communication topologies, and propose confidence-probe-weighted Byzantine consensus<sup>[<xref ref-type="bibr" rid="B32">32</xref>]</sup>. Cemri <italic>et al.</italic> examine coordination breakdowns without assuming explicit attackers, highlighting inconsistent beliefs, misaligned objectives, and failures in shared task progress<sup>[<xref ref-type="bibr" rid="B9">9</xref>]</sup>. These studies show that small mismatches in shared state or intent can accumulate across agents and become difficult to diagnose.</p>
        <p>Other works emphasize execution validity in non-adversarial settings. Tool-use and runtime-enforcement studies focus on whether agents select appropriate actions, invoke tools correctly, surface errors, and respect execution constraints<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B33">33</xref>,<xref ref-type="bibr" rid="B34">34</xref>]</sup>. In these settings, reliability depends less on adversarial robustness and more on whether the agent follows the required process and produces valid execution traces.</p>
        <p>Long-horizon agents introduce an additional challenge because failures may remain latent before affecting final outcomes. This reframes reliability as timely detection and recovery, rather than only final task success. For example, an agent that repeatedly attempts the same invalid API call without adapting to error responses illustrates ineffective self-correction. Governance and monitoring frameworks address this problem by requiring visibility into agent behavior, enforceable constraints, and auditability<sup>[<xref ref-type="bibr" rid="B29">29</xref>-<xref ref-type="bibr" rid="B31">31</xref>]</sup>.</p>
        <p>Across these studies, each reliability framing corresponds to different failure modes and measurements. Tool-oriented taxonomies cover selection, invocation, and execution failures<sup>[<xref ref-type="bibr" rid="B13">13</xref>,<xref ref-type="bibr" rid="B26">26</xref>]</sup>. Safety and governance constructs emphasize constraint compliance and enforceable oversight<sup>[<xref ref-type="bibr" rid="B29">29</xref>-<xref ref-type="bibr" rid="B31">31</xref>]</sup>. Multi-agent robustness emphasizes coordination breakdowns, error propagation, and shared-state consistency<sup>[<xref ref-type="bibr" rid="B9">9</xref>,<xref ref-type="bibr" rid="B10">10</xref>]</sup>. Execution-centric work focuses on required-step completion, tool-call validity, and runtime enforcement<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B33">33</xref>,<xref ref-type="bibr" rid="B34">34</xref>]</sup>. This synthesis shows that “reliability” is not a single construct, but a family of related constructs tied to different architectural assumptions and evaluation signals.</p>
        <p>The surveyed sources offer different kinds of evidence rather than a single shared reliability measure. AgentSpec evaluates event-triggered constraints, Security Architecture for Governing Agentic systems (SAGA) implements user-controlled inter-agent access policies, and AGENTSAFE proposes lifecycle governance controls and a validation plan<sup>[<xref ref-type="bibr" rid="B29">29</xref>-<xref ref-type="bibr" rid="B31">31</xref>]</sup>. Their measurements or proposed indicators must therefore be interpreted against the property and implementation each source actually describes.</p>
        <p>Reliability in LLM agent frameworks is evaluated through diverse constructs, including functional correctness, robustness, safety and security, process compliance, policy conformance, and trajectory-level detectability. Because each construct implies different failure modes and measurements, explicit definitions are essential for meaningful cross-study comparison.</p>
      </sec>
      <sec id="sec3-2">
        <title>Representative cross-layer failure chains</title>
        <p>The following chains synthesize failure patterns discussed in the tool-use, coordination, and injection literature<sup>[<xref ref-type="bibr" rid="B9">9</xref>,<xref ref-type="bibr" rid="B26">26</xref>,<xref ref-type="bibr" rid="B35">35</xref>]</sup>. They are analytical examples, not reconstructed incidents or estimates of frequency. Their purpose is to show why the layer where a fault originates, the layer where harm occurs, and the point where a monitor can intervene need not coincide.</p>
        <p><bold>Chain A: stale state propagates through an unreported execution error.</bold> A memory entry records an obsolete resource identifier (state/memory). Planning treats it as current (decision/control), a tool call fails (action/execution), and a summary drops the error while retaining the intended action as completed (environment/feedback back to state/memory). A monitor that reads only the summary may then approve continuation (governance/monitoring). Semantic fidelity and observability are both at issue. State-version checks can expose the initial mismatch; correlating the tool return with the subsequent state update can expose propagation. A pre-action freshness check can interrupt the chain before execution, whereas post-action reconciliation can repair state without guaranteeing reversal of external effects.</p>
        <p><bold>Chain B: untrusted feedback acquires instruction authority.</bold> A retrieved page contains an instruction to transmit data (environment/feedback). The planner treats that content as authoritative (decision/control), stores the new instruction as a task requirement (state/memory), and invokes an external-transfer tool (action/execution). Governance fails if the gate checks only argument syntax. The initiating issue is loss of instruction stability; the terminal failure is a policy violation. Source provenance, changes in the active goal, and the destination of the proposed call provide complementary observables. An authority check or information-flow policy before execution can block the action, but stored malicious instructions must also be removed or isolated to prevent a later recurrence.</p>
        <p><bold>Chain C: an ambiguous result turns recovery into a new fault.</bold> A side-effectful operation succeeds externally, but its response times out (action/execution and environment/feedback). Memory records an unresolved attempt, and the planner retries without checking the external state (state/memory and decision/control). The retry creates a duplicate action, while a monitor records eventual completion as successful recovery (governance/monitoring). Observability and recoverability fail together: absence of an acknowledgment does not establish absence of an effect. Operation identifiers, external-state checks, and duplicate-effect counts can distinguish successful completion from safe recovery. Idempotent operations or compensating actions may interrupt this chain when the environment supports them; otherwise, escalation may be the only acceptable response.</p>
        <p><xref ref-type="fig" rid="fig1">Figure 1</xref> summarizes the three analytical chains, separating propagation from the observations and interventions that can expose or interrupt it. Across the three chains, effective diagnosis requires both a local check and a link to downstream state. A valid tool schema cannot establish that an action is authorized, a recorded error cannot ensure that the planner uses it, and eventual task success cannot establish that recovery was safe. These distinctions motivate separate measurements of failure incidence, detection, propagation, and recovery in the next section.</p>
        <fig id="fig1" position="float">
          <label>Figure 1</label>
          <caption>
            <p>Analytical cross-layer failure chains: (A) stale state, (B) instruction-authority violation, and (C) unsafe recovery. These schematics show possible propagation paths and intervention points, not measured incidents.</p>
          </caption>
          <graphic xlink:href="inect1013.fig.1.jpg"/>
        </fig>
      </sec>
    </sec>
    <sec id="sec4">
      <title>OPERATIONALIZING AND MEASURING RELIABILITY</title>
      <p>Reliability measurement connects task outcomes with evidence about the execution that produced them. Existing evaluations combine outcome scores with interaction assessment and operational measurements<sup>[<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B36">36</xref>]</sup>. We organize this evidence into four complementary scopes: outcome, process/state, execution, and monitoring. The following subsections examine the associated metrics, the evidence supplied by evaluation sources, and the protocols needed to interpret the resulting scores.</p>
      <sec id="sec4-1">
        <title>Reliability metrics and operational definitions</title>
        <p>Reliability metrics address four complementary scopes [<xref ref-type="fig" rid="fig2">Figure 2</xref>]: outcomes, process and state, execution, and monitoring. Outcome measures assess the requested result; process and state measures examine intermediate decisions and records; execution measures check calls and their effects; and monitoring measures assess detection and recovery. The relevant metric depends on the requirement being tested and the evidence available at that scope.</p>
        <fig id="fig2" position="float">
          <label>Figure 2</label>
          <caption>
            <p>Reliability concepts: (A) defining failure and (B) assessing observable evidence. The four measurement scopes distinguish outcome, process/state, execution, and monitoring; violations may remain unobserved.</p>
          </caption>
          <graphic xlink:href="inect1013.fig.2.jpg"/>
        </fig>
        <p>This measurement perspective is important because silent failures can occur before final task failure becomes visible. LLM-based agentic AI systems may generate plausible plans or state summaries while the underlying control or state has already diverged from correctness. For example, a system might present a coherent itinerary for booking a flight, yet rely on outdated seat availability, resulting in a plan that appears valid but fails during execution. The four measurement scopes separate the requested outcome from evidence about intermediate state, external execution, and monitoring.</p>
        <p>Outcome metrics summarize judged endpoints; in this survey, we distinguish that evidence from diagnosis of deviations that were corrected, hidden, or outside the final scoring criterion. MAESTRO evaluates multi-agent systems using accuracy, resource use, repeated executions, and observed execution behavior<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. Endpoint evaluation can also target harmful task completion. AgentHarm uses synthetic tools and task-specific grading criteria to measure completion of malicious requests, with LLM judgments restricted to narrow subtasks<sup>[<xref ref-type="bibr" rid="B37">37</xref>]</sup>. However, outcome scores alone rarely identify the layer where a failure occurred and may miss both earlier faults corrected before scoring and unresolved deviations outside the endpoint oracle’s coverage.</p>
        <p>Trajectory-level metrics provide deeper diagnostic insight by evaluating whether LLM agent frameworks make correct intermediate decisions and maintain consistent state. Step correctness and plan-following metrics probe the decision/control layer, while contradiction rates, stale-state usage, and invariant violations target the state/memory layer. MAESTRO examines stability through execution call graphs across runs<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. Contradiction rates, stale-state usage, and invariant violations are complementary measures proposed in this survey; they should not be read as metrics MAESTRO reports. Traces often reveal degradation patterns that are invisible in outcome metrics, and effective failure attribution depends on observability of intermediate reasoning and state transitions.</p>
        <p>Tool-use failure analyses motivate distinguishing selection, invocation, and execution problems at the action boundary<sup>[<xref ref-type="bibr" rid="B13">13</xref>,<xref ref-type="bibr" rid="B26">26</xref>]</sup>. For systems with retries or rollback, this survey additionally recommends recording those events and their effects. The failure categories reported by Winston and Just<sup>[<xref ref-type="bibr" rid="B26">26</xref>]</sup> and Huang <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B13">13</xref>]</sup> motivate checking tool selection and execution evidence separately from the agent’s verbal summary. In our analysis, a plausible response alone cannot establish that a required external action took place. Workflow-level evaluations extend this view by defining correct behavior as both reaching intended results and executing necessary steps under realistic feedback. This leads to metrics such as end-to-end execution success, retry and rollback counts, and stuckness rates, which connect execution to the environment/feedback layer.</p>
        <p>Recovery metrics are essential for characterizing operational reliability in frameworks that incorporate retries, rollbacks, and self-correction. Our synthesis recommends evaluating whether recovery restores the stated requirement, rather than counting eventual task completion alone. However, robust recovery mechanisms can mask frequent upstream errors, resulting in high task success despite repeated violations of control or state assumptions. Reporting should therefore separate fault incidence from recovery effectiveness, since consensus or recovery loops may improve observed outcomes without reducing underlying error rates.</p>
        <p>Safety and security requirements can be evaluated across these scopes, including harmful outcomes, unauthorized calls, and missed policy violations. InjecAgent measures whether malicious tool responses induce specified harmful calls or data-exfiltration sequences<sup>[<xref ref-type="bibr" rid="B35">35</xref>]</sup>. Attack success is inferred from parsed model outputs in simulated tool interactions, rather than verified side effects in a real external service. AgentHarm evaluates agents responding to directly harmful requests through synthetic tools; its completion scores are proxies for harmful behavior, not observations of real-world side effects<sup>[<xref ref-type="bibr" rid="B37">37</xref>]</sup>. Shen <italic>et al.</italic> analyze disclosed vulnerabilities, their root causes, and developers’ mitigation decisions in agent applications<sup>[<xref ref-type="bibr" rid="B38">38</xref>]</sup>. This evidence concerns the security of the application and its components; it is not a scalar runtime-reliability metric.</p>
        <p>Metrics assessing the detectability of failures are critical because language plausibility can conceal execution errors. MAESTRO foregrounds observability signals and instrumented traces for multi-agent testing and diagnosis<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. SecureFixAgent illustrates a narrower software-engineering case in which an LLM-driven repair loop is checked by repeated Bandit static-analysis scans<sup>[<xref ref-type="bibr" rid="B39">39</xref>]</sup>. This is evidence for analyzer-backed validation in code repair, not direct evidence that the same alert trade-offs have been established for general LLM-agent monitoring.</p>
        <p>Resource use is an operating condition to report alongside the four measurement scopes. Budget exhaustion, timeouts, and excessive retries can render otherwise correct systems unreliable in real-world settings. MAESTRO measures resource consumption alongside accuracy<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. For recovery-enabled workflows, we additionally recommend recording retries, rollbacks, stuckness, latency, and monitoring burden; these are proposed reporting dimensions, not a list of MAESTRO’s reported metrics. Together, these indicators allow evaluators to distinguish productive deliberation from unproductive correction loops and to avoid attributing resource-driven failures to reasoning quality alone.</p>
        <p>An endpoint score should be paired with the intermediate checks needed to detect the failure under study. For retrying systems, recording the original fault separately from the final outcome also distinguishes recovery from low failure incidence. </p>
        <p>Outcome, process/state, execution, and monitoring measures answer complementary questions. Their interpretation depends on the requirement checked and the evidence exposed at each scope.</p>
      </sec>
      <sec id="sec4-2">
        <title>Benchmarks, datasets, and gold standards for reliability analysis</title>
        <p>Benchmarks and datasets are central to evaluating LLM-based agentic AI systems because they define the oracle, circumscribe observable failure modes, and operationalize correctness within interactive loops<sup>[<xref ref-type="bibr" rid="B19">19</xref>]</sup>. In agentic settings, this dependence is heightened: evaluation is tied to a specific interaction protocol and stopping rule, so the meaningfulness of any metric is constrained by the supervision it encodes. MAESTRO combines repeated execution with resource, accuracy, and execution-structure measurements, showing the value of examining more than a terminal answer<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. As a result, reported success rates can obscure substantial differences in how benchmarks define oracles, which error types are detectable, and whether measured wins truly reflect correctness or merely correlate with it<sup>[<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B36">36</xref>]</sup>.</p>
        <p><xref ref-type="table" rid="t4">Table 4</xref> compares the task domains, evaluation evidence, and validity limits of representative studies. Oracle type identifies how a verdict is produced, such as an executable check, a state predicate, or human or model judgment. Fidelity concerns how well that verdict represents the target requirement, given its coverage, judgment error, and access to relevant state. These dimensions distinguish the procedure used to judge an execution from the validity of the resulting judgment.</p>
        <table-wrap id="t4">
          <label>Table 4</label>
          <caption>
            <p>Domains, evaluation evidence, and validity limits of representative studies</p>
          </caption>
          <table frame="hsides" rules="groups">
  <tbody>
    <tr>
      <td>
        <bold>Work</bold>
      </td>
      <td>
        <bold>Domain</bold>
      </td>
      <td>
        <bold>Evaluation evidence</bold>
      </td>
      <td>
        <bold>Validity limits</bold>
      </td>
    </tr>
    <tr>
      <td>Mohammadi <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B19">19</xref>]</sup></td>
      <td>Agent evaluation survey</td>
      <td>Taxonomy of evaluation objectives and processes</td>
      <td>N/A; this survey supplies the oracle-fidelity analysis</td>
    </tr>
    <tr>
      <td>MAESTRO (preprint)<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup></td>
      <td>Agent reliability and observability suite</td>
      <td>Repeated executions with traces, resource and accuracy measurements, and call-graph comparison</td>
      <td>Depends on task coverage, judge validity, and completeness of recorded events</td>
    </tr>
    <tr>
      <td>SecureFixAgent<sup>[<xref ref-type="bibr" rid="B38">39</xref>]</sup></td>
      <td>Secure code repair in Python</td>
      <td>Bandit static-analysis detection and revalidation</td>
      <td>Limited to vulnerabilities represented by the analyzer rules</td>
    </tr>
    <tr>
      <td>Shen <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B38">38</xref>]</sup></td>
      <td>Security debt in agent applications</td>
      <td>Vulnerability identification and mitigation trade-off analysis</td>
      <td>Depends on vulnerability criteria and the attack surfaces examined</td>
    </tr>
    <tr>
      <td>InjecAgent<sup>[<xref ref-type="bibr" rid="B35">35</xref>]</sup></td>
      <td>Indirect prompt injection benchmark</td>
      <td>Attack success criteria in tool-integrated settings</td>
      <td>Depends on attack coverage and validity of the success criteria</td>
    </tr>
    <tr>
      <td>AgentHarm<sup>[<xref ref-type="bibr" rid="B37">37</xref>]</sup></td>
      <td>Agent harmfulness benchmark</td>
      <td>Synthetic tools and task-specific grading functions; narrow LLM-judged subtasks</td>
      <td>Depends on task-rubric coverage and the simulated tools; no real-world side effects</td>
    </tr>
    <tr>
      <td>AgentAuditor<sup>[<xref ref-type="bibr" rid="B40">40</xref>]</sup></td>
      <td>Safety and security evaluation of agent interactions</td>
      <td>Memory-augmented LLM judgments checked against annotated safe/unsafe labels</td>
      <td>Depends on label interpretation, scenario coverage, and strict/lenient treatment of ambiguity</td>
    </tr>
  </tbody>
</table>
          <table-wrap-foot>
            <fn id="t4FN1">
              <p>Oracle type alone does not determine fidelity; judgments depend on the target requirement and coverage. LLM: Large language model.</p>
            </fn>
          </table-wrap-foot>
        </table-wrap>
        <p>API benchmarks expose different notions of correctness. ToolLLM combines the broad API inventory of ToolBench with model-judged pass and win rates; these scores depend on live API behavior, evaluator prompts, search budgets, and whether the relevant APIs are provided by an oracle retriever<sup>[<xref ref-type="bibr" rid="B41">41</xref>]</sup>. BFCL separates abstract syntax tree (AST)-based call validation from executable checks and combines state and response checks for multi-turn tasks<sup>[<xref ref-type="bibr" rid="B42">42</xref>]</sup>. This distinction matters for the action–feedback interface: reaching a matching state does not establish that a required read-only call was executed, while syntactically valid arguments do not by themselves establish the intended external effect.</p>
        <p>Interactive environments further change what the oracle can observe. WebVoyager evaluates live-web tasks through human and multimodal-model judgments over navigation evidence, with changing answers and excluded login or  Completely Automated Public Turing Test to Tell Computers and Humans Apart (CAPTCHA) workflows limiting its coverage<sup>[<xref ref-type="bibr" rid="B43">43</xref>]</sup>. OSWorld instead combines explicit computer-state initialization with execution-based scripts for desktop and cross-application tasks<sup>[<xref ref-type="bibr" rid="B44">44</xref>]</sup>. SWE-bench applies proposed repository patches and runs associated tests to check issue resolution and preserved behavior<sup>[<xref ref-type="bibr" rid="B45">45</xref>]</sup>. These environments make execution consequences observable in complementary ways, but screenshot judgments, selected state predicates, and test suites each leave properties outside their checks.</p>
        <p>Breadth and process visibility should also be reported separately. AgentBench covers eight code, game, and web environments and records execution outcomes such as invalid actions and interaction-limit termination alongside domain-specific measures<sup>[<xref ref-type="bibr" rid="B46">46</xref>]</sup>. GAIA, a benchmark for general artificial intelligence (AI) assistants, allows diverse tools for human-designed questions but evaluates concise final answers by normalized matching<sup>[<xref ref-type="bibr" rid="B47">47</xref>]</sup>. AgentBoard adds state- or subgoal-based progress across nine environments<sup>[<xref ref-type="bibr" rid="B48">48</xref>]</sup>. Its score retains the highest progress reached, so a later regression need not reduce that score. Together, these designs distinguish domain coverage, endpoint correctness, and achieved intermediate progress; none alone supplies a complete measure of recoverability.</p>
        <p>Security-oriented code repair provides a narrower example within the software-engineering domain. SecureFixAgent iteratively generates Python repairs and re-runs Bandit to check whether the reported vulnerability signals remain<sup>[<xref ref-type="bibr" rid="B39">39</xref>]</sup>. Analyzer silence is bounded evidence about those rules, not a general guarantee of functional preservation. Shen <italic>et al.</italic> complement this repair example with an empirical analysis of vulnerability patterns and mitigation trade-offs in agent applications<sup>[<xref ref-type="bibr" rid="B38">38</xref>]</sup>. This approach highlights that reliability failures can involve deferred exploitability or risk-utility compromises that are not reducible to a binary pass/fail outcome.</p>
        <p>Tool-integrated systems under adversarial attack form a distinct cluster, where correctness focuses on maintaining intended control over tool use despite adversarial instructions. InjecAgent formalizes indirect prompt injection as a structured evaluation, transforming control-flow hijacking and misalignment between user intent and tool actions into measurable failure modes<sup>[<xref ref-type="bibr" rid="B35">35</xref>]</sup>. AgentHarm evaluates coherent multi-step completion of explicitly malicious tasks through synthetic tools and manually specified grading checks<sup>[<xref ref-type="bibr" rid="B37">37</xref>]</sup>. MAESTRO combines instrumented runs with accuracy and resource measurements, call-graph stability analysis, and examination of gray failures<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. These observations distinguish execution behavior from endpoint judgments without supplying an oracle for every intermediate state.</p>
        <p>AgentDojo complements tool-output injection tests with stateful environments in which tools read and modify simulated application state<sup>[<xref ref-type="bibr" rid="B49">49</xref>]</sup>. Its task checks can inspect model outputs and environment states, while legitimate-task utility and attacker success remain separate outcomes. This distinction matters when a defense blocks attacks by also preventing authorized work. The resulting oracle is concrete but bounded by the encoded tasks and adversarial goals; stateful execution alone does not establish coverage of every policy violation.</p>
        <p><xref ref-type="fig" rid="fig3">Figure 3</xref> uses an illustrative booking attempt to contrast two executable checks. The API reports success, but a query of the persisted calendar returns no matching event. A return-status check passes, whereas an event-existence check fails. The discrepancy reflects the properties and state each check examines; neither verdict establishes correctness beyond its coverage.</p>
        <fig id="fig3" position="float">
          <label>Figure 3</label>
          <caption>
            <p>Illustrative disagreement between two executable oracles for one booking attempt: (A) the return-status check passes; (B) the persistent-state check fails because the calendar query returns no matching event. A shared oracle type does not imply equal requirement coverage.</p>
          </caption>
          <graphic xlink:href="inect1013.fig.3.jpg"/>
        </fig>
        <p>For analyzer-backed repair such as SecureFixAgent, the relevant question is which vulnerability properties its static checks cover<sup>[<xref ref-type="bibr" rid="B39">39</xref>]</sup>. For InjecAgent and AgentHarm, it is whether the attack or harmfulness criterion covers the intended threat or policy and whether the relevant behavior is observable<sup>[<xref ref-type="bibr" rid="B35">35</xref>,<xref ref-type="bibr" rid="B37">37</xref>]</sup>. <xref ref-type="table" rid="t4">Table 4</xref> therefore records fidelity conditions rather than assigning a fixed strong/medium/weak grade from oracle type.</p>
        <p>Ground-truth fidelity should also be distinguished from environmental realism and diagnostic resolution. A controlled environment may faithfully check a narrow invariant while representing only a small part of deployment. A rich trace may help localize deviations without supplying an authoritative correctness judgment. Conversely, a reliable terminal-state oracle may identify failure without revealing its cause. Evaluation reports should state these properties separately, alongside coverage limits, stopping rules, and replay conditions<sup>[<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B36">36</xref>]</sup>.</p>
        <p>Security-focused benchmarks assess adversarial outcomes and constraint adherence, which must be distinguished from legitimate-task success. InjecAgent measures attacker-desired deviations using parsed tool invocations and attack-success criteria in simulated tool-response interactions<sup>[<xref ref-type="bibr" rid="B35">35</xref>]</sup>. We interpret this as evidence about instruction stability under that threat model, not as a general measure of policy compliance. In this survey, AgentHarm provides bounded evidence about harmful-task completion; its scores must be read against the encoded task criteria and synthetic tool surface<sup>[<xref ref-type="bibr" rid="B37">37</xref>]</sup>. Shen <italic>et al.</italic> catalog vulnerability patterns as security debt and examine mitigation trade-offs, providing insight into how architectural choices accumulate risk even when task outcomes appear acceptable<sup>[<xref ref-type="bibr" rid="B38">38</xref>]</sup>. SecureFixAgent provides repeatable static-analysis feedback, while weaknesses outside the analyzer’s rules may remain undetected<sup>[<xref ref-type="bibr" rid="B39">39</xref>]</sup>.</p>
        <p>Comparability across benchmarks is challenging because definitions of success, tooling, stopping rules, and oracle strength differ across domains<sup>[<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B36">36</xref>]</sup>. SecureFixAgent illustrates the need to distinguish a clean static-analysis report from broader behavioral correctness<sup>[<xref ref-type="bibr" rid="B39">39</xref>]</sup>. Comparisons must state which properties their repair oracle actually checks. InjecAgent operationalizes attack success in its specified tool-response injection setting<sup>[<xref ref-type="bibr" rid="B35">35</xref>]</sup>. Comparisons with other settings should therefore preserve or explicitly vary the success criteria and stopping rules; this is a comparability requirement, not a result of an ablation reported by InjecAgent. MAESTRO highlights comparability issues related to multi-step scoring and run variance, where traces may enable diagnosis but scenario-level success remains sensitive to nondeterminism<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. <xref ref-type="table" rid="t4">Table 4</xref> makes these differences explicit by recording each study’s domain, evaluation evidence, and validity limits.</p>
        <p>AgentAuditor uses a training-free, memory-augmented LLM evaluator and introduces ASSEBench, whose annotated interaction records distinguish safety and security risks. Its strict and lenient labeling standards expose the effect of ambiguous risk definitions on evaluation. The oracle remains judgment-based: reported agreement with reference labels does not establish the correctness of every external action<sup>[<xref ref-type="bibr" rid="B40">40</xref>]</sup>.</p>
        <p>LongMemEval provides a complementary state/memory evaluation: it distinguishes information extraction, multi-session and temporal reasoning, knowledge updates, and abstention<sup>[<xref ref-type="bibr" rid="B50">50</xref>]</sup>. Its answer evaluator uses model judgments, while annotated evidence locations allow retrieval metrics when the system exposes retrieved records. This separates access to relevant history from the correctness of the final response. Its scope remains conversational memory, so these results do not directly establish transaction consistency or the correctness of external side effects. </p>
        <p>Reliability conclusions for LLM-based agentic AI systems are fundamentally shaped by benchmark design, as datasets fix the interaction loop, oracle, and observable failures; thus, raw success rates are not directly comparable across evaluations.</p>
      </sec>
      <sec id="sec4-3">
        <title>Protocol design, representativeness, and validity threats</title>
        <p>Evaluation protocols for LLM agent frameworks require a full-stack specification that covers task design, execution, judgment, logging, and adjudication<sup>[<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B36">36</xref>]</sup>. This includes task suites and success criteria, run structure, stochasticity management, intervention and ablation designs, and logging procedures that support comparability and diagnosis across implementations. Such breadth is necessary because many recurring failures arise from architectural assumptions: control and state are mediated by language, while tools and environments introduce nondeterminism and hidden couplings. Mohammadi <italic>et al.</italic> emphasize that stochastic agents require repeated execution to assess consistency, and that such evaluation incurs additional cost<sup>[<xref ref-type="bibr" rid="B19">19</xref>]</sup>. In this survey, we additionally recommend disclosing stopping rules, budgets, and trace coverage so that comparisons remain interpretable.</p>
        <p>Run structure is particularly critical given the stochasticity and long-horizon operation of LLM-based agentic AI systems. Minor decoding variations can lead to divergent plans, tool calls, and memory updates, resulting in qualitatively distinct trajectories. Therefore, multi-run evaluation with explicit summaries of variability should be standard practice, moving beyond mean scores<sup>[<xref ref-type="bibr" rid="B19">19</xref>,<xref ref-type="bibr" rid="B36">36</xref>]</sup>. Protocols must also specify aggregation methods, stopping rules, and resource budgets, such as time, tokens, or tool calls, and clarify whether strategies such as best-of-k or retries are part of the framework design or applied only during evaluation. Without these details, observed improvements may reflect protocol artifacts, such as prompt changes, wrapper updates, or environment snapshots, rather than genuine reliability gains.</p>
        <p>Conversational benchmarks make repeated-run consistency and shared control explicit. In τ-bench, the terminal reward combines database-state and required-response checks, while pass<sup>k</sup> estimates success on every one of k independent trials, unlike pass@k, which rewards at least one success<sup>[<xref ref-type="bibr" rid="B51">51</xref>]</sup>. The authors note that a positive terminal reward can still miss acting without the required confirmation. τ<sup>2</sup>-bench adds a telecom domain in which both the agent and a simulated user change shared state; comparisons with no-user and oracle-plan conditions expose additional coordination and planning burdens<sup>[<xref ref-type="bibr" rid="B52">52</xref>]</sup>. Such comparisons support diagnosis within the specified simulator and control allocation, and should be reported together with those conditions rather than treated as deployment-wide reliability estimates.</p>
        <p>Overall task success often fails to reveal the root causes of reliability failures, making diagnosis-oriented ablations and controlled interventions indispensable. These approaches help distinguish architectural causes from incidental faults. MAESTRO evaluates multiple multi-agent systems under repeated runs and different model and tool configurations<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. Building on the architectural analysis here, we recommend targeted ablations of planning, memory, tool access, reflection, and safety components; this recommendation is not an ablation program reported by MAESTRO. Controlled interventions, such as tool failures or observation noise, can expose brittleness, but their effectiveness depends on protocols that prevent hidden retries, unreported fallbacks, or silent prompt and template changes. Without comprehensive logging, retries or silent failures may go undetected, masking true tool unreliability.</p>
        <p>Comprehensive logging is essential for attribution because tool outputs, web content, and intermediate language states may become unrecoverable after a run<sup>[<xref ref-type="bibr" rid="B9">9</xref>,<xref ref-type="bibr" rid="B36">36</xref>]</sup>. Cemri <italic>et al.</italic> link recurring multi-agent failures to cascading effects through message passing and shared state, underscoring that telemetry is vital not only for reproducibility but also for diagnosing architectural failure modes<sup>[<xref ref-type="bibr" rid="B9">9</xref>]</sup>. A minimally sufficient trace should capture prompts, intermediate state representations, tool-call arguments and returns, retries and timeouts, environment observations, immutable run identifiers, and artifacts for replay. This is especially important in multi-agent settings, where coordination and message ordering influence subsequent actions. MAESTRO uses execution observability to examine call structures and errors<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. The trace contents recommended here extend that concern into a reporting proposal for this survey. Nevertheless, protocols must acknowledge a structural limitation: when relevant state is only implicitly embedded in language, some causal chains remain ambiguous, even with extensive logs.</p>
        <p>For this survey, protocol validity is assessed along three distinctions. Internal validity concerns whether changes in outcomes can be attributed to the tested intervention when task information, nondeterminism, and reporting choices are controlled. Construct validity concerns whether the measured outcome represents the stated reliability requirement, including any process or tool-use constraints. Conclusion validity concerns whether the trials and comparisons support the reported inference. We therefore recommend disclosing exposed task information, trial selection, and multiple-comparison procedures rather than attributing a score change to architecture alone.</p>
        <p>Even with strong internal validity, external validity remains challenging because system performance is tightly coupled to the tool ecosystem and scaffolding. Mohammadi <italic>et al.</italic> organize evaluation in terms of objectives and processes, including data, metric computation, tooling, and evaluation contexts<sup>[<xref ref-type="bibr" rid="B19">19</xref>]</sup>. From this perspective, we argue that changes in tool interfaces or operating constraints should be treated as changes in the conditions of a reliability claim. Real-world deployment introduces longer horizons, noisier observations, and dynamic constraints, which can shift both optimal policies and failure patterns. Contamination further threatens representativeness: if benchmarks overlap with training data or prompts encode task-specific heuristics, scores may be artificially inflated. Protocols must therefore require explicit reporting of tool interfaces and dependencies, task sources, distribution-shift analyses, and contamination checks.</p>
        <p>In adversarial settings, the language/tool interface itself becomes a threat channel, challenging the assumption that language-mediated state remains reliable under hostile inputs. InjecAgent evaluates indirect prompt injection through tool responses and compares attack success under base and enhanced attack prompts<sup>[<xref ref-type="bibr" rid="B35">35</xref>]</sup>. This evaluation does not establish the effects of a systematic ablation of sanitization or permission defenses. Meaningful comparability requires precise reporting of attacker capabilities, tool permissions, and threat models. As a future evaluation recommendation, controlled ablations of tool permissions and filtering layers could test those defenses. Such studies should retain a common threat model and report variability across runs.</p>
        <p>Safety and harm evaluations are similarly sensitive to protocol design because long-horizon tool use can magnify minor prompt or environment variations into harmful outcomes. AgentHarm separates task-specific harm scores from refusal measurements and includes benign counterparts to contextualize agent capabilities<sup>[<xref ref-type="bibr" rid="B37">37</xref>]</sup>. Representativeness in this context depends on realistic scenarios, appropriate tool interfaces, and multi-run designs that capture stochasticity and nondeterministic tool behavior. AgentAuditor evaluates safe/unsafe judgments against annotated interaction records using accuracy and F1, with strict and lenient labels for ambiguous cases. These choices make evaluator agreement measurable while leaving the scope and interpretation of the reference labels as explicit validity conditions<sup>[<xref ref-type="bibr" rid="B40">40</xref>]</sup>.</p>
        <p>In summary, evaluation protocols function as architectural specifications for reproducibility, causal attribution, and representativeness. <xref ref-type="table" rid="t5">Table 5</xref> summarizes the key protocol dimensions, reporting requirements, and validity threats. At a minimum, reports should document: (i) run structure and budgets, including trial counts and variance summaries; (ii) stochasticity settings, including sampling parameters, seeds, caching or replay policies, and tool determinism; (iii) ablation and intervention designs with explicit confound controls; and (iv) trace artifacts that link outcomes to decisions, tool calls, and state snapshots. For adversarial and harm-focused benchmarks, protocols should additionally specify threat models, tool-surface assumptions, and the role of safety filters and permissions, since small changes in these factors can substantially affect reliability. Contamination checks should address overlap between training and evaluation data<sup>[<xref ref-type="bibr" rid="B53">53</xref>]</sup>. Where model judges are used, evaluator biases and agreement with human judgments also require separate checks<sup>[<xref ref-type="bibr" rid="B54">54</xref>]</sup>. The architectural protocol should additionally document any task-specific information exposed through scaffolds. </p>
		<table-wrap id="t5">
        <label>Table 5</label>
        <caption>
          <p>Evaluation protocol dimensions, reporting requirements, and validity considerations</p>
        </caption>
        <table frame="hsides" rules="groups">
          <thead>
            <tr>
              <td style="border-bottom:1;">
                <bold>Protocol dimension</bold>
              </td>
              <td style="border-bottom:1;">
                <bold>Reporting and control requirements</bold>
              </td>
              <td style="border-bottom:1;">
                <bold>Validity concern</bold>
              </td>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td>Run structure</td>
              <td>Number of trials, confidence intervals or variance, budgets, and stopping rules</td>
              <td>Conclusion validity and regression masking</td>
            </tr>
            <tr>
              <td>Stochasticity</td>
              <td>Seeds, sampling parameters, caching or replay policies, and tool determinism</td>
              <td>Reproducibility and run-to-run variance</td>
            </tr>
            <tr>
              <td>Ablations</td>
              <td>Component toggles, intervention design, and confound checks</td>
              <td>Causal attribution</td>
            </tr>
            <tr>
              <td>Telemetry</td>
              <td>Full traces, tool provenance, state snapshots, retries, and timeouts</td>
              <td>Silent errors and attribution ambiguity</td>
            </tr>
            <tr>
              <td>External fit</td>
              <td>Tool surfaces, ecosystem dependencies, task sources, and distribution-shift analysis</td>
              <td>External validity</td>
            </tr>
            <tr>
              <td>Contamination and leakage</td>
              <td>Overlap checks, prompt audits, document exposure, and baseline leakage tests</td>
              <td>Inflated performance</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
        <p>Reliable evaluation of LLM agent frameworks requires full-stack, variance-aware protocols with multi-run reporting, explicit budgets, controlled ablations, and comprehensive telemetry, alongside rigorous validity and contamination checks.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>RELIABILITY MECHANISMS AND THEIR INTERFACES</title>
      <p>This section examines reliability mechanisms through their operational interfaces within LLM agent frameworks. We focus on how these mechanisms consume artifacts, such as prompts, tool outputs, execution traces, policies, and intermediate states, and where they are integrated, including wrappers, middleware, orchestrators, runtime monitors, and governance layers. This interface-oriented view clarifies the architectural assumptions behind reliability mechanisms: what information must be observable, what state can be modified, and which actions can be constrained before side effects occur. These assumptions help explain persistent reliability challenges, including gradual control drift, inconsistent state representations, and undetected tool invocation failures.</p>
      <sec id="sec5-1">
        <title>Solution family taxonomy by paradigm</title>
        <p>The mechanism taxonomy complements the architectural layers: families describe <italic>how</italic> an intervention works, layers describe <italic>where</italic> it acts, and interfaces describe <italic>what it observes and can change</italic>. These labels are not mutually exclusive. A specification-first action guard can also be rule-based; a structure-first trajectory monitor can use a learned detector; and a hybrid can combine several families. <xref ref-type="table" rid="t6">Table 6</xref> connects these axes to the constructs and premises introduced earlier.</p>
        <table-wrap id="t6">
          <label>Table 6</label>
          <caption>
            <p>Dimensions of reliability analysis illustrated by a pre-action contract check</p>
          </caption>
          <table frame="hsides" rules="groups">
  <tbody>
    <tr>
      <td>
        <bold>Axis</bold>
      </td>
      <td>
        <bold>Question answered</bold>
      </td>
      <td>
        <bold>Example: a pre-action contract check</bold>
      </td>
    </tr>
    <tr>
      <td>Construct and requirement</td>
      <td>Which property must hold?</td>
      <td>An action respects the authorized destination</td>
    </tr>
    <tr>
      <td>Premise and failure mode</td>
      <td>What assumption may fail?</td>
      <td>Instruction instability can produce control drift</td>
    </tr>
    <tr>
      <td>Layer and timing</td>
      <td>Where and when can it act?</td>
      <td>Action/execution, before a tool call</td>
    </tr>
    <tr>
      <td>Mechanism family</td>
      <td>How does it operate?</td>
      <td>Specification-first checking, implemented with rules</td>
    </tr>
    <tr>
      <td>Interface and authority</td>
      <td>What can it read or change?</td>
      <td>Reads arguments and policy; permits or blocks the call</td>
    </tr>
    <tr>
      <td>Oracle and metric</td>
      <td>What evidence supports evaluation?</td>
      <td>An authorization oracle checks calls; violation and false-block rates summarize results</td>
    </tr>
  </tbody>
</table>
          <table-wrap-foot>
            <fn id="t6FN1">
              <p>Mechanism families and architectural placements may overlap.</p>
            </fn>
          </table-wrap-foot>
        </table-wrap>
        <p>The six families below are a practical organization of the discussed mechanisms, not a disjoint partition or a ranking of effectiveness. For each family, we consider targeted failure modes, required artifacts, and assumptions about semantic fidelity, instruction stability, observability, and recoverability.</p>
        <p>Heuristic and rule-based guards treat reliability as runtime governance over the action surface. SAGA controls inter-agent communication through user-defined contact policies and cryptographic access tokens<sup>[<xref ref-type="bibr" rid="B30">30</xref>]</sup>. AgentSpec applies event-triggered runtime predicates, while AgentSentinel intercepts sensitive operations for context-aware security auditing<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B55">55</xref>]</sup>. These methods expose policy rules, enforcement hooks, and audit logs at communication or execution boundaries. AgentSentinel additionally uses an LLM-based auditor, so its interception architecture also spans the hybrid category. AGENTSAFE extends this paradigm by framing failures as lapses in accountability and oversight rather than only model errors<sup>[<xref ref-type="bibr" rid="B31">31</xref>]</sup>. Such methods are practical because tool interfaces and logs provide observable enforcement points, but they are limited when policy coverage is incomplete, harms arise through indirect or unlogged effects, or failures stem from latent state inconsistencies rather than overt violations<sup>[<xref ref-type="bibr" rid="B38">38</xref>,<xref ref-type="bibr" rid="B55">55</xref>]</sup>.</p>
        <p>Structure-first approaches treat execution traces, graphs, or workflows as analyzable objects. SentinelAgent models multi-agent behavior as a relational graph and applies anomaly detection to expose coordination breakdowns or emergent misbehavior<sup>[<xref ref-type="bibr" rid="B56">56</xref>]</sup>. Pathak <italic>et al.</italic> argue that many failures are visible only across trajectory segments, motivating trace-based analysis over time<sup>[<xref ref-type="bibr" rid="B24">24</xref>]</sup>. Sherlock analyzes workflow graphs through fault injection to select vulnerable nodes for verification, then combines learned verifier selection with speculative execution and selective rollback<sup>[<xref ref-type="bibr" rid="B57">57</xref>]</sup>. AgentFuzz uses directed greybox fuzzing, with semantic and control-flow-distance feedback, to exercise taint-style vulnerabilities in agent applications<sup>[<xref ref-type="bibr" rid="B58">58</xref>]</sup>. These methods are strongest when traces are complete and semantically meaningful, but they weaken under partial observability or when important state is embedded only implicitly in language<sup>[<xref ref-type="bibr" rid="B56">56</xref>,<xref ref-type="bibr" rid="B57">57</xref>]</sup>.</p>
        <p>Specification-first paradigms encode reliability as contracts, invariants, protocols, or information-flow constraints. Doshi <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B33">33</xref>]</sup> and Li<italic> et al.</italic><sup>[<xref ref-type="bibr" rid="B34">34</xref>]</sup> frame safe tool use as a property checked against explicit requirements, while SAFEFLOW combines trust-based information-flow controls with transactional logging and dependency-aware recovery. Information-flow control, as in Costa <italic>et al.</italic>, constrains sensitive data propagation through prompts, memory, and tool I/O<sup>[<xref ref-type="bibr" rid="B59">59</xref>]</sup>. These methods require richer artifacts, including formal specifications, pre/postconditions, flow labels, and protocol rules. Their strength depends on whether specifications capture real intent and tool effects; their limitation is that incomplete specifications can create apparently verified steps that still miss long-horizon drift or unmodeled side effects<sup>[<xref ref-type="bibr" rid="B34">34</xref>]</sup>.</p>
        <p>CaMeL makes the authority boundary explicit: a privileged model constructs a plan from the trusted request, a quarantined model processes untrusted content, and an interpreter tracks capabilities and checks policies before tool calls<sup>[<xref ref-type="bibr" rid="B60">60</xref>]</sup>. This design addresses control and data flow through executable restrictions rather than relying only on a model to reject malicious instructions. Its protection remains conditional on the trusted inputs, policy definitions, and tracked dependencies; the paper also discusses residual side channels.</p>
        <p>Instruction-boundary defenses offer a complementary intervention before action selection. StruQ combines a frontend that separates instructions from data with structured instruction tuning<sup>[<xref ref-type="bibr" rid="B61">61</xref>]</sup>. SecAlign instead uses preference optimization to favor legitimate-task responses over attacker-desired responses to injected inputs<sup>[<xref ref-type="bibr" rid="B62">62</xref>]</sup>. Both modify how the model interprets untrusted content, whereas interpreter-based controls constrain the authority of the resulting computation. These defenses therefore differ in how they reinforce instruction stability and in the enforcement they provide: trained instruction adherence can improve empirical robustness, but does not itself constitute a runtime contract over tool effects. They are learned defenses, not necessarily learned risk monitors.</p>
        <p>Tool-Guard addresses a different input surface: cross-tool description poisoning. It combines isolated planning over dynamically partitioned tool sets with LLM-based checks of task alignment and argument grounding. Failed validation updates the partition and triggers replanning, while tools remain usable within their partitions. This couples a change in planner-visible context to an execution gate, although the paper’s failure analysis shows that the semantic validator can also reject legitimate actions<sup>[<xref ref-type="bibr" rid="B63">63</xref>]</sup>.</p>
        <p>Learned monitoring uses a trained or fitted model to estimate risk from prompts, states, tool arguments, or trajectories. Pathak <italic>et al.</italic> evaluate supervised XGBoost and one-class support vector data description detectors on agent trajectories<sup>[<xref ref-type="bibr" rid="B24">24</xref>]</sup>. Sherlock uses a learned selector to choose verification strategies for workflow nodes, together with separate checking and rollback mechanisms<sup>[<xref ref-type="bibr" rid="B57">57</xref>]</sup>. These examples separate the learned decision rule from the intervention that follows it: detection requires suitable training or calibration data, while prevention also requires an enforcement hook. Evaluation should report false alarms, missed failures, and behavior under distribution shift.</p>
        <p>Language-native monitoring uses LLMs for self-critique, plan checking, and revision. DORA dynamically optimizes reflection prompts to address planning defects and weak self-correction over long trajectories<sup>[<xref ref-type="bibr" rid="B64">64</xref>]</sup>. The effectiveness of self-critique depends on the relevant error being visible to the critic and on the corrective step being checked against an appropriate requirement. This approach is flexible and easy to integrate, but it can fail when execution errors are not visible in text, when feedback is incomplete, or when the action and critique processes share the same mistaken trajectory.</p>
        <p>External feedback changes the basis of language-mediated correction. CRITIC iteratively checks and revises outputs using tools such as search and code execution<sup>[<xref ref-type="bibr" rid="B65">65</xref>]</sup>; this supplies evidence beyond an unsupported self-assessment, although its oracle-assisted variant must be distinguished from ordinary operation. ExpeL extends feedback use across tasks by extracting natural-language guidance from successful and failed trajectories without updating model weights<sup>[<xref ref-type="bibr" rid="B66">66</xref>]</sup>. Its HotpotQA ablation shows that adding reflections during insight extraction can reduce performance, with misleading reflections offered as an explanation. Together, these examples distinguish revising an output using fresh evidence from turning past outcomes into reusable guidance. Our architectural interpretation is that both require scrutiny of the feedback source and the correction interface; a successful local revision or reusable lesson does not establish safe recovery from every external side effect.</p>
        <p>Hybrid approaches combine enforcement, trace analysis, learned signals, and reflective repair to reduce reliance on any single premise. SecureFixAgent grounds LLM-driven repair in vulnerability findings and iterates toward secure patches<sup>[<xref ref-type="bibr" rid="B39">39</xref>]</sup>. Patel <italic>et al.</italic>’s Six Sigma Agent combines task decomposition, redundant micro-agent execution, and consensus voting; its reliability argument depends on the behavior and correlation of the sampled errors<sup>[<xref ref-type="bibr" rid="B67">67</xref>]</sup>. In this survey’s analysis, combining mechanisms can close gaps while adding overhead and interfaces; components that share a blind spot may still fail together.</p>
        <p>Planning methods further illustrate why mechanism families overlap. LLM+P translates a natural-language task into a  Planning Domain Definition Language problem and delegates solving to a classical planner<sup>[<xref ref-type="bibr" rid="B68">68</xref>]</sup>. This supplies a formal solving procedure, but its relevance to the user goal still depends on the supplied domain and the semantic fidelity of the translated problem. LATS combines tree search, environmental feedback, language-model evaluation, and reflection to explore alternative trajectories<sup>[<xref ref-type="bibr" rid="B69">69</xref>]</sup>. Its search procedure requires additional computation and the ability to return to earlier environment states. Thus, formal solving and feedback-guided search address different uncertainties, while neither removes the need to validate the task representation or establish that repeated actions are recoverable.</p>
        <p>The discussed mechanisms expose different intervention interfaces. AgentSpec checks event-triggered predicates, while SAFEFLOW combines information-flow rules with transactional state and recovery<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B34">34</xref>]</sup>. Pathak <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B24">24</xref>]</sup> and Ro <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B57">57</xref>]</sup> score trajectory evidence, and Sherlock combines workflow analysis with verifier selection and rollback<sup>[<xref ref-type="bibr" rid="B24">24</xref>,<xref ref-type="bibr" rid="B57">57</xref>]</sup>. Our synthesis therefore compares the artifacts exposed, the checks applied, and the authority to change execution, rather than assigning effectiveness from a mechanism-family label. For state consistency and long-horizon behavior, the relevant question is whether those interfaces expose the state and transitions needed by the requirement.</p>
        <p>The six mechanism families are heuristic/rule-based, structure-first, specification-first, learned monitoring, language-native, and hybrid. Their protection depends on the evidence they observe, the actions they can constrain, and the state they can restore.</p>
      </sec>
      <sec id="sec5-2">
        <title>Pipeline placement across architectural layers</title>
        <p>Pipeline placement describes where reliability or safety interventions act within an LLM agent framework. <xref ref-type="table" rid="t7">Table 7</xref> maps representative studies and techniques to architectural layers and intervention timing. We map techniques to the five layers and also record whether they act before a subsequent decision or execution step. Pre-decision is a timing label, not a sixth architectural layer; subsequent placements identify the layer at which an intervention operates. Each placement offers different opportunities for observation and intervention. A pre-decision method can shape goals before planning begins, while an action/execution mechanism can block unsafe tool use before side effects occur. A governance mechanism can audit behavior across the system, but only if it has sufficient visibility and enforcement authority.</p>
        <table-wrap id="t7">
          <label>Table 7</label>
          <caption>
            <p>Architectural placement and timing of reliability analysis and intervention</p>
          </caption>
          <table frame="hsides" rules="groups">
  <tbody>
    <tr>
      <td>
        <bold>Layer or timing</bold>
      </td>
      <td>
        <bold>Representative studies and techniques</bold>
      </td>
    </tr>
    <tr>
      <td>Pre-decision (timing)</td>
      <td>Prompt constraints before a decision; adaptive reflection advice between attempts, as in DORA<sup>[<xref ref-type="bibr" rid="B64">64</xref>]</sup></td>
    </tr>
    <tr>
      <td>Decision and control</td>
      <td>Prompt-injection effects on tool choice<sup>[<xref ref-type="bibr" rid="B16">16</xref>]</sup>; runtime constraints that shape control decisions<sup>[<xref ref-type="bibr" rid="B29">29</xref>]</sup></td>
    </tr>
    <tr>
      <td>State and memory</td>
      <td>Transactional state tracking and dependency-aware recovery over modeled operations<sup>[<xref ref-type="bibr" rid="B34">34</xref>]</sup></td>
    </tr>
    <tr>
      <td>Action and execution</td>
      <td>Tool invocation diagnosis<sup>[<xref ref-type="bibr" rid="B13">13</xref>]</sup>; verifiably safe tool use<sup>[<xref ref-type="bibr" rid="B3">33</xref>]</sup>; transactional execution<sup>[<xref ref-type="bibr" rid="B34">34</xref>]</sup>; secure computer-use defenses<sup>[<xref ref-type="bibr" rid="B55">55</xref>]</sup></td>
    </tr>
    <tr>
      <td>Environment and feedback</td>
      <td>Workflow reliability and feedback-driven recovery<sup>[<xref ref-type="bibr" rid="B57">57</xref>]</sup>; anomaly detection in multi-agent runs<sup>[<xref ref-type="bibr" rid="B56">56</xref>]</sup></td>
    </tr>
    <tr>
      <td>Governance and monitoring</td>
      <td>Security architecture and enforcement<sup>[<xref ref-type="bibr" rid="B30">30</xref>]</sup>; information-flow control<sup>[<xref ref-type="bibr" rid="B59">59</xref>]</sup>; ethical governance<sup>[<xref ref-type="bibr" rid="B30">31</xref>]</sup>; runtime auditing and enforcement<sup>[<xref ref-type="bibr" rid="B29">29</xref>]</sup></td>
    </tr>
  </tbody>
</table>
          <table-wrap-foot>
            <fn id="t7FN1">
              <p>Pre-decision denotes timing rather than an additional architectural layer. F1-F4 refer to the survey findings in Section “<bold>Four findings from the architectural synthesis</bold>”.</p>
            </fn>
          </table-wrap-foot>
        </table-wrap>
        <p>Pre-decision interventions can shape a subsequent planning or execution step. DORA dynamically generates reflection advice from earlier attempts using an auxiliary language model and Bayesian prompt optimization, addressing the early cessation of useful reflection<sup>[<xref ref-type="bibr" rid="B64">64</xref>]</sup>. Decision/control techniques act during planning and policy selection. Shi <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B16">16</xref>]</sup> and Wang <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B29">29</xref>]</sup> show that prompt injection can manipulate tool choice at the moment of capability invocation, while AgentSpec constrains unsafe choices before they produce external side effects.</p>
        <p>State/memory interventions address inconsistencies in retrieved context, intermediate representations, or shared state. This layer poses a distinct validation problem when state is implicit in language, and no authoritative state record is exposed. SAFEFLOW illustrates explicit execution-state recording and dependency-aware recovery within its modeled operations<sup>[<xref ref-type="bibr" rid="B34">34</xref>]</sup>.</p>
        <p>Memory designs expose different state-maintenance operations. MemGPT uses function calls to move information between a bounded prompt and external storage, with memory-pressure signals and function chaining linking memory management to control flow<sup>[<xref ref-type="bibr" rid="B70">70</xref>]</sup>. MemoryBank adds dialogue summaries and selective retention based on elapsed time and repeated recall<sup>[<xref ref-type="bibr" rid="B71">71</xref>]</sup>, whereas A-Mem constructs notes with structured attributes, links related records, and updates their contextual attributes<sup>[<xref ref-type="bibr" rid="B72">72</xref>]</sup>. These designs make storage and retrieval mechanisms explicit. In our architectural analysis, their flexibility also motivates checking which observations justify an update and whether task-critical information survives summarization or forgetting; improved recall alone does not establish those properties.</p>
        <p>Procedural memory connects past execution to future decisions. Agent Workflow Memory induces reusable routines from trajectories and supplies them as guidance for later actions; its online variant selects successful attempts through an evaluator before inducing workflows<sup>[<xref ref-type="bibr" rid="B73">73</xref>]</sup>. This creates a feedback-to-memory-to-control path whose reliability depends on the evaluator and the applicability of the reused routine. We therefore distinguish learning a useful procedure from certifying that its preconditions hold in a new environment.</p>
        <p>Action/execution interventions exploit tool calls as explicit boundaries for validation. Huang <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B13">13</xref>]</sup> diagnose tool invocation failures, Doshi <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B33">33</xref>]</sup> focus on verifiably safe tool use, SAFEFLOW introduces transactional execution, and AgentSentinel defends computer-use agents at the execution interface<sup>[<xref ref-type="bibr" rid="B34">34</xref>,<xref ref-type="bibr" rid="B55">55</xref>]</sup>.</p>
        <p>Environment/feedback mechanisms operate after actions, using observed outcomes to detect failures and trigger recovery. Sherlock overlaps downstream execution with verification and rolls back affected computations when a verifier revises an earlier output<sup>[<xref ref-type="bibr" rid="B57">57</xref>]</sup>. SentinelAgent applies graph-based anomaly detection to identify abnormal behavior during multi-agent operation<sup>[<xref ref-type="bibr" rid="B56">56</xref>]</sup>. Governance and monitoring mechanisms impose system-level oversight through audits, policies, and lifecycle controls. SAGA provides security architecture and enforcement interfaces, Syros <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B30">30</xref>]</sup>, Khan<italic> et al.</italic><sup>[<xref ref-type="bibr" rid="B31">31</xref>]</sup> and Costa <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B59">59</xref>]</sup> enforce information-flow constraints, and AGENTSAFE emphasizes ethical assurance and accountability<sup>[<xref ref-type="bibr" rid="B30">30</xref>,<xref ref-type="bibr" rid="B31">31</xref>,<xref ref-type="bibr" rid="B59">59</xref>]</sup>. AgentSpec constrains planned actions through event-triggered checks and runtime interventions<sup>[<xref ref-type="bibr" rid="B29">29</xref>]</sup>. Its hooks also cover state changes and task completion; this coverage does not establish the safety of future multi-step trajectories.</p>
        <p>The examples above show why action/execution and governance/monitoring offer useful intervention boundaries: tool arguments, returns, and policy decisions can be exposed explicitly. State/memory consistency requires additional evidence about state provenance and freshness. This contrast concerns the requirements of the mechanisms, not a measured distribution of research across layers. Placement is therefore central to interpreting effectiveness: the same failure may originate as a control problem, manifest as unsafe tool use, and later appear as a feedback or monitoring failure. </p>
        <p>Explicit action and governance interfaces make some violations directly checkable. State consistency needs its own evidence and controls; a mechanism at one layer does not automatically protect the others.</p>
		</sec>
        <sec id="sec5-3">
          <title>Inputs, outputs, and integration patterns</title>
          <p>The interface determines which evidence a mechanism can inspect and which operation it can change. AgentSpec evaluates predicates at runtime events and invokes specified interventions<sup>[<xref ref-type="bibr" rid="B29">29</xref>]</sup>. SAFEFLOW combines trust-based information-flow controls with transactional records and dependency-aware recovery<sup>[<xref ref-type="bibr" rid="B34">34</xref>]</sup>. <xref ref-type="fig" rid="fig4">Figure 4</xref> compares these designs by their observed artifacts, checks, and intervention authority. Checkpoint coverage bounds the first design; modeled operations and recoverable dependencies bound the second.</p>
		  <fig id="fig4" position="float">
          <label>Figure 4</label>
          <caption>
            <p>Runtime enforcement in (A) AgentSpec<sup>[<xref ref-type="bibr" rid="B29">29</xref>]</sup> and (B) SAFEFLOW<sup>[<xref ref-type="bibr" rid="B34">34</xref>]</sup>. Protection depends on exposed state and rule coverage; recovery is limited to supported operations. SF: SafeFlow level.</p>
          </caption>
          <graphic xlink:href="inect1013.fig.4.jpg"/>
        </fig>
          <p>Integration roles cluster into three recurring patterns. <bold>Wrappers</bold> encapsulate LLM or tool calls, enabling prompt shaping, output validation, or action gating at decision boundaries. <bold>Middlewares</bold> mediate between control, state, and action modules, checking consistency as information moves across language and structured representations. <bold>Orchestrators</bold> manage multi-step loops or multi-agent coordination, often combining monitoring with control logic to pause, reroute, or override execution. These are integration patterns in our analysis rather than additional mechanism families.</p>
          <p>In our interface analysis, portability and diagnostic coverage are conditional on the host framework. A wrapper needs access to the calls or trajectories it inspects and permission to alter the corresponding output or action. An asynchronous monitor can analyze exposed logs without blocking the current call, but timely intervention additionally requires an appropriate control hook. Enforcement needs an interpretable action or state representation and authority at the relevant boundary. An orchestrator can coordinate checks across steps only to the extent that it controls the event loop and observes the required state.</p>
          <p>This interface analysis identifies conditions under which the mechanisms can fail even if their local checks operate as designed<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B34">34</xref>,<xref ref-type="bibr" rid="B57">57</xref>,<xref ref-type="bibr" rid="B59">59</xref>]</sup>. Log-based monitors require complete and stable telemetry. Prompt rewriting assumes faithful trace capture and predictable model interpretation. Security interception requires the ability to observe and block actions before side effects occur. Specification enforcement presupposes shared schemas for intent, constraints, and tool behavior. Making these assumptions explicit clarifies why drift, undetected execution errors, and weak self-correction persist across diverse LLM agent frameworks. </p>
          <p>Reliability mechanisms are shaped by their input/output interfaces and integration patterns. Their portability and effectiveness depend on which artifacts are observable, which interventions are enforceable, and where in the LLM-agent loop the mechanism attaches.</p>
        </sec>
        <sec id="sec5-4">
          <title>Architectural interfaces and failure propagation</title>
          <p>The cited work illustrates an expansion of architectural responsibilities, not a universal sequence in which one design replaces another. Reasoning-and-action loops connect decisions to external observations<sup>[<xref ref-type="bibr" rid="B6">6</xref>]</sup>; tool-learning and application frameworks expose execution interfaces<sup>[<xref ref-type="bibr" rid="B23">23</xref>,<xref ref-type="bibr" rid="B74">74</xref>]</sup>; memory-oriented designs maintain information across longer tasks<sup>[<xref ref-type="bibr" rid="B7">7</xref>]</sup>; and runtime specifications introduce explicit enforcement points<sup>[<xref ref-type="bibr" rid="B29">29</xref>]</sup>. These designs coexist and may be combined. Their relevance here is the additional reliability obligation created by each interface.</p>
          <p>Coupling reasoning to action makes feedback interpretation part of correctness. An incorrect intermediate output can influence the next decision, and a malformed call or partial tool result can create a mismatch between the intended and actual state. Tool-use failure taxonomies provide a basis for separating selection, invocation, and execution problems rather than treating all of them as answer errors<sup>[<xref ref-type="bibr" rid="B13">13</xref>,<xref ref-type="bibr" rid="B26">26</xref>]</sup>. In this setting, final-output inspection alone cannot determine which transition broke down.</p>
          <p>Persistent or shared state extends the lifetime and reach of such mismatches. Memory management makes earlier observations available to later decisions, while multi-agent coordination creates additional paths through which inconsistent beliefs can affect task progress<sup>[<xref ref-type="bibr" rid="B7">7</xref>,<xref ref-type="bibr" rid="B9">9</xref>]</sup>. Runtime monitoring and transactional execution offer ways to check or control selected transitions<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B34">34</xref>]</sup>. Their architectural value depends on whether the relevant state is exposed and whether their intervention occurs before an irreversible effect.</p>
          <p>This comparison motivates a shift in the <italic>analysis</italic> from prompt-local correctness to cross-layer obligations. It does not establish how frequently each design occurs or whether later systems are more reliable. The chains in Section “<bold>Representative cross-layer failure chains</bold>” explain how the same premises of semantic fidelity, instruction stability, observability, and recoverability remain relevant as responsibilities are distributed across more components. </p>
          <p>Adding memory, tools, or monitoring creates new obligations at component interfaces. Architectural reliability depends on whether those obligations are checked across the loop, not on the number or apparent sophistication of its components.</p>
        </sec>
      </sec>
    <sec id="sec6">
      <title>CROSS-LAYER RELIABILITY ACROSS AGENT ARCHITECTURES</title>
      <p>Comparing prompt-based, tool-augmented, and persistent agent designs reveals different paths for reliability failures to emerge and propagate. Explicit planning, memory, tool execution, feedback, and monitoring introduce additional interfaces through which failures can propagate across layers. The five-layer abstraction distinguishes the functions and interfaces involved in these propagation paths. These propagation paths motivate examining assumptions about state consistency, observable tool effects, and the conditions under which errors can be detected and corrected.</p>
      <sec id="sec6-1">
        <title>Evaluation evidence and diagnostic coverage</title>
        <p>Evaluation methods for LLM agent frameworks include endpoint judgments, executable checks, trace diagnostics, and operational telemetry. These differences are central to reliability analysis because evaluation protocols determine which aspects of decision-making, state propagation, and action execution become observable. A protocol defines task specifications, success criteria, interaction structure, oracles, metrics, and reporting artifacts, such as traces, logs, seeds, and environment versions. Failures that do not change the judged endpoint require evidence beyond that endpoint for detection and diagnosis.</p>
        <p>Mohammadi <italic>et al.</italic> organize agent evaluation along two dimensions: evaluation objectives, including reliability and safety, and evaluation processes, including interaction, data, computation, tooling, and context<sup>[<xref ref-type="bibr" rid="B19">19</xref>]</sup>. This aligns with an architectural perspective: once systems interact with tools, memory, and environments, evaluation must expose intermediate steps to support meaningful reliability claims.</p>
        <p>Endpoint judgments differ in their procedures. GAIA scores concise final answers by normalized matching<sup>[<xref ref-type="bibr" rid="B47">47</xref>]</sup>. LLM-as-judge research examines automated assessments, their agreement with human judgments, and judgment biases<sup>[<xref ref-type="bibr" rid="B54">54</xref>]</sup>. In our architectural analysis, a terminal judgment alone cannot identify an intermediate failure that leaves the judged endpoint unchanged; diagnosis requires additional evidence about the trajectory.</p>
        <p>Executable evaluations check specified outputs or states: OSWorld uses task-specific evaluation scripts, and SWE-bench runs tests on proposed repository patches<sup>[<xref ref-type="bibr" rid="B44">44</xref>,<xref ref-type="bibr" rid="B45">45</xref>]</sup>. Controlled environments and checks can support repetition, while the validity of a verdict remains bounded by its requirements and coverage. Process-aware analyses expose different evidence: MAESTRO compares execution call graphs, and Cemri <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B9">9</xref>]</sup> and Ma <italic>et al.</italic><sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup> categorize failures in annotated multi-agent traces. In our synthesis, these records can help locate candidate deviations, but causal attribution still requires suitable controls.</p>
        <p>Operational telemetry extends observation across runs. MAESTRO illustrates instrumented repeated-run analysis through execution traces, resource measurements, and call-graph comparisons<sup>[<xref ref-type="bibr" rid="B36">36</xref>]</sup>. In our synthesis, extending such observations across runs can expose deviations beyond those represented by a single endpoint score. Mohammadi <italic>et al.</italic> discuss trade-offs between realistic and controlled evaluation contexts, together with the cost of repeated assessment<sup>[<xref ref-type="bibr" rid="B19">19</xref>]</sup>. For telemetry-based studies, this survey further recommends reporting which traces and environment states are retained, because these choices determine what can be inspected or replayed. Across these examples, our synthesis distinguishes the evidence exposed, the judgment procedure, the conditions needed for repetition, and the cost of assessment. These considerations motivate combining executable checks, traces, and monitoring with endpoint scoring. The categories coexist; they are not stages that every evaluation follows.</p>
        <p>The approaches in <xref ref-type="fig" rid="fig5">Figure 5</xref> answer different questions about the same execution. An endpoint judgment establishes the assessed outcome, an executable check tests specified states or effects, and a trace links intermediate events. Operational telemetry extends observation across repeated runs. Their combination is useful when the records can be connected to the same requirement and execution; otherwise, additional observations may still leave the origin of a failure unresolved. </p>
        <fig id="fig5" position="float">
          <label>Figure 5</label>
          <caption>
            <p>Evaluation approaches, observed evidence, and diagnostic limits. The execution marks illustrate observation scope, not measured performance; approaches can be combined.</p>
          </caption>
          <graphic xlink:href="inect1013.fig.5.jpg"/>
        </fig>
        <p>Executable, trace-based, and telemetry-supported assessments expose different aspects of architectural reliability. They complement endpoint scoring while introducing distinct costs and limits on reproducibility.</p>
      </sec>
      <sec id="sec6-2">
        <title>Composition of reliability mechanisms</title>
        <p>Mitigation strategies for LLM-agent reliability have expanded from model-guided reasoning patterns to explicit system-level controls. Early agent designs coupled reasoning with actions or verbal feedback, while autonomous-agent prototypes used task lists and iterative loops<sup>[<xref ref-type="bibr" rid="B6">6</xref>,<xref ref-type="bibr" rid="B21">21</xref>,<xref ref-type="bibr" rid="B22">22</xref>,<xref ref-type="bibr" rid="B75">75</xref>]</sup>. These works established influential control patterns, but they did not provide general guarantees of consistency across extended trajectories.</p>
        <p>Tool-learning methods, application frameworks, and interactive environments make different parts of the interaction interface explicit. Toolformer studies learned tool invocation, LangChain exposes composable application components, and WebArena supplies an executable web environment for evaluating autonomous agents<sup>[<xref ref-type="bibr" rid="B8">8</xref>,<xref ref-type="bibr" rid="B23">23</xref>,<xref ref-type="bibr" rid="B74">74</xref>]</sup>. These contributions improve the structure and testability of agent interactions, although they do not by themselves provide rollback or continuous runtime observability.</p>
        <p>Recent strategies introduce dedicated monitoring, runtime enforcement, transactional execution, and graph-based anomaly analysis<sup>[<xref ref-type="bibr" rid="B29">29</xref>,<xref ref-type="bibr" rid="B34">34</xref>,<xref ref-type="bibr" rid="B56">56</xref>]</sup>. These mechanisms target failures that are not visible from final outcomes alone, including policy violations, execution faults, state drift, and anomalous multi-agent behavior. Together, these mechanisms motivate a systems-level reliability perspective: mechanisms must coordinate across decision, execution, feedback, and monitoring layers rather than operate as isolated fixes.</p>
        <p><xref ref-type="fig" rid="fig6">Figure 6</xref> compares the six nonexclusive mechanism families by possible placement, observed artifacts, intervention authority, and remaining limitations. This comparison highlights the architectural obligations mitigation introduces. Prompt-level fixes remain useful, but they are insufficient for persistent systems whose failures propagate across modules and time. Protocol safeguards improve interface clarity, while layered runtime mechanisms add observability and enforcement. The central design challenge is balancing reliability coverage against complexity, overhead, and new interface risks.</p>
        <fig id="fig6" position="float">
          <label>Figure 6</label>
          <caption>
            <p>Six nonexclusive mechanism families compared by possible placement, observed artifacts, and intervention authority. Each row identifies an operational limit.</p>
          </caption>
          <graphic xlink:href="inect1013.fig.6.jpg"/>
        </fig>
        <p>Prompt-level techniques, protocol safeguards, and runtime controls protect different parts of the agent loop. Combining them requires explicit assumptions about contracts, visibility, and intervention authority.</p>
      </sec>
    </sec>
    <sec id="sec7">
      <title>DISCUSSION</title>
      <sec id="sec7-1">
        <title>Four findings from the architectural synthesis</title>
        <p>The preceding analysis supports four bounded findings. They summarize relationships among the reviewed concepts and examples, not pooled effect sizes, causal estimates, or claims about the prevalence of a mechanism family.</p>
        <p><bold>F1: reliability is conditional on an operational requirement and boundary.</bold> Sections “<bold>FAILURE MODES AND RELIABILITY CONSTRUCTS IN LLM AGENT FRAMEWORKS</bold>” and “<bold>Benchmarks, datasets, and gold standards for reliability analysis</bold>” show why task completion, policy conformance, state consistency, and recoverability cannot be substituted for one another. A reliability claim needs an explicit requirement, operating conditions, and an oracle with stated coverage. This explains why the same final outcome can receive different valid assessments under different constructs.</p>
        <p><bold>F2: fault origin, visible symptom, and intervention point can differ.</bold> The cross-layer chains in Section “<bold>Representative cross-layer failure chains</bold>” connect memory, control, execution, feedback, and oversight. They show why locating an error at the tool boundary does not establish that the tool caused it, and why repairing the last visible symptom may leave corrupted state intact. Diagnosis therefore needs linked evidence across transitions, followed by interventions evaluated at both the local boundary and the downstream state.</p>
        <p><bold>F3: a mechanism’s protection is bounded by what it can observe and enforce.</bold> Sections “<bold>Architectural premises and failure propagation</bold>” and “<bold>RELIABILITY MECHANISMS AND THEIR INTERFACES</bold>” connect mechanism families to artifacts, placement, and authority. A specification without an enforcement hook cannot block an action; a monitor without relevant state cannot validate it. Combining mechanisms expands protection only where their interfaces close an identifiable gap, and may leave shared blind spots intact.</p>
        <p><bold>F4: successful recovery and low fault incidence are different achievements.</bold> Sections “<bold>Reliability metrics and operational definitions</bold>” and “<bold>Representative cross-layer failure chains</bold>” show how retries or compensation can produce an acceptable endpoint after earlier failures. Evaluation must record the original deviation, whether it was detected, and whether the correction restored the required state within budget. Otherwise, an outcome gain cannot establish either fewer initial faults or safer recovery.</p>
      </sec>
      <sec id="sec7-2">
        <title>Challenges and open problems</title>
        <p><bold>Outcome-only evaluation limits architectural diagnosis.</bold> Outcome-based evaluations provide limited insight into the architectural causes of reliability failures in LLM-based agentic AI systems. A final success score does not by itself identify which architectural layer originated a deviation, and it can leave execution problems outside the endpoint criterion unresolved. As illustrated in Section “<bold>FAILURE MODES AND RELIABILITY CONSTRUCTS</bold>”, a system may confirm a booking even though no corresponding calendar event exists. A terminal-state check can expose the missing event, while linked tool and state traces are needed to identify the failed transition. This limitation is amplified in long-running settings, where errors may persist as hidden state inconsistencies or uncorrected execution faults. The distinctions in Section “<bold>FAILURE MODES AND RELIABILITY CONSTRUCTS</bold>” motivate checking state, intent, and recovery explicitly rather than inferring their validity from fluent output.</p>
        <p><bold>Missing boundary conditions undermine comparability.</bold> The reviewed protocols differ in conditions that affect interpretation: ToolLLM evaluation depends on live API behavior and, in some settings, oracle-retriever access, while τ-bench specifies a simulated user, task policy, and terminal reward<sup>[<xref ref-type="bibr" rid="B41">41</xref>,<xref ref-type="bibr" rid="B51">51</xref>]</sup>. These examples motivate comparing claims under explicitly stated operating conditions. The contrasting evidence types in Section “<bold>FAILURE MODES AND RELIABILITY CONSTRUCTS</bold>” show why these conditions must be stated before architectural weaknesses can be separated from differences in experimental setup. As LLM-based agentic AI systems become more integrated and long-running, reliability increasingly depends on whether the underlying framework can preserve control and state across extended interactions and recover from silent faults. Without explicit boundary conditions, reliability claims may be incomparable across studies and difficult to reproduce, especially when systems differ in tool permissions, feedback channels, or termination criteria.</p>
        <p><bold>Stochasticity and confounding require multi-run and interventionist evaluation.</bold> Repeated-run evaluation in MAESTRO examines variation in observed agent executions, and τ-bench measures success across multiple independent trials<sup>[<xref ref-type="bibr" rid="B36">36</xref>,<xref ref-type="bibr" rid="B51">51</xref>]</sup>. These designs motivate reporting variability when model sampling or external interactions can change a run. Reliable evaluation therefore requires multi-run reporting with variance or confidence summaries, rather than single-run or mean-only results, as discussed in Section “<bold>Protocol design, representativeness, and validity threats</bold>”. Causal attribution also requires targeted ablations and controlled interventions. Otherwise, disabling a component may inadvertently change context length, tool availability, retry behavior, or prompt structure, leading to misleading conclusions. Section “<bold>Evaluation evidence and diagnostic coverage</bold>” further distinguishes realistic evaluation from controlled assessment and recommends disclosing which traces and environment states are retained for inspection or replay. These factors make it essential to distinguish systematic failures from stochastic variation and protocol artifacts.</p>
        <p><bold>Tool ecosystems create silent execution errors and architectural mismatch.</bold> Tool-use studies distinguish failures in selection, invocation, execution, and returned results<sup>[<xref ref-type="bibr" rid="B13">13</xref>,<xref ref-type="bibr" rid="B26">26</xref>]</sup>. In our architectural analysis, a fluent summary cannot by itself establish that the corresponding external action completed correctly. For example, a system retrieving real-time data may receive an empty API response yet still generate a plausible but incorrect summary. As illustrated by the propagation analysis in Section “Architectural Interfaces and Failure Propagation”, a tool-result mismatch can affect later state or planning before it is detected. This challenge reflects a broader architectural mismatch: language-mediated control is flexible, but reliable tool execution requires precise schemas, complete telemetry, and enforceable interfaces. Section “<bold>Inputs, outputs, and integration patterns</bold>” shows that log-based monitoring, prompt rewriting, and specification enforcement each depend on different assumptions about observability and control. When traces are incomplete or schemas are unstable, these mechanisms may fail to detect or correct execution errors.</p>
      </sec>
      <sec id="sec7-3">
        <title>Opportunities and future directions</title>
        <p>The four findings identify corresponding evaluation targets: explicit operating conditions, linked failure traces, enforceable state and action contracts, and recovery measures that preserve the history of faults. <xref ref-type="table" rid="t8">Table 8</xref> maps these targets to proposed studies and evaluation criteria.</p>
        <p><bold>Specify the conditions of a reliability claim (F1).</bold> The gap identified in Sections “<bold>Benchmarks, datasets, and gold standards for reliability analysis</bold>” and “<bold>Protocol design, representativeness, and validity threats</bold>” is that a score can be reproduced without measuring the intended requirement, or can measure a useful requirement under incomparable conditions. A minimal scenario card should identify the task, construct, threat model, autonomy, permissions, horizon, stopping criteria, budget, and oracle coverage. Executable protocol specifications can then make those conditions inspectable. A useful test is whether independent implementations reproduce the same bounded claim and whether changing one declared condition produces an interpretable difference.</p>
		 <table-wrap id="t8">
          <label>Table 8</label>
          <caption>
            <p>Research gaps, proposed directions, and evaluation criteria</p>
          </caption>
          <table frame="hsides" rules="groups">
            <tbody>
              <tr>
                <td>
                  <bold>Gap and finding</bold>
                </td>
                <td>
                  <bold>Research direction</bold>
                </td>
                <td>
                  <bold>Evaluation criteria</bold>
                </td>
              </tr>
              <tr>
                <td>Underspecified requirements and incomparable boundaries (F1)</td>
                <td>Scenario cards and executable protocol specifications</td>
                <td>Replicable scores under stated permissions, budgets, stopping rules, and oracle coverage</td>
              </tr>
              <tr>
                <td>Local symptoms obscure propagated causes (F2)</td>
                <td>Linked traces and controlled cross-layer fault injection</td>
                <td>Detection and localization against known injected faults; downstream state checked after intervention</td>
              </tr>
              <tr>
                <td>Unobserved state and missing authority limit controls (F3)</td>
                <td>State contracts, provenance, and explicit enforcement interfaces</td>
                <td>Coverage of protected transitions, missed violations, false blocks, and transfer across interfaces</td>
              </tr>
              <tr>
                <td>Endpoint success hides incidence and unsafe retries (F4)</td>
                <td>Recovery-aware evaluation with side-effect accounting</td>
                <td>Separate fault, detection, restoration, duplicate-effect, latency, and cost measurements</td>
              </tr>
            </tbody>
          </table>
          <table-wrap-foot>
            <fn>
              <p>F1-F4 refer to the survey findings in Section “<bold>Four findings from the architectural synthesis</bold>”.</p>
            </fn>
          </table-wrap-foot>
        </table-wrap>
        <p><bold>Link observations across the propagation path (F2).</bold> The chains in Section “<bold>Representative cross-layer failure chains</bold>” expose an attribution gap between a visible error and its originating transition. Future benchmarks should combine correlated tool events and state snapshots with controlled perturbations such as stale memories, ambiguous acknowledgments, and untrusted feedback. Evaluations should test whether the monitor detects the deviation, identifies the affected transition, and verifies downstream repair. Injected faults provide a known intervention point, but cannot by themselves establish that natural deployment failures have the same distribution. An interaction-centric AIoT perspective similarly motivates checking observed responses and state transitions against specification-derived semantics, while treating physical context as a separate validation concern<sup>[<xref ref-type="bibr" rid="B76">76</xref>]</sup>.</p>
        <p><bold>Make state and enforcement contracts explicit (F3).</bold> The interface analysis in Section “<bold>Inputs, outputs, and integration patterns</bold>” shows that a mechanism cannot protect state or actions that it neither sees nor controls. State schemas, provenance records, version checks, and explicit action permissions are therefore concrete research targets. Comparing the same mechanism across interfaces with different visibility and authority would test which assumptions are essential for its protection. Reporting false blocks and integration cost alongside prevented violations is necessary to assess whether greater control remains usable. Related networking work makes these interface requirements concrete through user digital twins with customizable data schemas, attribute-specific updates, and physical-device feedback for network resource management<sup>[<xref ref-type="bibr" rid="B77">77</xref>]</sup>. TrustTwin provides a complementary AIoT example by comparing specification-guided predictions with executable-twin outcomes before committing candidate actions to physical devices<sup>[<xref ref-type="bibr" rid="B78">78</xref>]</sup>, while a digital-twin framework for autonomous robots similarly demonstrates how runtime monitors can continuously check action consistency and enforce safety and performance properties before actuation<sup>[<xref ref-type="bibr" rid="B79">79</xref>]</sup>.</p>
        <p><bold>Evaluate recovery without erasing the original fault (F4).</bold> The measurement gap in Section “<bold>Reliability metrics and operational definitions</bold>” is the conflation of final success with low failure incidence. Recovery studies should preserve records of initial faults and separately measure detection, restoration of required state, duplicate or irreversible side effects, and resource cost. Controlled timeout and partial-execution scenarios can test whether retries are safe. Where the environment does not support rollback or idempotency, escalation and bounded abandonment should be evaluated as legitimate outcomes rather than forced into a retry-success metric. Recent recoverable execution frameworks highlight the value of coordinated checkpoint-restore mechanisms for long-horizon agents<sup>[<xref ref-type="bibr" rid="B80">80</xref>]</sup>, whereas work on semantic rollback vulnerabilities emphasize that naive retries can inadvertently duplicate external side effects when exactly-once or retry-deduplication guarantees are not enforced at the tool boundary<sup>[<xref ref-type="bibr" rid="B81">81</xref>]</sup>. The research agenda follows four gaps: specify the claim, trace propagation, expose enforceable interfaces, and account for recovery separately from incidence. Each direction requires evidence at the relevant state or action boundary as well as at the final outcome.</p>
      </sec>
      <sec id="sec7-4">
        <title>Threats to validity</title>
        <p><bold>Selection, source status, and interpretation.</bold> The architectural synthesis supports comparisons of requirements and mechanisms, while its generalizability depends on the breadth and quality of the selected evidence. The analysis draws on studies of architectural failures, evaluation evidence, and interventions. Preprints, conceptual proposals, documentation, and empirical studies provide different kinds of support. Incomplete descriptions can leave publication status, implementation details, or evaluation conditions unresolved. Layer assignments and the representative failure chains are interpretive analyses, and the latter require empirical testing before supporting causal or frequency claims. These limitations constrain generalization of the four findings and preclude an effectiveness ranking across mechanism families.</p>
        <p><bold>Ambiguity in the construct of reliability.</bold> A central threat to this survey is the variation in how prior work defines and operationalizes “reliability.” Some studies emphasize task completion, while others focus on policy compliance, tool-use safety, state consistency, recoverability, or governance. As discussed in Section “<bold>FAILURE MODES AND RELIABILITY CONSTRUCTS</bold>”, these constructs imply different assumptions about the consistency and verifiability of system state, control, and feedback. This ambiguity makes synthesis difficult: reported improvements may not refer to the same underlying reliability property, and cross-study comparisons may overgeneralize beyond the measured construct.</p>
        <p><bold>Internal validity risks from hidden oracles and contamination.</bold> Training-evaluation contamination is an established concern in language-model evaluation<sup>[<xref ref-type="bibr" rid="B53">53</xref>]</sup>. In this survey, we additionally treat undeclared task-specific information exposed through prompts, tool outputs, documentation, or scaffolds as a potential confound. Section “<bold>Protocol design, representativeness, and validity threats</bold>” recommends disclosing those information channels so that a reported score can be interpreted under its actual conditions. Uncontrolled nondeterminism and selective reporting further complicate attribution. As a result, apparent reliability gains may reflect evaluation artifacts rather than substantive architectural improvements.</p>
        <p><bold>Outcome metrics masking architectural violations.</bold> Outcome metrics can overstate reliability when recovery mechanisms conceal upstream failures. A system may achieve high task success while repeatedly violating assumptions about control, state consistency, or tool execution. Section “<bold>Reliability metrics and operational definitions</bold>” shows that robust recovery, retries, or consensus can improve final scores without reducing the true incidence of faults. This creates a synthesis risk: techniques that improve apparent outcomes may be favored even if they leave the underlying framework brittle or shift failures into less observable layers.</p>
        <p><bold>Ground truth and replayability constraints in long-running systems.</bold> Ground-truth fidelity in long-running systems depends on oracle coverage, judgment validity, and access to the state being assessed. As discussed in Section “<bold>Evaluation evidence and diagnostic coverage</bold>”, the retained traces and environment states determine which claims can be inspected or replayed, affecting how architectural failures are separated from evaluator variance or changing deployment conditions. Evaluations that better match the target deployment may strengthen external validity, while causal interpretation remains limited when runs cannot be replayed, instrumented, or compared under controlled conditions.</p>
      </sec>
    </sec>
    <sec id="sec8">
      <title>CONCLUSION</title>
      <p>This survey presents an architectural synthesis of reliability in LLM-based agentic AI. Five layers locate the functions involved in a failure, while four premises - semantic fidelity, instruction stability, observability, and recoverability - make their operational assumptions explicit. The distinction between constructs, requirements, failure modes, observables, metrics, and oracles provides a common basis for comparing otherwise different reliability claims. Four findings organize the synthesis: reliability is conditional on a stated requirement and operating boundary; fault origin, symptom, and intervention point can differ; protection is bounded by visibility and enforcement authority; and successful recovery does not imply low initial fault incidence. The analytical cross-layer examples show how these relationships can arise, while the mechanism and evaluation comparisons identify what evidence would be needed to assess them in a concrete system. The survey does not establish their prevalence or provide a quantitative ranking of existing methods. Progress therefore requires explicit scenario specifications, linked traces, state and action contracts, and recovery measurements that retain the history of faults and side effects. These artifacts connect an architectural claim to observable evidence and clarify when a local safeguard can support an end-to-end reliability requirement.</p>
    </sec>
  </body>
  <back>
    <sec>
      <title>DECLARATIONS</title>
     <sec>
      <title>Authors’ contributions</title>
      <p>Conceptualization: Ma, X.; Tian, C.</p>
      <p>Methodology: Ma, X.; Zhang, Y.</p>
      <p>Investigation: Ma, X.; Wang, J.</p>
      <p>Data curation: Ma, X.; Wang, J.</p>
      <p>Formal analysis: Ma, X.</p>
      <p>Writing original draft: Ma, X.</p>
      <p>Writing review and editing: Ma, X.; Wang, J.; Zhang, Y.; Tian, C.</p>
      <p>Validation: Wang, J.; Zhang, Y.</p>
      <p>Supervision: Tian, C. </p>
      <p>Project administration: Tian, C.</p>
      <p>All authors read and approved the final manuscript.</p>
	  </sec>
      <sec>
        <title>Availability of data and materials</title>
      <p>Not applicable.</p>
	  </sec>
      <sec>
        <title>AI and AI-assisted tools statement</title>
      <p>During the preparation of this manuscript, OpenAI’s ChatGPT with GPT-5.6 Sol (2026-07-09) was used solely for language editing and refinement of figure layouts and color schemes. The tool did not influence the study design, data collection, analysis, interpretation, or scientific content of the work. All authors reviewed the AI-assisted content and take full responsibility for the accuracy, integrity, and final content of the manuscript.</p>
	  </sec>
      <sec>
        <title>Financial support and sponsorship</title>
      <p>None.</p>
	  </sec>
      <sec>
        <title>Conflicts of interest</title>
      <p>All authors declared that there are no conflicts of interest.</p>
	  </sec>
      <sec>
        <title>Ethical approval and consent to participate</title>
      <p>Not applicable.</p>
	  </sec>
      <sec>
        <title>Consent for publication</title>
      <p>Not applicable.</p>
	  </sec>
      <sec>
        <title>Copyright</title>
        <p>© The Author(s) 2026.</p>
      </sec>
    </sec>
   <ref-list>
      <ref id="B1">
        <label>1</label>
        <nlm-citation publication-type="web">
          <comment>OpenAI. OpenAI Agents SDK. <uri xlink:href="https://github.com/openai/openai-agents-python">https://github.com/openai/openai-agents-python</uri> (accessed 2026-10-28)</comment>
        </nlm-citation>
      </ref>
      <ref id="B2">
        <label>2</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Kumayama</surname>
              <given-names>KD</given-names>
            </name>
            <name>
              <surname>Chiruvolu</surname>
              <given-names>P</given-names>
            </name>
            <name>
              <surname>Weiss</surname>
              <given-names>D</given-names>
            </name>
          </person-group>
          <comment>AI agents: greater capabilities and enhanced risks. Reuters Legal News, 2025. 22 April 2025. <uri xlink:href="https://www.reuters.com/legal/legalindustry/ai-agents-greater-capabilities-enhanced-risks-2025-04-22/">https://www.reuters.com/legal/legalindustry/ai-agents-greater-capabilities-enhanced-risks-2025-04-22/</uri> (accessed 2026-10-28)</comment>
        </nlm-citation>
      </ref>
      <ref id="B3">
        <label>3</label>
        <nlm-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Wang</surname>
              <given-names>L</given-names>
            </name>
            <name>
              <surname>Ma</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Feng</surname>
              <given-names>X</given-names>
            </name>
            <etal />
          </person-group>
          <article-title>A survey on large language model based autonomous agents</article-title>
          <source>Front Comput Sci</source>
          <year>2024</year>
          <volume>18</volume>
          <fpage>186345</fpage>
          <pub-id pub-id-type="doi">10.1007/s11704-024-40231-1</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B4">
        <label>4</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Xu</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Cao</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Mo</surname>
              <given-names>G</given-names>
            </name>
            <etal />
          </person-group>
          <comment>LiveFMBench: unveiling the power and limits of agentic workflows in specification generation. arXiv 2026;arXiv:2605.01394. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2605.01394">https://doi.org/10.48550/arXiv.2605.01394</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B5">
        <label>5</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Lu</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Sun</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>Y</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Requirements development and formalization for reliable code generation: a multi-agent vision. In: 2025 40th IEEE/ACM International Conference on Automated Software Engineering (ASE); 2025 Nov 16-20; Seoul, Korea. IEEE; 2025. pp. 3932-7.</comment>
          <pub-id pub-id-type="doi">10.1109/ase63991.2025.00345</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B6">
        <label>6</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Yao</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Zhao</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>D</given-names>
            </name>
            <etal />
          </person-group>
          <comment>ReAct: synergizing reasoning and acting in language models. arXiv 2023;arXiv:2210.03629. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2210.03629">https://doi.org/10.48550/arXiv.2210.03629</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B7">
        <label>7</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Hu</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>T</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>Q</given-names>
            </name>
            <name>
              <surname>Mu</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Shao</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Luo</surname>
              <given-names>P</given-names>
            </name>
          </person-group>
          <comment>HiAgent: hierarchical working memory management for solving long-horizon agent tasks with large language model. In: Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers); 2025 Jun; Vienna, Austria. Stroudsburg, PA, USA: Association for Computational Linguistics; 2025. pp. 32779-98.</comment>
          <pub-id pub-id-type="doi">10.18653/v1/2025.acl-long.1575</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B8">
        <label>8</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Zhou</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Xu</surname>
              <given-names>FF</given-names>
            </name>
            <name>
              <surname>Zhu</surname>
              <given-names>H</given-names>
            </name>
            <etal />
          </person-group>
          <comment>WebArena: a realistic web environment for building autonomous agents. In: Proceeding of Twelfth International Conference on Learning Representations; 2024 May 7-11; Vienna, Austria. Curran Associates, Inc.; 2024. pp. 1-22. Available from: <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2024/file/4410c0711e9154a7a2d26f9b3816d1ef-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2024/file/4410c0711e9154a7a2d26f9b3816d1ef-Paper-Conference.pdf</uri> (accessed 2026-10-28)</comment>
        </nlm-citation>
      </ref>
      <ref id="B9">
        <label>9</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Cemri</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Pan</surname>
              <given-names>MZ</given-names>
            </name>
            <name>
              <surname>Yang</surname>
              <given-names>S</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Why Do Multi-Agent LLM Systems Fail? In: Belgrave D, Zhang C, Lin H, Pascanu R, Koniusz P, Ghassemi M, Chen N, Editors. Advances in Neural Information Processing Systems 38; 2025 Nov 30-Dec 7; San Diego, California, USA and Mexico City, Mexico. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2025. pp. 135676-729.</comment>
          <pub-id pub-id-type="doi">10.52202/085713-4082</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B10">
        <label>10</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Xie</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Zhu</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>X</given-names>
            </name>
            <etal />
          </person-group>
          <comment>From spark to fire: modeling and mitigating error cascades in LLM-based multi-agent collaboration. arXiv 2026;arXiv:2603.04474. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2603.04474">https://doi.org/10.48550/arXiv.2603.04474</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B11">
        <label>11</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Zhou</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Lu</surname>
              <given-names>Q</given-names>
            </name>
            <name>
              <surname>Zhao</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Zhu</surname>
              <given-names>L</given-names>
            </name>
          </person-group>
          <comment>SHIELDA: structured handling of exceptions in LLM-driven agentic workflows. arXiv 2025;arXiv:2508.07935. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2508.07935">https://doi.org/10.48550/arXiv.2508.07935</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B12">
        <label>12</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Arike</surname>
              <given-names>R</given-names>
            </name>
            <name>
              <surname>Donoway</surname>
              <given-names>E</given-names>
            </name>
            <name>
              <surname>Bartsch</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Hobbhahn</surname>
              <given-names>M</given-names>
            </name>
          </person-group>
          <comment>Technical report: evaluating goal drift in language model agents. arXiv 2025;arXiv:2505.02709. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2505.02709">https://doi.org/10.48550/arXiv.2505.02709</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B13">
        <label>13</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Huang</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Malwe</surname>
              <given-names>G</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>Z</given-names>
            </name>
          </person-group>
          <comment>When agents fail to act: a diagnostic framework for tool invocation reliability in multi-agent LLM systems. In: 2026 9th International Conference on Artificial Intelligence and Big Data (ICAIBD); 2026 May 29-31; Chengdu, China. IEEE; 2026. pp. 492-7.</comment>
          <pub-id pub-id-type="doi">10.1109/icaibd69640.2026.11637248</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B14">
        <label>14</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Huang</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Fang</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>Z</given-names>
            </name>
            <etal />
          </person-group>
          <comment>CRITICTOOL: evaluating self-critique capabilities of large language models in tool-calling error scenarios. In: Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing; 2025 Oct; Suzhou, China. Stroudsburg, PA, USA: Association for Computational Linguistics; 2025. pp. 26683-92.</comment>
          <pub-id pub-id-type="doi">10.18653/v1/2025.emnlp-main.1355</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B15">
        <label>15</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Zhu</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Wu</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>X</given-names>
            </name>
            <etal />
          </person-group>
          <comment>An empirical study of bugs in modern LLM agent frameworks. arXiv 2026;arXiv:2602.21806v1. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2602.21806">https://doi.org/10.48550/arXiv.2602.21806</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B16">
        <label>16</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Shi</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Yuan</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Tie</surname>
              <given-names>G</given-names>
            </name>
            <name>
              <surname>Zhou</surname>
              <given-names>P</given-names>
            </name>
            <name>
              <surname>Gong</surname>
              <given-names>N</given-names>
            </name>
            <name>
              <surname>Sun</surname>
              <given-names>L</given-names>
            </name>
          </person-group>
          <comment>Prompt injection attack to tool selection in LLM agents. In: Network and Distributed System Security Symposium; San Diego, CA, USA. Reston, VA: Internet Society; 2026.</comment>
          <pub-id pub-id-type="doi">10.14722/ndss.2026.230675</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B17">
        <label>17</label>
        <nlm-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Qu</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Dai</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Wei</surname>
              <given-names>X</given-names>
            </name>
            <etal />
          </person-group>
          <article-title>Tool learning with large language models: a survey</article-title>
          <source>Front. Comput. Sci.</source>
          <year>2025</year>
          <volume>19</volume>
          <fpage>198343</fpage>
          <pub-id pub-id-type="doi">10.1007/s11704-024-40678-2</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B18">
        <label>18</label>
        <nlm-citation publication-type="book">
          <person-group person-group-type="author">
            <name>
              <surname>Yehudai</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Eden</surname>
              <given-names>L</given-names>
            </name>
            <name>
              <surname>Li</surname>
              <given-names>A</given-names>
            </name>
            <etal />
          </person-group>
          <comment>A survey on evaluation of LLM-based agents. In: Findings of the Association for Computational Linguistics: ACL 2026; 2026 Jun; San Diego, California, United States. Stroudsburg, PA, USA: Association for Computational Linguistics; 2026. pp. 26690-714.</comment>
          <pub-id pub-id-type="doi">10.18653/v1/2026.findings-acl.1330</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B19">
        <label>19</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Mohammadi</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Li</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Lo</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Yip</surname>
              <given-names>W</given-names>
            </name>
          </person-group>
          <comment>Evaluation and benchmarking of LLM agents: a survey. In: KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining; Toronto ON Canada. New York, NY, USA: ACM; 2025. pp. 6129-39.</comment>
          <pub-id pub-id-type="doi">10.1145/3711896.3736570</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B20">
        <label>20</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Durante</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Huang</surname>
              <given-names>Q</given-names>
            </name>
            <name>
              <surname>Wake</surname>
              <given-names>N</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Agent AI: surveying the horizons of multimodal interaction, arXiv 2024;arXiv:2401.03568v2. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2401.03568">https://doi.org/10.48550/arXiv.2401.03568</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B21">
        <label>21</label>
        <nlm-citation publication-type="web">
          <comment>Significant Gravitas. AutoGPT. <uri xlink:href="https://github.com/Significant-Gravitas/AutoGPT">https://github.com/Significant-Gravitas/AutoGPT</uri> (accessed 2026-10-28)</comment>
        </nlm-citation>
      </ref>
      <ref id="B22">
        <label>22</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Nakajima</surname>
              <given-names>Y</given-names>
            </name>
          </person-group>
          <comment>BabyAGI, 2023. Original 2023 project, archived September 2024. <uri xlink:href="https://github.com/yoheinakajima/babyagi_archive">https://github.com/yoheinakajima/babyagi_archive</uri> (accessed 2026-10-28)</comment>
        </nlm-citation>
      </ref>
      <ref id="B23">
        <label>23</label>
        <nlm-citation publication-type="web">
          <comment>LangChain contributors. LangChain. <uri xlink:href="https://github.com/langchain-ai/langchain">https://github.com/langchain-ai/langchain</uri> (accessed 2026-10-28)</comment>
        </nlm-citation>
      </ref>
      <ref id="B24">
        <label>24</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Pathak</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>George</surname>
              <given-names>F</given-names>
            </name>
            <name>
              <surname>Kumar</surname>
              <given-names>H</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Detecting silent failures in multi-agentic AI trajectories (Work In Progress Paper). In: ICPE '26: 17th ACM/SPEC International Conference on Performance Engineering; Florence Italy. New York, NY, USA: ACM; 2026. pp. 33-9.</comment>
          <pub-id pub-id-type="doi">10.1145/3777911.3801104</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B25">
        <label>25</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Rabanser</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Kapoor</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Kirgis</surname>
              <given-names>P</given-names>
            </name>
            <name>
              <surname>Liu</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Utpala</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Narayanan</surname>
              <given-names>A</given-names>
            </name>
          </person-group>
          <comment>Towards a science of AI agent reliability. In: Proceedings of the 43rd International Conference on Machine Learning (Volume 306); 2026 July 6-11; Seoul, Korea. PMLR; 2026. pp. 102769-820. <uri xlink:href="https://raw.githubusercontent.com/mlresearch/v306/main/assets/rabanser26a/rabanser26a.pdf">https://raw.githubusercontent.com/mlresearch/v306/main/assets/rabanser26a/rabanser26a.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B26">
        <label>26</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Winston</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Just</surname>
              <given-names>R</given-names>
            </name>
          </person-group>
          <comment>A Taxonomy of failures in tool-augmented LLMs. In: 2025 IEEE/ACM International Conference on Automation of Software Test (AST); 2025 Apr 28-29; Ottawa, ON, Canada. IEEE; 2025. pp. 125-35.</comment>
          <pub-id pub-id-type="doi">10.1109/ast66626.2025.00019</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B27">
        <label>27</label>
        <nlm-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Sapkota</surname>
              <given-names>R</given-names>
            </name>
            <name>
              <surname>Roumeliotis</surname>
              <given-names>KI</given-names>
            </name>
            <name>
              <surname>Karkee</surname>
              <given-names>M</given-names>
            </name>
          </person-group>
          <article-title>AI agents <italic>vs.</italic> agentic AI: a conceptual taxonomy, applications and challenges</article-title>
          <source>Inform Fusion.</source>
          <year>2026</year>
          <volume>126</volume>
          <fpage>103599</fpage>
          <pub-id pub-id-type="doi">10.1016/j.inffus.2025.103599</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B28">
        <label>28</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Bullwinkel</surname>
              <given-names>B</given-names>
            </name>
            <name>
              <surname>Minnich</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Chawla</surname>
              <given-names>S</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Lessons from red teaming 100 generative AI products. arXiv 2025;arXiv:2501.07238. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2501.07238">https://doi.org/10.48550/arXiv.2501.07238</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B29">
        <label>29</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Wang</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Poskitt</surname>
              <given-names>CM</given-names>
            </name>
            <name>
              <surname>Sun</surname>
              <given-names>J</given-names>
            </name>
          </person-group>
          <comment>AgentSpec: Customizable Runtime Enforcement for Safe and Reliable LLM Agents. In: ICSE '26: 2026 IEEE/ACM 48th International Conference on Software Engineering; Rio de Janeiro Brazil. New York, NY, USA: ACM; 2026. pp. 2938-50.</comment>
          <pub-id pub-id-type="doi">10.1145/3744916.3764546</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B30">
        <label>30</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Syros</surname>
              <given-names>G</given-names>
            </name>
            <name>
              <surname>Suri</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Ginesin</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Nita-rotaru</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Oprea</surname>
              <given-names>A</given-names>
            </name>
          </person-group>
          <comment>SAGA: a security architecture for governing AI agentic systems. In: Network and Distributed System Security Symposium 2026; 2026 Feb 23-27; San Diego, CA, USA. Reston, VA: Internet Society; 2026.</comment>
          <pub-id pub-id-type="doi">10.14722/ndss.2026.230869</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B31">
        <label>31</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Khan</surname>
              <given-names>R</given-names>
            </name>
            <name>
              <surname>Joyce</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Habiba</surname>
              <given-names>M</given-names>
            </name>
          </person-group>
          <comment>AGENTSAFE: a unified framework for ethical assurance and governance in agentic. arXiv 2025;arXiv:2512.03180. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2512.03180">https://doi.org/10.48550/arXiv.2512.03180</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B32">
        <label>32</label>
        <nlm-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Zheng</surname>
              <given-names>L</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Yin</surname>
              <given-names>Q</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Zeng</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Tian</surname>
              <given-names>Y</given-names>
            </name>
          </person-group>
          <article-title>Rethinking the reliability of multi-agent system: a perspective from byzantine fault tolerance</article-title>
          <source>AAAI.</source>
          <year>2026</year>
          <volume>40</volume>
          <fpage>35012</fpage>
          <lpage>20</lpage>
          <pub-id pub-id-type="doi">10.1609/aaai.v40i41.40806</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B33">
        <label>33</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Doshi</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Hong</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Xu</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Kang</surname>
              <given-names>E</given-names>
            </name>
            <name>
              <surname>Kapravelos</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Kästner</surname>
              <given-names>C</given-names>
            </name>
          </person-group>
          <comment>Towards verifiably safe tool use for LLM agents. In: ICSE-NIER '26: 2026 IEEE/ACM 48th International Conference on Software Engineering; 2026 Apr 12-18; Rio de Janeiro, Brazil. New York, NY, USA: ACM; 2026. pp. 201-5.</comment>
          <pub-id pub-id-type="doi">10.1145/3786582.3786839</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B34">
        <label>34</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Li</surname>
              <given-names>P</given-names>
            </name>
            <name>
              <surname>Zou</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Wu</surname>
              <given-names>Z</given-names>
            </name>
            <etal />
          </person-group>
          <comment>SAFEFLOW: a principled protocol for trustworthy and transactional autonomous agent systems. arXiv 2025;arXiv:2506.07564v3. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2506.07564">https://doi.org/10.48550/arXiv.2506.07564</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B35">
        <label>35</label>
        <nlm-citation publication-type="book">
          <person-group person-group-type="author">
            <name>
              <surname>Zhan</surname>
              <given-names>Q</given-names>
            </name>
            <name>
              <surname>Liang</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Ying</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Kang</surname>
              <given-names>D</given-names>
            </name>
          </person-group>
          <comment>InjecAgent: benchmarking indirect prompt injections in tool-integrated large language model agents. In: Findings of the Association for Computational Linguistics ACL 2024; 2024 Aug 11-16; Bangkok, Thailand and virtual meeting. Stroudsburg, PA, USA: Association for Computational Linguistics; 2024. pp. 10471-506.</comment>
          <pub-id pub-id-type="doi">10.18653/v1/2024.findings-acl.624</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B36">
        <label>36</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Ma</surname>
              <given-names>T</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Anand</surname>
              <given-names>V</given-names>
            </name>
            <etal />
          </person-group>
          <comment>MAESTRO: multi-agent evaluation suite for testing, reliability, and observability. arXiv 2026;arXiv:2601.00481. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2601.00481">https://doi.org/10.48550/arXiv.2601.00481</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B37">
        <label>37</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Andriushchenko</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Souly</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Dziemian</surname>
              <given-names>M</given-names>
            </name>
            <etal />
          </person-group>
          <comment>AgentHarm: a benchmark for measuring harmfulness of LLM agents. In: Proceedings of the Thirteenth International Conference on Learning Representations; 2025 Apr 24-28; Singapore. International Conference on Learning Representations. 2025. pp. 1-36. <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2025/file/c493d23af93118975cdbc32cbe7323f5-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2025/file/c493d23af93118975cdbc32cbe7323f5-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B38">
        <label>38</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Shen</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Dai</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Yang</surname>
              <given-names>M</given-names>
            </name>
          </person-group>
          <comment>Security debt in LLM agent applications: a measurement study of vulnerabilities and mitigation trade-offs. In: 2025 40th IEEE/ACM International Conference on Automated Software Engineering (ASE); 2025 Nov 16-20; Seoul, Korea. IEEE; 2025. pp. 559-70.</comment>
          <pub-id pub-id-type="doi">10.1109/ase63991.2025.00053</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B39">
        <label>39</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Gajjar</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Subramaniakuppusamy</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Puthal</surname>
              <given-names>R</given-names>
            </name>
            <name>
              <surname>Ranaware</surname>
              <given-names>K</given-names>
            </name>
          </person-group>
          <comment>SecureFixAgent: a hybrid LLM agent for automated python static vulnerability repair. In: 2025 International Conference on Machine Learning and Applications (ICMLA); 2025 Dec 3-5; Boca Raton, FL, USA. IEEE; 2025. pp. 1390-5.</comment>
          <pub-id pub-id-type="doi">10.1109/icmla66185.2025.00212</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B40">
        <label>40</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Luo</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Dai</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Ni</surname>
              <given-names>C</given-names>
            </name>
            <etal />
          </person-group>
          <comment>AgentAuditor: human-level safety and security evaluation for LLM agents. In: Belgrave D, Zhang C, Lin H, Pascanu R, Koniusz P, Ghassemi M, Chen N, Editors. Advances in Neural Information Processing Systems 38; 2025 Nov 30-Dec 7; San Diego, California, USA and Mexico City, Mexico. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2025. pp. 48268-325.</comment>
          <pub-id pub-id-type="doi">10.52202/085713-1440</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B41">
        <label>41</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Qin</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Liang</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Ye</surname>
              <given-names>Y</given-names>
            </name>
            <etal />
          </person-group>
          <comment>ToolLLM: facilitating large language models to master 16000+ real-world APIs. In: Proceedings of the Twelfth International Conference on Learning Representations; 2024 May 7-11; Vienna, Austria. International Conference on Learning Representations. 2024. pp. 1-23. Available from: <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2024/file/28e50ee5b72e90b50e7196fde8ea260e-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2024/file/28e50ee5b72e90b50e7196fde8ea260e-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B42">
        <label>42</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Patil</surname>
              <given-names>SG</given-names>
            </name>
            <name>
              <surname>Mao</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Yan</surname>
              <given-names>F</given-names>
            </name>
            <etal />
          </person-group>
          <comment>The Berkeley function calling leaderboard (BFCL): from tool use to agentic evaluation of large language models. In: Proceedings of the 42nd International Conference on Machine Learning (Volume 267); 2025 Jul 13-19. PMLR, 2025; pp. 48371-92. <uri xlink:href="https://proceedings.mlr.press/v267/patil25a.html">https://proceedings.mlr.press/v267/patil25a.html</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B43">
        <label>43</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>He</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Yao</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Ma</surname>
              <given-names>K</given-names>
            </name>
            <etal />
          </person-group>
          <comment>WebVoyager: building an end-to-end web agent with large multimodal models. In: Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers); 2024 Aug 11-16; Bangkok, Thailand. Stroudsburg, PA, USA: Association for Computational Linguistics; 2024. pp. 6864-90.</comment>
          <pub-id pub-id-type="doi">10.18653/v1/2024.acl-long.371</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B44">
        <label>44</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Xie</surname>
              <given-names>T</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>J</given-names>
            </name>
            <etal />
          </person-group>
          <comment>OSWorld: benchmarking multimodal agents for open-ended tasks in real computer environments. In: Globerson A, Mackey L, Belgrave D, Fan A, Paquet U, Tomczak J, Zhang C, Editors. Advances in Neural Information Processing Systems 37; 2024 Dec 10-15; Vancouver, BC, Canada. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2024. pp. 52040-94.</comment>
          <pub-id pub-id-type="doi">10.52202/079017-1650</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B45">
        <label>45</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Jimenez</surname>
              <given-names>CE</given-names>
            </name>
            <name>
              <surname>Yang</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Wettig</surname>
              <given-names>A</given-names>
            </name>
            <etal />
          </person-group>
          <comment>SWE-bench: can language models resolve real-world GitHub issues? In: Proceeding of Twelfth International Conference on Learning Representations; 2024 May 7-11; Vienna, Austria. Curran Associates, Inc.; 2024. <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2024/file/edac78c3e300629acfe6cbe9ca88fb84-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2024/file/edac78c3e300629acfe6cbe9ca88fb84-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B46">
        <label>46</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Liu</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>H</given-names>
            </name>
            <etal />
          </person-group>
          <comment>AgentBench: evaluating LLMs as agents. In: Proceeding of Twelfth International Conference on Learning Representations; 2024 May 7-11; Vienna, Austria. Curran Associates, Inc.; 2024. <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2024/file/e9df36b21ff4ee211a8b71ee8b7e9f57-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2024/file/e9df36b21ff4ee211a8b71ee8b7e9f57-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B47">
        <label>47</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Mialon</surname>
              <given-names>G</given-names>
            </name>
            <name>
              <surname>Fourrier</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Swift</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Wolf</surname>
              <given-names>T</given-names>
            </name>
            <name>
              <surname>LeCun</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Scialom</surname>
              <given-names>T</given-names>
            </name>
          </person-group>
          <comment>GAIA: a benchmark for general AI assistants. In: Proceeding of Twelfth International Conference on Learning Representations; 2024 May 7-11; Vienna, Austria. Curran Associates, Inc.; 2024. Available from: <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2024/file/25ae35b5b1738d80f1f03a8713e405ec-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2024/file/25ae35b5b1738d80f1f03a8713e405ec-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B48">
        <label>48</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Ma</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Zhu</surname>
              <given-names>Z</given-names>
            </name>
            <etal />
          </person-group>
          <comment>AgentBoard: an analytical evaluation board of multi-turn LLM agents. In: Globerson A, Mackey L, Belgrave D, Fan A, Paquet U, Tomczak J, Zhang C, Editors. Advances in Neural Information Processing Systems 37; 2024 Dec 10-15; Vancouver, BC, Canada. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2024. pp. 74325-62.</comment>
          <pub-id pub-id-type="doi">10.52202/079017-2365</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B49">
        <label>49</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Debenedetti</surname>
              <given-names>E</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Balunovic</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Beurer-kellner</surname>
              <given-names>L</given-names>
            </name>
            <name>
              <surname>Fischer</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Tramèr</surname>
              <given-names>F</given-names>
            </name>
          </person-group>
          <comment>AgentDojo: a dynamic environment to evaluate prompt injection attacks and defenses for LLM agents. In: Globerson A, Mackey L, Belgrave D, Fan A, Paquet U, Tomczak J, Zhang C, Editors. Advances in Neural Information Processing Systems 37; 2024 Dec 10-15; Vancouver, BC, Canada. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2024. pp. 82895-920.</comment>
          <pub-id pub-id-type="doi">10.52202/079017-2636</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B50">
        <label>50</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Wu</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Chang</surname>
              <given-names>KW</given-names>
            </name>
            <name>
              <surname>Yu</surname>
              <given-names>D</given-names>
            </name>
          </person-group>
          <comment>LongMemEval: benchmarking chat assistants on long-term interactive memory. In: Proceedings of the Thirteenth International Conference on Learning Representations; 2025 Apr 24-28; Singapore. International Conference on Learning Representations. 2025. <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2025/file/d813d324dbf0598bbdc9c8e79740ed01-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2025/file/d813d324dbf0598bbdc9c8e79740ed01-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B51">
        <label>51</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Yao</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Shinn</surname>
              <given-names>N</given-names>
            </name>
            <name>
              <surname>Razavi</surname>
              <given-names>P</given-names>
            </name>
            <name>
              <surname>Narasimhan</surname>
              <given-names>K</given-names>
            </name>
          </person-group>
          <comment>τ-bench: a benchmark for tool-agent-user interaction in real-world domains. In: Proceedings of the Thirteenth International Conference on Learning Representations; 2025 Apr 24-28; Singapore. International Conference on Learning Representations. 2025. <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2025/file/1b126cc38b8638e07bef37e7b2bb72bf-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2025/file/1b126cc38b8638e07bef37e7b2bb72bf-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B52">
        <label>52</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Barres</surname>
              <given-names>V</given-names>
            </name>
            <name>
              <surname>Dong</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Ray</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Si</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Narasimhan</surname>
              <given-names>K</given-names>
            </name>
          </person-group>
          <comment>τ<sup>2</sup>-bench: evaluating conversational agents in a dual-control environment. arXiv 2025;arXiv:2506.07982v1. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2506.07982">https://doi.org/10.48550/arXiv.2506.07982</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B53">
        <label>53</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Liang</surname>
              <given-names>P</given-names>
            </name>
            <name>
              <surname>Bommasani</surname>
              <given-names>R</given-names>
            </name>
            <name>
              <surname>Lee</surname>
              <given-names>T</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Holistic evaluation of language models. <italic>Trans Mach Learn Res</italic> 2023. <uri xlink:href="https://openreview.net/forum?id=iO4LZibEqW">https://openreview.net/forum?id=iO4LZibEqW</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B54">
        <label>54</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Zheng</surname>
              <given-names>L</given-names>
            </name>
            <name>
              <surname>Chiang</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Sheng</surname>
              <given-names>Y</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Judging LLM-as-a-judge with MT-bench and chatbot arena. In: Oh A, Naumann T, Globerson A, Saenko K, Hardt M, Levine S, Editors. Advances in Neural Information Processing Systems 36; 2023 Dec 10-16; New Orleans, Louisiana, USA. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2023. pp. 46595-623.</comment>
          <pub-id pub-id-type="doi">10.52202/075280-2020</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B55">
        <label>55</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Hu</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>P</given-names>
            </name>
            <name>
              <surname>Zhao</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>Y</given-names>
            </name>
          </person-group>
          <comment>AgentSentinel: an end-to-end and real-time security defense framework for computer-use agents. In: CCS '25: ACM SIGSAC Conference on Computer and Communications Security; Taipei Taiwan. New York, NY, USA: ACM; 2025. pp. 3535-49.</comment>
          <pub-id pub-id-type="doi">10.1145/3719027.3765064</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B56">
        <label>56</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>He</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Wu</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Zhai</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Sun</surname>
              <given-names>K</given-names>
            </name>
          </person-group>
          <comment>SentinelAgent: graph-based anomaly detection in multi-agent systems. arXiv 2025;arXiv:2505.24201. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2505.24201">https://doi.org/10.48550/arXiv.2505.24201</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B57">
        <label>57</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Ro</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Qiu</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Goiri</surname>
              <given-names>Í</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Sherlock: reliable and efficient agentic workflow execution. arXiv 2025; arXiv:2511.00330. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2511.00330">https://doi.org/10.48550/arXiv.2511.00330</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B58">
        <label>58</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Liu</surname>
              <given-names>F</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Luo</surname>
              <given-names>J</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Make agent defeat agent: automatic detection of taint-style vulnerabilities in LLM-based agents. In: 34th USENIX Security Symposium (USENIX Security 25); 2025 Aug 13-15; Seattle, WA, USA: USENIX Association, 2025; pp. 3767-86. <uri xlink:href="https://www.usenix.org/conference/usenixsecurity25/presentation/liu-fengyu">https://www.usenix.org/conference/usenixsecurity25/presentation/liu-fengyu</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B59">
        <label>59</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Costa</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Köpf</surname>
              <given-names>B</given-names>
            </name>
            <name>
              <surname>Kolluri</surname>
              <given-names>A</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Securing AI agents with information-flow control. arXiv 2025; arXiv:2505.23643. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2505.23643">https://doi.org/10.48550/arXiv.2505.23643</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B60">
        <label>60</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Debenedetti</surname>
              <given-names>E</given-names>
            </name>
            <name>
              <surname>Shumailov</surname>
              <given-names>I</given-names>
            </name>
            <name>
              <surname>Fan</surname>
              <given-names>T</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Defeating prompt injections by design. arXiv 2025; arXiv:2503.18813. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2503.18813">https://doi.org/10.48550/arXiv.2503.18813</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B61">
        <label>61</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Chen</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Piet</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Sitawarin</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Wagner</surname>
              <given-names>D</given-names>
            </name>
          </person-group>
          <comment>StruQ: defending against prompt injection with structured queries. 34th USENIX Security Symposium (USENIX Security 25) ; 2025 Aug 13-15; Seattle, WA, USA: USENIX Association, 2025; pp. 2383-400. Available from: <uri xlink:href="https://www.usenix.org/conference/usenixsecurity25/presentation/chen-sizhe">https://www.usenix.org/conference/usenixsecurity25/presentation/chen-sizhe</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B62">
        <label>62</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Chen</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Zharmagambetov</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Mahloujifar</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Chaudhuri</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Wagner</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Guo</surname>
              <given-names>C</given-names>
            </name>
          </person-group>
          <comment>SecAlign: defending against prompt injection with preference optimization. In: CCS '25: ACM SIGSAC Conference on Computer and Communications Security; Taipei Taiwan. New York, NY, USA: ACM; 2025. pp. 2833-47.</comment>
          <pub-id pub-id-type="doi">10.1145/3719027.3744836</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B63">
        <label>63</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Shi</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>C</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Think twice before you act: protecting LLM agents against tool description poisoning via isolated planning. In: Proceedings of the 43rd International Conference on Machine Learning (Volume 306); 2026 July 6-11; Seoul, Korea. PMLR; 2026. pp. 112320-37. <uri xlink:href="https://openreview.net/forum?id=jiNw5AgBbw">https://openreview.net/forum?id=jiNw5AgBbw</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B64">
        <label>64</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Li</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Zhao</surname>
              <given-names>T</given-names>
            </name>
            <name>
              <surname>Zhou</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Hu</surname>
              <given-names>S</given-names>
            </name>
          </person-group>
          <comment>DORA: Dynamic optimization prompt for continuous reflection of LLM-based agent. In: Proceedings of the 31st International Conference on Computational Linguistics; 2025 Jan 19-24; Abu Dhabi, UAE: Association for Computational Linguistics, 2025; pp. 7546-57. <uri xlink:href="https://aclanthology.org/2025.coling-main.504/">https://aclanthology.org/2025.coling-main.504/</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B65">
        <label>65</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Gou</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Shao</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Gong</surname>
              <given-names>Y</given-names>
            </name>
            <etal />
          </person-group>
          <comment>CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing. In: Proceedings of the Twelfth International Conference on Learning Representations; 2024 May 7-11; Vienna, Austria. International Conference on Learning Representations. 2024. <uri xlink:href="https://proceedings.iclr.cc/paper_files/paper/2024/file/fef126561bbf9d4467dbb8d27334b8fe-Paper-Conference.pdf">https://proceedings.iclr.cc/paper_files/paper/2024/file/fef126561bbf9d4467dbb8d27334b8fe-Paper-Conference.pdf</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B66">
        <label>66</label>
        <nlm-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Zhao</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Huang</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Xu</surname>
              <given-names>Q</given-names>
            </name>
            <name>
              <surname>Lin</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Liu</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Huang</surname>
              <given-names>G</given-names>
            </name>
          </person-group>
          <article-title>ExpeL: LLM agents are experiential learners</article-title>
          <source>AAAI.</source>
          <year>2024</year>
          <volume>38</volume>
          <fpage>19632</fpage>
          <lpage>42</lpage>
          <pub-id pub-id-type="doi">10.1609/aaai.v38i17.29936</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B67">
        <label>67</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Patel</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Surendira</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>George</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Kapale</surname>
              <given-names>S</given-names>
            </name>
          </person-group>
          <comment>The six sigma agent: achieving enterprise-grade reliability in LLM systems through consensus-driven decomposed execution. arXiv 2026; arXiv:2601.22290. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2601.22290">https://doi.org/10.48550/arXiv.2601.22290</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B68">
        <label>68</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Liu</surname>
              <given-names>B</given-names>
            </name>
            <name>
              <surname>Jiang</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>X</given-names>
            </name>
            <etal />
          </person-group>
          <comment>LLM+P: empowering large language models with optimal planning proficiency. arXiv 2023; arXiv:2304.11477v3. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2304.11477">https://doi.org/10.48550/arXiv.2304.11477</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B69">
        <label>69</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Zhou</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Yan</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Shlapentokh-Rothman</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>YX</given-names>
            </name>
          </person-group>
          <comment>Language agent tree search unifies reasoning, acting, and planning in language models. In: Proceedings of the 41st International Conference on Machine Learning (Volume 235); 2024 Jul 21-27; Vienna, Austria. PMLR, 2024; pp. 62138-60. <uri xlink:href="https://proceedings.mlr.press/v235/zhou24r.html">https://proceedings.mlr.press/v235/zhou24r.html</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B70">
        <label>70</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Packer</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Wooders</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Lin</surname>
              <given-names>K</given-names>
            </name>
            <etal />
          </person-group>
          <comment>MemGPT: towards LLMs as operating systems. arXiv 2024; arXiv:2310.08560v2. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2310.08560">https://doi.org/10.48550/arXiv.2310.08560</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B71">
        <label>71</label>
        <nlm-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Zhong</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Guo</surname>
              <given-names>L</given-names>
            </name>
            <name>
              <surname>Gao</surname>
              <given-names>Q</given-names>
            </name>
            <name>
              <surname>Ye</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Wang</surname>
              <given-names>Y</given-names>
            </name>
          </person-group>
          <article-title>MemoryBank: enhancing large language models with long-term memory</article-title>
          <source>AAAI.</source>
          <year>2024</year>
          <volume>38</volume>
          <fpage>19724</fpage>
          <lpage>31</lpage>
          <pub-id pub-id-type="doi">10.1609/aaai.v38i17.29946</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B72">
        <label>72</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Xu</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Liang</surname>
              <given-names>Z</given-names>
            </name>
            <name>
              <surname>Mei</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Gao</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Tan</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>Y</given-names>
            </name>
          </person-group>
          <comment>A-Mem: agentic memory for LLM agents. In: Belgrave D, Zhang C, Lin H, Pascanu R, Koniusz P, Ghassemi M, Chen N, Editors. Advances in Neural Information Processing Systems 38; 2025 Nov 30-Dec 7; San Diego, California, USA and Mexico City, Mexico. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2025. pp. 20004-31.</comment>
          <pub-id pub-id-type="doi">10.52202/085713-0593</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B73">
        <label>73</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Wang</surname>
              <given-names>ZZ</given-names>
            </name>
            <name>
              <surname>Mao</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Fried</surname>
              <given-names>D</given-names>
            </name>
            <name>
              <surname>Neubig</surname>
              <given-names>G</given-names>
            </name>
          </person-group>
          <comment>Agent workflow memory. In: Proceedings of the 42nd International Conference on Machine Learning (Volume 267); 2025 Jul 13-19. PMLR, 2025; pp. 63897-911. Available from: <uri xlink:href="https://proceedings.mlr.press/v267/wang25bx.html">https://proceedings.mlr.press/v267/wang25bx.html</uri></comment>
        </nlm-citation>
      </ref>
      <ref id="B74">
        <label>74</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Schick</surname>
              <given-names>T</given-names>
            </name>
            <name>
              <surname>Dwivedi-Yu</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Dessi</surname>
              <given-names>R</given-names>
            </name>
            <etal />
          </person-group>
          <comment>Toolformer: language models can teach themselves to use tools. In: Oh A, Naumann T, Globerson A, Saenko K, Hardt M, Levine S, Editors. Advances in Neural Information Processing Systems 36; 2023 Dec 10-16; New Orleans, Louisiana, USA. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2023. pp. 68539-51.</comment>
          <pub-id pub-id-type="doi">10.52202/075280-2997</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B75">
        <label>75</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Shinn</surname>
              <given-names>N</given-names>
            </name>
            <name>
              <surname>Cassano</surname>
              <given-names>F</given-names>
            </name>
            <name>
              <surname>Gopinath</surname>
              <given-names>A</given-names>
            </name>
            <name>
              <surname>Narasimhan</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Yao</surname>
              <given-names>S</given-names>
            </name>
          </person-group>
          <comment>Reflexion: language agents with verbal reinforcement learning. In: Oh A, Naumann T, Globerson A, Saenko K, Hardt M, Levine S, Editors. Advances in Neural Information Processing Systems 36; 2023 Dec 10-16; New Orleans, Louisiana, USA. San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS); 2023. pp. 8634-52.</comment>
          <pub-id pub-id-type="doi">10.52202/075280-0377</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B76">
        <label>76</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Ma</surname>
              <given-names>X</given-names>
            </name>
          </person-group>
          <comment>Towards Trustworthy AIoT systems: an interaction-centric perspective. In: MobiSys Companion '26: 24th Annual International Conference on Mobile Systems, Applications and Services Companion; University of Cambridge Cambridge United Kingdom. New York, NY, USA: ACM; 2026. pp. 148-9.</comment>
          <pub-id pub-id-type="doi">10.1145/3812835.3814839</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B77">
        <label>77</label>
        <nlm-citation publication-type="journal">
          <person-group person-group-type="author">
            <name>
              <surname>Zhou</surname>
              <given-names>C</given-names>
            </name>
            <name>
              <surname>Hu</surname>
              <given-names>S</given-names>
            </name>
            <name>
              <surname>Gao</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Huang</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Zhuang</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Shen</surname>
              <given-names>X</given-names>
            </name>
          </person-group>
          <article-title>User-centric immersive communications in 6G: a data-oriented framework via digital twin</article-title>
          <source>IEEE Wireless Commun.</source>
          <year>2025</year>
          <volume>32</volume>
          <fpage>122</fpage>
          <lpage>9</lpage>
          <pub-id pub-id-type="doi">10.1109/mwc.001.2400408</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B78">
        <label>78</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Ma</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Lu</surname>
              <given-names>H</given-names>
            </name>
            <name>
              <surname>Dai</surname>
              <given-names>X</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>Y</given-names>
            </name>
          </person-group>
          <comment>TrustTwin: world-model-enhanced twins for trustworthy AIoT decision making. In: 2026 IEEE/CIC International Conference on Communications in China (ICCC); 2026 Aug 7-9; Wuhan, China. IEEE; 2026. pp. 271-6.</comment>
          <pub-id pub-id-type="doi">10.1109/iccc70295.2026.11680506</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B79">
        <label>79</label>
        <nlm-citation publication-type="confproc">
          <person-group person-group-type="author">
            <name>
              <surname>Betzer</surname>
              <given-names>JS</given-names>
            </name>
            <name>
              <surname>Boudjadar</surname>
              <given-names>J</given-names>
            </name>
            <name>
              <surname>Frasheri</surname>
              <given-names>M</given-names>
            </name>
            <name>
              <surname>Talasila</surname>
              <given-names>P</given-names>
            </name>
          </person-group>
          <comment>Digital twin enabled runtime verification for autonomous mobile robots under uncertainty. In: 2024 28th International Symposium on Distributed Simulation and Real Time Applications (DS-RT); 2024 Oct 7-9; Urbino, Italy. IEEE; 2024. pp. 10-7.</comment>
          <pub-id pub-id-type="doi">10.1109/ds-rt62209.2024.00012</pub-id>
        </nlm-citation>
      </ref>
      <ref id="B80">
        <label>80</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Zhuang</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Chen</surname>
              <given-names>K</given-names>
            </name>
            <name>
              <surname>Duan</surname>
              <given-names>Y</given-names>
            </name>
            <etal />
          </person-group>
          <comment>AgentRewind: recoverable execution for long-horizon LLM agents. arXiv 2026; arXiv:2608.14380. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2608.14380">https://doi.org/10.48550/arXiv.2608.14380</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
      <ref id="B81">
        <label>81</label>
        <nlm-citation publication-type="web">
          <person-group person-group-type="author">
            <name>
              <surname>Zheng</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Yang</surname>
              <given-names>Y</given-names>
            </name>
            <name>
              <surname>Zhang</surname>
              <given-names>W</given-names>
            </name>
            <name>
              <surname>Quinn</surname>
              <given-names>A</given-names>
            </name>
          </person-group>
          <comment>ACRFence: preventing semantic rollback attacks in agent checkpoint-restore. arXiv 2026; arXiv:2603.20625. Available online: <uri xlink:href="https://doi.org/10.48550/arXiv.2603.20625">https://doi.org/10.48550/arXiv.2603.20625</uri> [accessed 28 October 2026]</comment>
        </nlm-citation>
      </ref>
    </ref-list>
  </back>
</article>