A survey on ethereum smart contract vulnerability detection using machine learning
Bibliographic record
Abstract
Blockchain applications go far beyond cryptocurrency. As an essential blockchain tool, smart contracts are executable programs that establish an agreement between two parties. Millions of dollars of transactions attract hackers at a hastened pace, and cyber-attacks have caused large economic losses in the past. Due to this, the industry is seeking robust and effective methods to detect vulnerabilities in smart contracts to ultimately provide a remedy. The industry has been utilizing static analysis tools to reveal security gaps, which requires an understanding and insight over all possible execution paths to identify known contract vulnerabilities. Yet, the computational complexity increases as the path gets deeper. Recently, researchers have been proposing ML-driven intelligent techniques aiming to improve the efficiency and detection rate. Such solutions can provide quicker and more robust detection options than the traditionally used static analysis tools. As of this publication date, there is currently no published survey paper on smart contract vulnerability detection mechanisms using ML models. In order to set the ground for further development of ML-driven solutions, in this survey paper, we extensively reviewed and summarized a wide variety of ML-driven intelligent detection mechanism from the following databases: Google Scholar, Engineering Village, Springer, Web of Science, Academic Search Premier, and Scholars Portal Journal. In conclusion, we provided our insights on common traits, limitations and advancement of ML-driven solutions proposed for this field.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.005 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".