Skip to content
Open access

A Sound Semantics Approximation of Solidity for Enhanced Vulnerability Detection

Sep 2026 · Distributed Ledger Technologies: Research and Practice · 0 citations · 48 references

TL;DR

This paper proposes a semantics-driven static analysis framework for detecting vulnerabilities in Solidity, grounded in Abstract Interpretation theory, enabling safe approximation of program semantics to formally capture dynamic behavioral properties of Solidity smart contracts at different levels of abstraction.

Abstract

As Solidity smart contracts become central to decentralized finance and governance, the exploitation of critical vulnerabilities has repeatedly resulted in severe financial losses. Existing state-of-the-art methods that rely on symbolic execution or syntactic patterns are unable to model the language semantics accurately. This limits their ability to reason about all possible runtime behaviors and, hence, often produces numerous false alarms under adversarial blockchain environment. To address these challenges, in this paper, we propose a semantics-driven static analysis framework for detecting vulnerabilities in Solidity. Our proposed framework is grounded in Abstract Interpretation theory, enabling safe approximation of program semantics to formally capture dynamic behavioral properties of Solidity smart contracts at different levels of abstraction. While it performs fixpoint semantics computations on an augmented control flow graph guided by adversarial contexts, it applies semantic dependences refinement through numerical abstractions as well. This facilitates more precise reasoning regarding semantic properties indicating the presence of possible Solidity vulnerabilities. Our prototype, developed using the APRON library, supports various numerical abstract domains, such as Intervals, Octagons, and Polyhedra, thereby optimizing the trade-off between precision and computational cost. Empirical results on four benchmark datasets (SBC, Qian, RSD, and SolidiFI) show that the Interval domain works well for integer overflow and underflow and for reentrancy, while the Polyhedra domain captures the linear relations among variables needed for timestamp and transaction-ordering dependencies. Furthermore, the semantics-aware analysis enables our tool to achieve the highest F1-score in seven of the nine evaluated dataset-vulnerability combinations, with average F1-score improvements over the strongest existing baselines of about 5.3, 15.0, 13.6, and 5.5 percentage points for Reentrancy, Integer Overflow and Underflow, Timestamp Dependency, and Transaction Ordering Dependency, respectively, together with AUC improvements of up to 0.41.

Read PDF

Similar papers

Sep 2026

Solidity Meets LLMs: A Transformer-Based Approach to Smart Contract Vulnerability Detection

The growing adoption of blockchain technologies, particularly the Ethereum platform, has amplified the critical role of smart contracts in decentralized applications. However, the increasing complexity and financial value of these contracts make them prime targets for cyber attacks. In this work, we present a transform...

Djamel Eddine Hakim Ghorab, Farid Mokhati, Mostafa Anouar Ghorab · 0 citations
Sep 2026

SE4SC-LLM: an LLM-Augmented symbolic execution framework for smart contracts

SE4SC-LLM, an LLM-augmented symbolic execution framework for smart contracts that achieves 95.1% average CFG coverage, a 6.5 percentage point improvement over the strongest baseline, and detects 11.2% more vulnerabilities.

Tian-Huan Miao, Yang Liu · 0 citations
Conference Open access Sep 2026

When LLM Architectures Meet Smart Contract Vulnerability Detection: a Replication Study

Smart contracts are immutable programs deployed on blockchain platforms, where vulnerabilities can translate directly into financial loss. Among the techniques proposed for their detection, recent work has relied increasingly on Large Language Models (LLMs) guided by carefully crafted prompts. However, the evidence acc...

Gerardo Iuliano, Gabriele De Vito, Dario Di Nucci · 0 citations
Open access Sep 2026

Improving Security Policy Validation in Distributed Systems Using Attack Graph Simulations

Validation of security policies in distributed systems is difficult because rules are heterogeneous, interact in non-obvious ways, and static checks often overlook multi-stage attacker chains. We offer a unified framework to translate real policies, and in parallel give visibility into policy-aware attack graphs (PAAGs...

Z. Al-araji, B. Hasan, Fahad Ahmed Shaban et al. · 0 citations
Book Open access Oct 2026

Trace-Driven Automated PoC Synthesis for On-Chain Attacks

Blockchain systems are increasingly targeted by on-chain attacks that exploit vulnerabilities in smart contracts, resulting in billions of dollars in losses. Understanding and reproducing these attacks is critical for defense, yet currently relies on manually crafting proofs-of-concept (PoCs), which is labor-intensive,...

Xing Su, Hao Wu, Han-Zhong Liang et al. · 0 citations
Preprint Oct 2026

Discovery or Memorization? A Faithful Benchmark for Real-World Business-Logic Vulnerability Discovery

The rapid advancement of cybersecurity agents in vulnerability discovery has increased the need for benchmarks that evaluate their capabilities accurately. However, synthetic benchmarks lack realism, real-life benchmarks are prone to contamination, and many existing benchmarks have already been saturated by current mod...

Rui Yang, Yi-Chao Xu, Zhuo-Hao Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.