Strongest AI agent verifies only 27 of 43 code repositories
Passing 87 percent of individual proofs is not enough; whole-repo proofs stall without shared lemma libraries.
· “Vero: Can AI Agents Build Formally Verified Software Repositories?”
Software Engineering
Covers design tools, software metrics, testing and debugging, programming environments, etc. Roughly includes material in all of ACM Subject Classes D.2, except that D.2.4 (program verification) should probably have Logics in Computer Science as the primary subject area.
sort pith recommended most recent
Passing 87 percent of individual proofs is not enough; whole-repo proofs stall without shared lemma libraries.
· “Vero: Can AI Agents Build Formally Verified Software Repositories?”
A new taxonomy of why patches fail and why current detection tools score below chance at spotting incomplete fixes.
High F1 scores rested on near-duplicate labels and project overlap, not flakiness signal in the source.
· “How Far Are We from Detecting Flaky Tests? On the Limits of Code-Based Detection”
By checking every tool call against formal predicates for consent and data rules, the system works even when trace extraction contains 10 pe
Protocol-specific static analysis reveals recurring data-flow risks missed by existing tools across 15k real-world repositories.
· “Unsafe by Flow: Uncovering Bidirectional Data-Flow Risks in MCP Ecosystem”
Lifting semantics into knowledge graphs improves CVE coverage and cuts false positives on real ICS hardware from multiple vendors.
Stronger models still produce numerically inaccurate outputs instead of crashes, limiting direct use for science.
· “Can LLMs Solve Science or Just Write Code? Evaluating Quantum Solver Generation”
Two prefill passes on a 0.6B model rank failure sources in long multi-agent logs with no output tokens and seconds of latency.
· “MASPrism: Lightweight Failure Attribution for Multi-Agent Systems Using Prefill-Stage Signals”
Case study of hundreds of runs shows full freedom yields misleading fixes like weakened assertions, while constraints enable practical use.
Controlled experiment shows higher overall scores for concise documentation over structured detail capture in architectural decision records
Shortest-path distillation plus rubric rewards used for both training and step-wise pruning let agents resolve more issues with less compute
Identifying 1,210 functionalities and 25 unknown issues across 12 apps by synthesizing and refining specs from observed behaviors
· “From Exploration to Specification: LLM-Based Property Generation for Mobile App Testing”
SIR-Bench replays real incidents to test if agents discover new evidence or merely echo alerts.
· “SIR-Bench: Evaluating Investigation Depth in Security Incident Response Agents”
Adding references and structured prompts raises detection rates well above direct ChatGPT use
· “Improving MPI Error Detection and Repair with Large Language Models and Bug References”
VF-Coder lets models see rendered interfaces and simulate clicks to fix logic and layout errors text feedback misses.
· “Coding with Eyes: Visual Feedback Unlocks Reliable GUI Code Generating and Debugging”
Literature, workshops, and real-issue tests reveal gaps between academic focus, practitioner priorities, and model outputs.
· “Quality Assurance of LLM-generated Code: Addressing Non-Functional Quality Characteristics”
Reducing overlapping tools and picking only relevant ones for each query improves selection on standard benchmarks.
· “ToolScope: Enhancing LLM Agent Tool Use through Tool Merging and Context-Aware Filtering”
SWE-Bench Pro draws long-horizon problems from 41 repositories, including proprietary ones, to measure progress toward autonomous code work.
· “SWE-Bench Pro: Can AI Agents Solve Long-Horizon Software Engineering Tasks?”
GEPA evolves stronger LLM prompts by reflecting on a handful of trajectories instead of many scalar rewards.
· “GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning”
A solver that verifies high-level properties and returns the smallest failing example lifts success by up to 13 percent.
· “Effective LLM Code Refinement via Property-Oriented and Structurally Minimal Feedback”
Benchmark uses verified VM transitions to separate rule-following from copied persistent state.
· “ScratchWorld: Evaluating If World Models Compute Executable Consequences”
Matched prompts show top risk discriminators often refuse fewer queries than high-refusal peers.
· “RefusalBench: Why Refusal Rate Misranks Frontier LLMs on Biological Research Prompts”
New benchmark of 115 multi-file changes from actual projects shows sharp drop from simpler bug-fix results.
· “RoadmapBench: Evaluating Long-Horizon Agentic Software Development Across Version Upgrades”
What an analysis read and how its data nests are recovered from the program, not the p-values.
· “Tacet: A Language and Type System for Automatic Statistical Validity Accounting”
SWE-Prime's two-stage quality filter lifts resolution rates by up to 12.2% and 24.2% on the two SWE-Bench sets.
A new pattern argues that any single-domain fix must rebuild typed-change gating, an approval point, and an audit anchor at higher cost.
A fixed pipeline turns building telemetry into agent tasks whose rebuild matches the release byte-for-byte.
Delegation, goals, and scheduled tasks relabel attacker content as user intent, defeating both the model and permission review.
· “When Context Gets Root: Privilege Escalation in LLM Harnesses”
State-aware iterative subplanning in DeepRepro outperforms static-planning coding agents on PaperBench Code-Dev paper-to-code reproduction…
· “DeepRepro: State-Aware Subplanning for Paper-to-Code Reproduction in Evolving Repositories”
An attack built on a small open model transfers to closed-source embedders and LLMs.
· “Vulnerable Code Search: Transferable Attack for Code Language Models”
Across 75 tasks it scores 60 medals, 49 gold, versus 55 and 34 for Claude Code, with auditable lineages.
· “Praxist: From Experimental Artifacts to Solution Lineages”
A five-language benchmark shows standalone test scores overstate real-world readiness.
EAVA trains a small LLM on reasoning traces and RL; analysts rated its evidence useful in most cases.
· “Answer Is Cheap, Show Me the Evidence! Augmenting Automated Vulnerability Assessment with Evidence”
Even specification-valid documents can show a benign value in Office while an extractor feeds a planted trap fact to the model.
· “Beyond the Editing Canvas: Evidence Divergence in OOXML-to-LLM Ingestion”
The fix already exists: most workload clusters contain a secure reference; copying it lifts scores 60.4%.
Editing pauses and volume beat execution errors at the earliest stage, boosting AUROC to 0.674.
· “Predicting Struggling Students in CS1 Programming Using Keystroke-Level Editing Features”
A neurosymbolic pipeline reads provider documentation, generates state-machine code, and aligns it against the real cloud.
Seven-year panel shows platform governance, not entry timing, decides who grows and who silently fails.
Reports Vulnerable, Already Patched, or Uncertain with reviewable evidence for prepared firmware targets.
A 92-issue study finds architecture and regression cues are often missing from free text, so EDK II's template would demand them.
· “Enhancing Bug Report Templates in the TianoCore UEFI Firmware Development Community”
Two claim-coordinated agents on a shared CRDT workspace beat solo and naive-parallel runs at equal compute.
· “AgentRoom: Concurrent Multi-Agent Coding in a CRDT-Backed Shared Workspace”
A three-stage audit of 520 runs shows tests alone cannot tell a migration from a copy.
· “SWE Refactor Bench: Can Coding Agents Complete a Long-Horizon, Whole-Repository Stack Migration?”
Persistent code, recursive subagents, and saved skills let a fixed model turn extra compute into verified progress.
90% of its returned candidates are missed by all 20 query-driven baselines combined.
· “An Interactive Agent for Requirement-Driven Candidate Sourcing”
An audit shows confident-wrong and confident-correct outputs look identical; only multi-sample consistency catches the errors.
Two- and three-worker splits hit 0.830 on VAT cases vs 0.720 and 0.770 at the extremes; one bad record degrades every setup.
· “Right-Sizing LLM-Agent Decomposition in VAT Determination: A Pilot Controlled Sweep”
Formal preconditions give 93.3–97.0% compile success; side-effect order stays the developer's call.
· “Formalizing and Automating Fine-Grained Move Refactorings Across Methods”
Forcing a written diagnosis before test creation lifts SWT-Bench Verified results to 81.76% and cuts agent steps.
· “DPIAgent: Divide, Protocol, Isolate for Agentic Reproduction Test Generation”
A 19-section contract labels every design claim as measured, observed, inferred, or unknown so guesses stay visible.
Compiles policy text into rules, simulates the draft's effects, catching hallucinated IDs and missed side-effects.
A 13-person TianoCore study finds manual triage, patching, and supply-chain checks despite high awareness.
An LLM pipeline handles validity, duplicates, priority, and assignment for EDK II, if maintainers trust its output.
· “TianoForge: An Automated Bug Triage Approach for the TianoCore UEFI Firmware Development Community”
Metadata grows from design to provenance, and every generated crate still passes RO-Crate 1.1 validation.
· “LLMCrater: Lifecycle-Aware FAIR Metadata Generation using Large Language Models”
An LLM guided by architecture reviews and dependency matrices kept each app's outputs identical to the originals.
Pufibara passed 202 of 232 Modelica tasks versus 185 and 187 for Claude Code, using 76–82% fewer logical tokens.
Six static-analysis metrics, fed back over five refinement rounds, drive measurable structural gains and expose quality trade-offs.
LLM-assisted reasoning on the same metadata almost triples detection F1 over static rule checks.
An MCP-grounded assistant names the right root cause every time, yet engineers doubt its fixes.
· “ARGUS: MCP-Grounded Root Cause Analysis for Kubernetes Incidents”
The verbatim call, not the error message, drives the damage; a runtime description instead removes 76% of it.
· “Feedback That Backfires: Why Small Language Model Agents Repeat the Call They Just Watched Fail”
Local delays in service-based vehicles spread through shared resources and control loops that timing models overlook.
· “A Survey of Timing Variability in Microservice-Based Software-Defined Vehicles”
Patches prompts, tools, and control logic from failure traces, beating hand-tuned harnesses with far fewer rollouts.
· “AutoSaddler: Automatic Harness Optimization with Durable Updates from Agent Execution Traces”
A compile-and-evidence gate kept an untouched sentence intact in 192/192 tests where whole-slot rewrites changed it every time.
Two case studies show FHA surfaces recurring bias patterns that HR practitioners call realistic and mostly fixable.
Independent execution and reasoning signals, fused only at decision time, recover 60% of the oracle gap.
· “Execution-Anchored Hallucination Calibration Reranking for Verilog Code Generation”
An untrusted coding agent is quarantined in a container, and every commit is human-gated before it reaches the repo.
· “Concepts for Securing Agentic AI Coding and the Terok Environment”
Correcting for Python's built-in modules like os and math changes both hallucination numbers and defense rankings.
· “Evaluating Inference-Time Defenses Against Package Hallucination in LLM-Generated Code”
A system-prompt-only barrier disrupts unexamined transfer of generated code, but no single trick works across models.
· “Do Not Copy/Paste: Soft Barriers for Copying in AI-Assisted Programming”
Across 340 C# solutions from four LLMs, correctness and quality correlate at just 0.075—Pass@k alone misleads.
New stage-wise benchmark traces failures to their source and finds evidence handling is the real bottleneck.
· “ToolRobustBench: Stage-Wise Perturbation Evaluation and Failure Diagnosis for Tool-Calling Agents”
Automated per-function tests give code models local credit; hardest benchmarks gain up to 11.3% over KTO.
· “Function-Level Execution Feedback for Code Preference Optimization”
A three-agent loop verifies each kernel on real FPGA hardware, not just simulation, making LLM-written code deployable.
Paper argues serving-format conversion is a model change until decisions are re-checked at the deployed threshold.
Only the graph changes, and it degrades least when languages shift.
Multi-branch reasoning plus static analysis beats linear chain-of-thought by 12 points on 50 real vulnerabilities
The agent's safety-testing history trains the rival; every state where it scores higher is flagged as a bug.
· “Learning from the Test: Self-Referential Differential Testing for Deep RL Agents”
CodeMechanic turns a memory corruption into a controlled stop, with more correct patches at about a tenth of the token cost.
In an 8-participant study, median adjustment fell from 530 to 230 seconds with accuracy unchanged.
· “D-Diff: An Interactive Environment for Adjusting Commit Boundaries Based on an Editable 3-way Diff”
Routing-only arbitration lifts SWE-bench resolved rate from 44.9% to 48.2%, matching consensus without reading patch text.
· “Disagree to Explore, Agree to Commit: Routing-Guided Test-Time Scaling for Software Agents”
Ten-year software-visualization revisit: generation is solved, perception is the bottleneck.
· “Towards Actionable Visualization: Ten Years Later, What Generative AI Changes and What It Cannot”
A state exploration protocol reuses the simulation engine to build a full reachability graph, so no model conversion is needed.
· “Constraint-Driven Modeling Enabling Dual Model Checking and Simulation for Discrete Event Systems”