Abstract
A method is disclosed for admitting an operator-supplied regular expression into a service that applies it synchronously to text produced by other systems, while reducing the risk that a pattern which compiles but backtracks catastrophically stalls the service. Every pattern setting is resolved through one resolver returning the compiled pattern, the pattern text in force and an optional issue. A value that fails to compile, and one that compiles but fails a timed screen, are both replaced by the setting's documented default and reported as a degraded configuration finding naming the setting, the rejected value and the reason, rather than thrown. The screen derives its probe alphabet from the candidate pattern: every ASCII letter and digit left in the pattern text after removal of backslash-letter escape sequences, preceded by one fixed letter and one fixed digit, deduplicated and capped. Each character yields a fixed-length run followed by a non-alphanumeric terminator, the shape that drives a nested quantifier through every partition of the run. The compiled pattern is first exercised on a trivial subject so that a tiered engine is measured on native rather than interpreted code; the probes are then timed cumulatively against an operator-set budget, checked after each probe, and the measurement is cached per budget and pattern text. Independently, every pattern, operator value or default, is applied only to a bounded subject prefix, so exposure depends on configuration, not on external text, and a finding raised from a failure-text match records where the subject was cut.
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Assuncao, gustavo matthew, "Runtime ReDoS Screen for Operator-Supplied Pattern Settings: Pattern-Derived Probe Alphabet, Warmed Bounded-Iteration Throughput Ratio, Prime-Length Probes and Settle-Before-Record Write Path", Technical Disclosure Commons, ()
https://www.tdcommons.org/dpubs_series/13245