Mining a directly-follows workflow graph from black-box conversations with an LLM agent enables structurally targeted boundary testing that covers 23–38 distinct stateful boundaries per agent, roughly doubling prompt-only baselines.
An empirical evaluation of using large language models for automated unit test generation,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.SE 2years
2026 2verdicts
CONDITIONAL 2representative citing papers
High-velocity agentic coding becomes governable when engineers convert recurring structural failures into durable, machine-actionable governance mechanisms rather than relying on continuous human code review.
citing papers explorer
-
Mining Workflow Graphs for Black-Box Boundary Testing of Conversational LLM Agents
Mining a directly-follows workflow graph from black-box conversations with an LLM agent enables structurally targeted boundary testing that covers 23–38 distinct stateful boundaries per agent, roughly doubling prompt-only baselines.
-
Cheap Code, Costly Judgment: A Case Study on Governable Agentic Software Engineering
High-velocity agentic coding becomes governable when engineers convert recurring structural failures into durable, machine-actionable governance mechanisms rather than relying on continuous human code review.