SMT-Friendly Formalization of the Solidity Memory Model

January 09, 2020 Β· Declared Dead Β· πŸ› International Workshop on Satisfiability Modulo Theories

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ákos Hajdu, Dejan JovanoviΔ‡ arXiv ID 2001.03256 Category cs.PL: Programming Languages Cross-listed cs.LO, cs.SE Citations 25 Venue International Workshop on Satisfiability Modulo Theories Last Checked 1 month ago
Abstract
Solidity is the dominant programming language for Ethereum smart contracts. This paper presents a high-level formalization of the Solidity language with a focus on the memory model. The presented formalization covers all features of the language related to managing state and memory. In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories. This enables precise and efficient reasoning about the state of smart contracts written in Solidity. The formalization is implemented in the solc-verify verifier and we provide an extensive set of tests that covers the breadth of the required semantics. We also provide an evaluation on the test set that validates the semantics and shows the novelty of the approach compared to other Solidity-level contract analysis tools.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted