Carl Che
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Crypto×1AI×1
Frequent co-authors
Research Timeline
2026
Do Coding Agents Understand Least-Privilege Authorization?
The paper introduces a new benchmark and decomposition method, Sufficiency-Tightness Decomposition, demonstrating that current coding agents struggle to accurately infer least-privilege authorization, and that this decomposition significantly improves both security and task success.
Highlighted terms show continued research focus across papers
Papers
cs.CRcs.AIRecentMay 14, 2026
Do Coding Agents Understand Least-Privilege Authorization?
Zheng Yan, Jingxiang Weng, Charles Chen, Dengyun Peng +8 more
The paper introduces a new benchmark and decomposition method, Sufficiency-Tightness Decomposition, demonstrating that current coding agents struggle to accurately infer least-privilege authorization,…
View →