TY - CPAPER TI - Formally Verified EVM Block-Optimizations AU - Kirchner, Daniel AU - Genaim, Samir AU - Albert, Elvira AU - Martin-Martin, Enrique PY - 2023 T2 - Computer Aided Verification : 35th International Conference, CAV 2023, Paris, France, July 17–22, 2023, Proceedings, Part III SP - 176-189 PB - Springer Nature Switzerland CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-031-37709-9 DO - 10.1007/978-3-031-37709-9_9 UR - https://fis.uni-bamberg.de/handle/uniba/89789 LA - eng AB - The efficiency and the security of smart contracts are their two fundamental properties, but might come at odds: the use of optimizers to enhance efficiency may introduce bugs and compromise security. Our focus is on EVM (Ethereum Virtual Machine) block-optimizations, which enhance the efficiency of jump-free blocks of opcodes by eliminating, reordering and even changing the original opcodes. We reconcile efficiency and security by providing the verification technology to formally prove the correctness of EVM block-optimizations on smart contracts using the Coq proof assistant. This amounts to the challenging problem of proving semantic equivalence of two blocks of EVM instructions, which is realized by means of three novel Coq components: a symbolic execution engine which can execute an EVM block and produce a symbolic state; a number of simplification lemmas which transform a symbolic state into an equivalent one; and a checker of symbolic states to compare the symbolic states produced for the two EVM blocks under comparison. KW - Coq KW - Ethereum Virtual Machine KW - Smart Contracts KW - Optimization KW - Theorem Proving ER -