Ask HN: Agentic Permutation of Testing Paths In A System
Given a system with N components and M pairwise connections between said N components, there exists infinite sequences of [component, command, ...] for a series of operations. A component displays data and a command obviously executes a command.
Has anyone here done research on using an agant to select happy paths to test based on user intent? Is there literature on this? Seems like a cost, compute, intent optimization problem.
Assume latency is a restriction.
Seems like something some AI research folks here can chime in on. I have my own opinions but want to hear what the community thinks.
No comments yet.