DeepSeek R1 Computational Efficiency for Vulnerability Detection in High-Complexity Code
Description
This report synthesises findings from 3 peer-reviewed papers addressing the following research question: What is the computational efficiency (inference time and memory usage) of Deepseek R1 when detecting vulnerabilities in high-cyclomatic-complexity code versus low-complexity code, as measured on the. 7 claims were extracted from source literature; 7 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.1/10. This report is a machine-generated literature synthesis and does not constitute original research.
Research goal: What is the computational efficiency (inference time and memory usage) of Deepseek R1 when detecting vulnerabilities in high-cyclomatic-complexity code versus low-complexity code, as measured on the Big-Vul benchmark?
Autonomous literature synthesis. Automated review score: 8.1/10. Full text and citation available at Assignee Research.
Notes
Files
paper.pdf
Files
(78.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e0961cae8d7be60feec40bab213b08ab
|
78.3 kB | Preview Download |
Additional details
Related works
- Is compiled by
- https://assignee.net (URL)