The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
ZEUS: Analyzing Safety of Smart Contracts
Open accessAbstract
A smart contract is hard to patch for bugs once it is deployed, irrespective of the money it holds.A recent bug caused losses worth around $50 million of cryptocurrency.We present ZEUS-a framework to verify the correctness and validate the fairness of smart contracts.We consider correctness as adherence to safe programming practices, while fairness is adherence to agreed upon higher-level business logic.ZEUS leverages both abstract interpretation and symbolic model checking, along with the power of constrained horn clauses to quickly verify contracts for safety.We have built a prototype of ZEUS for Ethereum and Fabric blockchain platforms, and evaluated it with over 22.4K smart contracts.Our evaluation indicates that about 94.6% of contracts (containing cryptocurrency worth more than $0.5 billion) are vulnerable.ZEUS is sound with zero false negatives and has a low false positive rate, with an order of magnitude improvement in analysis time as compared to prior art.1 Oyente is under active development and future releases could add more features and reduce the false alarms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bitcoin: A Peer-to-Peer Electronic Cash System
Squarepants, S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3977007 · Cited by 11,148
Johnson, A. P. (2024) · Being and Becoming Teachers of Writing · doi:10.4324/9781003334798-34 · Cited by 4,502
In search of an understandable consensus algorithm
Ongaro, D., & Ousterhout, J. K. (2014) · USENIX Annual Technical Conference · Cited by 3,398
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Making Smart Contracts Smarter
Luu, L., Chu, D.-H., Olickel, H., Saxena, P., & Hobor, A. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978309 · Cited by 2,249
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
SAT-Based Model Checking without Unrolling
Bradley, A. R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-18275-4_7 · Cited by 548
Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab
Delmolino, K., Arnett, M., Kosba, A., Miller, A., & Shi, E. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53357-4_6 · Cited by 505
SAT-based model checking without unrolling
Bradley, A. R. (n.d.) · Cited by 494
IRM enforcement of Java stack inspection
Erlingsson, Ú., & Schneider, F. B. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2000.848461 · Cited by 290
Demystifying Incentives in the Consensus Computer
Luu, L., Teutsch, J., Kulkarni, R., & Saxena, P. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813659 · Cited by 225
Bitcoin: A Peer-to-Peer Electronic Cash System
Portillo, N. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4993270 · Cited by 200
SMT-Based Model Checking for Recursive Programs
Komuravelli, A., Gurfinkel, A., & Chaki, S. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08867-9_2 · Cited by 173
SMACK: Decoupling Source Language Details from Verifier Implementations
Rakamarić, Z., & Emmi, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08867-9_7 · Cited by 145
SMT-based model checking for recursive programs
Komuravelli, A., Gurfinkel, A., & Chaki, S. (2016) · Formal Methods in System Design · doi:10.1007/s10703-016-0249-4 · Cited by 143
Formalizing the LLVM intermediate representation for verified program transformations
Zhao, J., Nagarakatte, S., Martin, M. M. K., et al. (2012) · ACM SIGPLAN Notices · doi:10.1145/2103621.2103709 · Cited by 139
Town Crier: An Authenticated Data Feed for Smart Contracts.Preprint
Zhang, F., Cecchetti, E., Croman, K., Juels, A., & Shi, E. (2016) · IACR Cryptology ePrint Archive · Cited by 103
Composing security policies with polymer
Bauer, L., Ligatti, J., & Walker, D. (2005) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1065010.1065047 · Cited by 93
The Ring of Gyges: Investigating the Future of Criminal Smart Contracts.Preprint
Juels, A., Kosba, A. E., & Shi, E. (2016) · IACR Cryptology ePrint Archive · Cited by 34
Cited by
Casino, F., Dasaklis, T. K., & Patsakis, C. (2019) · Telematics and Informatics · doi:10.1016/j.tele.2018.11.006 · Cited by 2,557
An overview on smart contracts: Challenges, advances and platforms
Zheng, Z., Xie, S., Dai, H.-N., Chen, W., Chen, X., Weng, J., & Imran, M. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2019.12.019 · Cited by 1,197
Securify: Practical Security Analysis of Smart Contracts
Tsankov, P., Dan, A., Drachsler-Cohen, D., Gervais, A., Bünzli, F., & Vechev, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243780 · Cited by 1,043
Smart Contract Development: Challenges and Opportunities
Zou, W., Lo, D., Kochhar, P. S., Le, X.-B. D., Xia, X., Feng, Y., Chen, Z., & Xu, B. (2021) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2019.2942301 · Cited by 727
Finding The Greedy, Prodigal, and Suicidal Contracts at Scale
Nikolić, I., Kolluri, A., Sergey, I., Saxena, P., & Hobor, A. (2018) · Proceedings of the 34th Annual Computer Security Applications Conference · doi:10.1145/3274694.3274743 · Cited by 660
Metadata
- Authors
- Kalra, S., Goel, S., Dhawan, M., & Sharma, S.
- Venue
- Proceedings 2018 Network and Distributed System Security Symposium
- Publisher
- Internet Society
- Published
- 2018
- OpenAlex
- W2790202156
- Cited by
- 702
- References
- 20
- FWCI
- 60.59
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.