agentdebugx 0.2.6__tar.gz → 0.2.8__tar.gz

{agentdebugx-0.2.6 → agentdebugx-0.2.8}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: agentdebugx
-Version: 0.2.6
+Version: 0.2.8
 Summary: Portable error analysis, tracing, and recovery framework for agentic AI systems. Import as `agentdebug`.
 License: MIT
 License-File: LICENSE

{agentdebugx-0.2.6 → agentdebugx-0.2.8}/docs/22_industry_track_paper_eval_plan.md

@@ -37,14 +37,14 @@ Examples worth emulating:
 
 For AgentDebugX, the paper should therefore be framed as:
 
-> A deployment-oriented debugging layer for agentic NLP systems, evaluated on
+> A deployment-oriented debugging framework for agentic NLP systems, evaluated on
 > whether it makes failures observable, attributable, shareable, and easier for
 > humans to fix.
 
 The central claim should not be "we beat every attributor." A stronger claim
 for the Industry Track is:
 
-> AgentDebugX provides the missing operating layer between raw agent traces and
+> AgentDebugX provides the missing operational bridge between raw agent traces and
 > actionable debugging workflows: aligned native/error traces, taxonomy-backed
 > reports, Error Hub bundles, and cost-aware analysis profiles.
 

{agentdebugx-0.2.6 → agentdebugx-0.2.8}/docs/23_status_v0_2.md

@@ -21,6 +21,8 @@ the forward-looking plan; this doc is the rear-view mirror.
 | Attribution | `agentdebug.attribution.AllAtOnceAttributor` | ✅ stable | mocked LLM + fallback |
 | Attribution | `agentdebug.attribution.StepByStepAttributor` | ✅ **new 0.2.2** | scripted-LLM + fallback |
 | Attribution | `agentdebug.attribution.BinarySearchAttributor` | ✅ **new 0.2.3** | oracle-LLM logarithmic convergence + fallback + render elision |
+| Attribution | `agentdebug.attribution.CounterfactualAttributor` | ✅ **new 0.2.7** | scripted-rescue-prob ranking + candidate selection priority (findings → errors → tail) + dual fallback (no candidates / silent LLM) |
+| Attribution | `agentdebug.attribution.SBFLAttributor` (Tarantula / Ochiai / DStar) | ✅ **new 0.2.8** | signature design + ranking on synthetic corpus + 3 formulas + dual fallback + edge cases. Model-free: zero LLM cost at inference. |
 | Recovery | `agentdebug.recovery.ReflexionSuggestion` | ✅ stable | per-finding + empty |
 | Recovery | `agentdebug.recovery.CriticRecoverer` + `VerifierSpec` registry | ✅ **new 0.2.3** | 5 family-matched verifier templates; dedup + custom-override |
 | DeepDebug | `agentdebug.deep.DeepDebugAnalyzer` | ✅ stable | full loop + silent LLM |
@@ -47,8 +49,8 @@ across 32 source files.
 | [06_detectors.md](./06_detectors.md) | `trajectory_perplexity` (TrajAD) | needs token-level LM perplexity API or embedding model + baseline calibration | v0.3 |
 | [06_detectors.md](./06_detectors.md) | `topic_drift` (embedding cosine) | needs embedding client; consider reusing `OpenAICompatClient` `/embeddings` | v0.3 |
 | [06_detectors.md](./06_detectors.md) | LTL spec monitors | requires user-supplied spec or LLM-synthesized monitors; gated on RV research | v1.2 |
-| [07_attribution.md](./07_attribution.md) | `CounterfactualAttributor` | requires re-rolling agent actions; framework-replay dependent | v0.3 |
-| [07_attribution.md](./07_attribution.md) | `SBFLAttributor` (Tarantula/Ochiai) | needs corpus of passing + failing traces of same task; gated on Hub adoption | v0.4 |
+| [07_attribution.md](./07_attribution.md) | `CounterfactualAttributor` — *real* replay variant | true re-rollout requires framework-specific replay surface; the v0.2.7 LLM-simulated variant ships now, the real-replay variant is gated on adapter support (LangGraph checkpointer / OpenHands rewind) | v0.4 |
+| [07_attribution.md](./07_attribution.md) | `SBFLAttributor` — *corpus* | shipped in 0.2.8 (`tarantula`/`ochiai`/`dstar`); awaiting paired-trace adoption to gather a useful corpus in production | corpus tooling deferred to v0.4 |
 | [07_attribution.md](./07_attribution.md) | `DeltaDebugAttributor` (Zeller) | same replay constraint | v0.3 |
 | [07_attribution.md](./07_attribution.md) | `EnsembleAttributor` | trivial once Counterfactual lands; awaits Counterfactual | v0.3 |
 | [08_recovery.md](./08_recovery.md) | `SelfRefineLoop` | small but needs a generator-critic-refiner orchestration | v0.3 |

{agentdebugx-0.2.6 → agentdebugx-0.2.8}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "agentdebugx"
-version = "0.2.6"
+version = "0.2.8"
 description = "Portable error analysis, tracing, and recovery framework for agentic AI systems. Import as `agentdebug`."
 authors = ["ULab @ UIUC <ulab@illinois.edu>"]
 license = "MIT"

{agentdebugx-0.2.6 → agentdebugx-0.2.8}/src/agentdebug/__init__.py

@@ -15,7 +15,9 @@ from agentdebug.attribution import (
     Attributor,
     BinarySearchAttributor,
     Blame,
+    CounterfactualAttributor,
     HeuristicAttributor,
+    SBFLAttributor,
     StepByStepAttributor,
 )
 from agentdebug.detectors import (
@@ -63,12 +65,14 @@ __all__ = [
     'BusEvent',
     'BinarySearchAttributor',
     'CascadeFrame',
+    'CounterfactualAttributor',
     'CriticRecoverer',
     'DEFAULT_VERIFIERS',
     'Detector',
     'DetectorConfig',
     'RepeatedStateDetector',
     'RepeatedToolCallDetector',
+    'SBFLAttributor',
     'StepByStepAttributor',
     'StepCountLimitDetector',
     'VerifierSpec',
@@ -96,4 +100,4 @@ __all__ = [
     'get_failure_mode',
 ]
 
-__version__ = '0.2.6'
+__version__ = '0.2.8'

{agentdebugx-0.2.6 → agentdebugx-0.2.8}/src/agentdebug/attribution.py

@@ -566,8 +566,378 @@ def _EVENT_ELLIPSIS(count: int) -> _EllipsisEvent:
     return _EllipsisEvent(count=count)
 
 
+_COUNTERFACTUAL_SYSTEM_PROMPT = """You are AgentDebugX-Attributor running an
+LLM-simulated counterfactual replay (AgenTracer-style, arXiv:2509.03312).
+
+You will be given the goal, the full trajectory, and ONE CANDIDATE STEP. Your
+job is to estimate whether the agent would have succeeded if THAT step had
+been done correctly — leaving everything else the same. This isolates the
+step's causal contribution to the failure.
+
+CRITICAL OUTPUT RULES (these maximize the chance your reply parses):
+1. Output ONLY a JSON object. No prose before/after. No markdown fences.
+2. Keep "rationale" to ONE short sentence (<= 200 chars).
+3. Do NOT include newlines inside string values.
+4. Emit the JSON object COMPLETE.
+
+Schema:
+{
+  "rescue_probability": <0..1>,
+  "confidence": <0..1>,
+  "rationale": "<short>",
+  "would_block_downstream_failures": true | false
+}
+
+Higher rescue_probability = correcting this step would more likely have
+rescued the run; this step is therefore more responsible for the failure.
+"""
+
+
+class CounterfactualAttributor:
+    """LLM-simulated counterfactual replay.
+
+    For each of K candidate steps (top-K from prior findings, or
+    error-bearing events, or the tail of the trajectory) ask the LLM:
+    "if this step had been correct, would the rest of the trajectory still
+    fail?" Steps with the highest rescue-probability become the top blame
+    hypotheses. Costs O(K) LLM calls — comparable to AllAtOnce, with a
+    stronger causal claim per probe.
+
+    This is *simulated* counterfactual, not real re-rollout — strictly
+    weaker than AgenTracer's actual replay, but framework-independent and
+    runnable today against any LLM. When the underlying framework gains a
+    real replay surface (LangGraph checkpointer, OpenHands rewind), wire
+    that in as an alternative ``replay_fn`` and the algorithm carries over.
+    """
+
+    id = 'counterfactual'
+
+    def __init__(
+        self,
+        llm: LLMClient,
+        *,
+        max_candidates: int = 5,
+        max_tokens: int = 2048,
+        fallback: Optional[Attributor] = None,
+    ) -> None:
+        self.llm = llm
+        self.max_candidates = max_candidates
+        self.max_tokens = max_tokens
+        self.fallback: Attributor = fallback or HeuristicAttributor()
+
+    def attribute(
+        self,
+        trajectory: AgentTrajectory,
+        findings: List[FailureFinding],
+    ) -> AttributionResult:
+        candidates = self._pick_candidates(trajectory, findings)
+        if not candidates:
+            return self.fallback.attribute(trajectory, findings)
+        ranked: List[tuple[AgentEvent, Dict[str, Any]]] = []
+        for evt in candidates:
+            verdict = self._ask_counterfactual(trajectory, evt)
+            if verdict is None:
+                continue
+            ranked.append((evt, verdict))
+        if not ranked:
+            return self.fallback.attribute(trajectory, findings)
+        # Sort by rescue_probability desc, tie-break by confidence.
+        ranked.sort(
+            key=lambda r: (
+                -self._coerce_float(r[1].get('rescue_probability'), 0.0),
+                -self._coerce_float(r[1].get('confidence'), 0.0),
+            )
+        )
+        hypotheses: List[Blame] = []
+        for evt, verdict in ranked:
+            hypotheses.append(Blame(
+                span_id=evt.event_id,
+                step_index=evt.step_index,
+                agent_name=evt.agent_name,
+                confidence=self._coerce_float(verdict.get('rescue_probability'), 0.0),
+                rationale=(
+                    str(verdict.get('rationale') or 'no rationale')
+                    + f' [rescue_probability={verdict.get("rescue_probability")}]'
+                ),
+                evidence=[
+                    f'event_id={evt.event_id}',
+                    f'step={evt.step_index}',
+                ],
+                sources=[self.id],
+            ))
+        return AttributionResult(
+            method=self.id,
+            hypotheses=hypotheses,
+            raw={'candidates_probed': len(ranked)},
+        )
+
+    def _pick_candidates(
+        self,
+        trajectory: AgentTrajectory,
+        findings: List[FailureFinding],
+    ) -> List[AgentEvent]:
+        events_by_id = {e.event_id: e for e in trajectory.events}
+        candidates: List[AgentEvent] = []
+        seen: set[str] = set()
+        # 1. Prior findings (the judge already nominated suspects).
+        for f in findings:
+            evt = events_by_id.get(f.event_id) if f.event_id else None
+            if evt is not None and evt.event_id not in seen:
+                candidates.append(evt)
+                seen.add(evt.event_id)
+                if len(candidates) >= self.max_candidates:
+                    return candidates
+        # 2. Events that recorded an error directly.
+        for evt in trajectory.events:
+            if evt.error and evt.event_id not in seen:
+                candidates.append(evt)
+                seen.add(evt.event_id)
+                if len(candidates) >= self.max_candidates:
+                    return candidates
+        # 3. Fallback: tail of the trajectory (failure most often manifests there).
+        for evt in reversed(trajectory.events):
+            if evt.event_id not in seen:
+                candidates.append(evt)
+                seen.add(evt.event_id)
+                if len(candidates) >= self.max_candidates:
+                    return candidates
+        return candidates
+
+    def _ask_counterfactual(
+        self, trajectory: AgentTrajectory, candidate: AgentEvent,
+    ) -> Optional[Dict[str, Any]]:
+        events_doc = '\n'.join(
+            f'event_id={e.event_id} step={e.step_index} agent={e.agent_name} '
+            f'type={getattr(e.event_type, "value", e.event_type)} '
+            f'output={str(e.output)[:200]} error={str(e.error)[:200]}'
+            for e in trajectory.events
+        )
+        user = (
+            f'GOAL: {trajectory.goal!r}\n'
+            f'FRAMEWORK: {trajectory.framework!r}\n\n'
+            f'FULL TRAJECTORY:\n{events_doc}\n\n'
+            f'CANDIDATE STEP TO COUNTERFACTUALLY CORRECT:\n'
+            f'  event_id={candidate.event_id}\n'
+            f'  step={candidate.step_index} agent={candidate.agent_name}\n'
+            f'  module={candidate.module}\n'
+            f'  input={str(candidate.input)[:300]}\n'
+            f'  output={str(candidate.output)[:300]}\n'
+            f'  error={str(candidate.error)[:300]}\n\n'
+            f'Question: if this step had been DONE CORRECTLY, what is the '
+            f'probability the run would have succeeded?'
+        )
+        try:
+            result = self.llm.complete(
+                messages=[
+                    {'role': 'system', 'content': _COUNTERFACTUAL_SYSTEM_PROMPT},
+                    {'role': 'user', 'content': user},
+                ],
+                max_tokens=self.max_tokens,
+            )
+        except Exception as exc:  # pragma: no cover
+            LOG.warning('counterfactual probe failed at event=%s: %s',
+                        candidate.event_id, exc)
+            return None
+        parsed = extract_json_block(result.text)
+        if parsed is None:
+            return None
+        return cast(Dict[str, Any], parsed)
+
+    @staticmethod
+    def _coerce_float(value: Any, default: float) -> float:
+        try:
+            return float(value)
+        except (TypeError, ValueError):
+            return default
+
+
+class SBFLAttributor:
+    """Spectrum-based fault localization (Tarantula / Ochiai / DStar).
+
+    Model-free. Costs ZERO LLM calls at inference time. The price: it needs
+    a corpus of *other* traces of the same task (a mix of passing and
+    failing). For each step in the failing trace under attribution, compute
+    suspiciousness from how often that step's signature appears in failing
+    vs passing traces of the same task.
+
+    Signature design — the cross-trace identity of a "step":
+
+      (agent_name, event_type, module, normalized_io_hash)
+
+    The normalized I/O hash collapses whitespace + truncates to 120 chars
+    so semantically-equivalent step executions match across runs (a
+    `search` call with the same query produces the same signature even if
+    the wrapping prompt differs trace-to-trace).
+
+    Suspiciousness formulas:
+
+      Tarantula = (ef / nf) / (ef / nf + ep / np)
+      Ochiai    = ef / sqrt((ef + ep) * (nf))
+      DStar*    = ef^* / (ep + (nf - ef))     [* = exponent, default 2]
+
+    where for the candidate step:
+      ef = # failing corpus traces containing this signature
+      ep = # passing corpus traces containing this signature
+      nf = total failing traces in the corpus
+      np = total passing traces in the corpus
+
+    Reference: Jones & Harrold (Tarantula, ICSE 2002); Abreu et al.
+    (Ochiai, TR 2007); Wong et al. (DStar, IEEE TR 2014).
+    """
+
+    id = 'sbfl'
+
+    def __init__(
+        self,
+        *,
+        passing_corpus: List[AgentTrajectory],
+        failing_corpus: List[AgentTrajectory],
+        formula: str = 'ochiai',
+        dstar_exponent: float = 2.0,
+        top_k: int = 5,
+        fallback: Optional[Attributor] = None,
+    ) -> None:
+        if formula not in {'tarantula', 'ochiai', 'dstar'}:
+            raise ValueError(
+                f"Unknown SBFL formula {formula!r}; "
+                "use 'tarantula', 'ochiai', or 'dstar'"
+            )
+        self.passing_corpus = list(passing_corpus)
+        self.failing_corpus = list(failing_corpus)
+        self.formula = formula
+        self.dstar_exponent = dstar_exponent
+        self.top_k = top_k
+        self.fallback: Attributor = fallback or HeuristicAttributor()
+        # Precompute signature presence per trace so attribution is O(N) over
+        # the candidate's events × O(corpus_size).
+        self._sigs_in_failing: List[set[str]] = [
+            _signatures_for(t) for t in self.failing_corpus
+        ]
+        self._sigs_in_passing: List[set[str]] = [
+            _signatures_for(t) for t in self.passing_corpus
+        ]
+
+    def attribute(
+        self,
+        trajectory: AgentTrajectory,
+        findings: List[FailureFinding],
+    ) -> AttributionResult:
+        nf = len(self._sigs_in_failing)
+        np = len(self._sigs_in_passing)
+        if nf == 0 and np == 0:
+            return self.fallback.attribute(trajectory, findings)
+
+        scored: List[tuple[AgentEvent, float, int, int]] = []
+        for evt in trajectory.events:
+            sig = _signature_for(evt)
+            if not sig:
+                continue
+            ef = sum(1 for s in self._sigs_in_failing if sig in s)
+            ep = sum(1 for s in self._sigs_in_passing if sig in s)
+            score = _suspiciousness(
+                ef=ef, ep=ep, nf=max(nf, 1), np=max(np, 1),
+                formula=self.formula, dstar_exponent=self.dstar_exponent,
+            )
+            scored.append((evt, score, ef, ep))
+
+        if not scored:
+            return self.fallback.attribute(trajectory, findings)
+
+        # Sort by suspiciousness desc, tie-break by step index asc (earlier wins).
+        scored.sort(key=lambda r: (-r[1], r[0].step_index or 10**9))
+        hypotheses: List[Blame] = []
+        for evt, score, ef, ep in scored[: self.top_k]:
+            if score <= 0.0:
+                continue  # nothing suspicious about this step
+            hypotheses.append(Blame(
+                span_id=evt.event_id,
+                step_index=evt.step_index,
+                agent_name=evt.agent_name,
+                confidence=min(1.0, max(0.0, score)),
+                rationale=(
+                    f'{self.formula} suspiciousness={score:.3f} '
+                    f'(ef={ef}/{nf}, ep={ep}/{np})'
+                ),
+                evidence=[
+                    f'signature occurs in {ef}/{nf} failing and {ep}/{np} '
+                    f'passing corpus traces',
+                ],
+                sources=[self.id],
+            ))
+        if not hypotheses:
+            return self.fallback.attribute(trajectory, findings)
+        return AttributionResult(
+            method=self.id,
+            hypotheses=hypotheses,
+            raw={
+                'formula': self.formula,
+                'corpus_size': {'failing': nf, 'passing': np},
+                'scored_events': len(scored),
+            },
+        )
+
+
+def _signature_for(event: AgentEvent) -> Optional[str]:
+    """Cross-trace identity of a step. Returns None for events that should
+    not contribute to suspiciousness:
+
+      * ``run.start`` / ``run.end`` — trajectory lifecycle markers.
+      * ``error`` events emitted by ``agent_name='system'`` — these are the
+        synthetic markers from ``AgentDebug.finish_trace(success=False)`` and
+        are present in every failed trace; they would saturate suspiciousness
+        without revealing anything about the cause.
+    """
+    et = getattr(event.event_type, 'value', event.event_type)
+    if et in {'run.start', 'run.end'}:
+        return None
+    if et == 'error' and (event.agent_name or '') == 'system':
+        return None
+    payload = ' '.join(str(event.output or event.input or '').split())[:120]
+    return '|'.join([
+        str(et),
+        str(event.agent_name or ''),
+        str(event.module or ''),
+        payload,
+    ])
+
+
+def _signatures_for(trajectory: AgentTrajectory) -> set[str]:
+    out: set[str] = set()
+    for evt in trajectory.events:
+        sig = _signature_for(evt)
+        if sig:
+            out.add(sig)
+    return out
+
+
+def _suspiciousness(
+    *, ef: int, ep: int, nf: int, np: int,
+    formula: str, dstar_exponent: float,
+) -> float:
+    import math
+    if formula == 'tarantula':
+        # Defined as 0 when the step never appears in failing traces.
+        if ef == 0:
+            return 0.0
+        # Defensive: nf>=1 by caller.
+        f_rate = ef / nf
+        p_rate = (ep / np) if np > 0 else 0.0
+        denom = f_rate + p_rate
+        return f_rate / denom if denom > 0 else 0.0
+    if formula == 'ochiai':
+        denom = math.sqrt((ef + ep) * nf)
+        return (ef / denom) if denom > 0 else 0.0
+    # dstar
+    if ep == 0 and (nf - ef) == 0:
+        return float('inf') if ef > 0 else 0.0
+    denom = ep + (nf - ef)
+    if denom == 0:
+        return 0.0
+    return float((ef ** dstar_exponent) / denom)
+
+
 __all__ = [
     'Attributor', 'Blame', 'AttributionResult',
     'HeuristicAttributor', 'AllAtOnceAttributor', 'StepByStepAttributor',
-    'BinarySearchAttributor',
+    'BinarySearchAttributor', 'CounterfactualAttributor', 'SBFLAttributor',
 ]