marius/Open_Ultra_SAST
1
0
Fork 0
mirror of https://github.com/norandom/OpenUltraSAST.git synced 2026-10-17 20:19:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(three-stage-scan): compute complexity signals for hotspot ranking

Browse Source
This commit is contained in:
Marius Ciepluch
2026-09-03 20:05:13 +02:00
parent c5a80c2817
commit 3d643040bd
4 changed files with 409 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
.kiro/specs/three-stage-scan/tasks.md
+1 -1
View File
@@ -32,7 +32,7 @@ This plan ships the three-stage scan without rebuilding CWE policy or the regex
## Phase 2 — Core: Map, hunter tools, sandbox (parallel after foundation)
- [ ] 2. Build the heuristic complexity map and test-tuning hints
- [ ] 2.1 (P) Compute per-file and per-function complexity signals
- [x] 2.1 (P) Compute per-file and per-function complexity signals
- Signals include size, nesting, surface tags, reachability, inventory-hit density as a feature not the score, and whether an adjacent test appears to exist.
- Function identity uses entry-point names when present and otherwise remains empty.
- Observable completion: a parser file with no pattern hit scores higher than a one-line helper that matches a pattern, proven by a unit test on a constructed target list.