New ask Hacker News story: Ask HN: Agentic Permutation of Testing Paths In A System

Ask HN: Agentic Permutation of Testing Paths In A System
4 by davidajackson | 0 comments on Hacker News.
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.

Comments

Popular posts from this blog

How can Utilize Call Center Outsourcing for Increase your Business Income well?

New ask Hacker News story: EVM-UI – visual tool to interact with EVM-based smart contracts

New ask Hacker News story: Ask HN: Should I quit my startup journey for now?