Sink boundary: A regular expression can consume disproportionate CPU on adversarial input.
The pack does not provide a callable signature for this record; the watched access path is shown directly.
| Arg | Access path | Purpose | Watched |
|---|---|---|---|
| Argument[0] | Argument[0] | The access path Atropos marks for this model. | ▲ sink |
CWE-1333 ↗
Inefficient Regular Expression Complexity
A regular expression has inefficient complexity that can consume excessive CPU.
Attacker's-eye view · redos
A crafted string drives pathological backtracking and ties up the process.
// modeled boundary: Argument[0]
RegExp(attacker_influenced_value);
1Review nested ambiguity and backtracking.
2Bound input length.
3Use a linear-time engine or timeout where available.
These checks require the surrounding codebase. The model names the boundary; it does not decide reachability or prove that a guard dominates every path.
Is this a bug in your code?Atropos stops here — by design
Atropos identifies Argument[0] as a redos sink. It cannot see whether untrusted data reaches this call in your repository.
Lachesis is the codebase-level step: it traces reachability and guards for this symbol.
Check this symbol in Lachesis →Model facts · verbatim from the pack
| Role | Kind | Access path | Model ID | Confidence |
|---|---|---|---|---|
| sink | redos | Argument[0] | javascript.std.regexp.a0 | low · corrob. 1 |