The Move Prover

Zhong, Jingyi Emma; Cheang, Kevin; Qadeer, Shaz; Grieskamp, Wolfgang; Blackshear, Sam; Park, Junkil; Zohar, Yoni; Barrett, Clark; Dill, David L.

doi:10.1007/978-3-030-53288-8_7

Cited by 19 publications

(9 citation statements)

References 27 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results presented in Section 4 was motivated by a set of smart contract verification benchmarks. We obtained these benchmarks by applying the opensource Move Prover verifier [22] to smart contracts found in the open-source Diem project [9]. The Move prover is a formal verifier for smart contracts written in the Move language [6] and was designed to target smart contracts used in the Diem blockchain [1].…”

Section: Preliminary Case Studymentioning

confidence: 99%

Politeness and Stable Infiniteness: Stronger Together

Sheng

Zohar

Ringeissen

et al. 2021

Automated Deduction – CADE 28

Self Cite

View full text Add to dashboard Cite

We make two contributions to the study of polite combination in satisfiability modulo theories. The first is a separation between politeness and strong politeness, by presenting a polite theory that is not strongly polite. This result shows that proving strong politeness (which is often harder than proving politeness) is sometimes needed in order to use polite combination. The second contribution is an optimization to the polite combination method, obtained by borrowing from the Nelson-Oppen method. The Nelson-Oppen method is based on guessing arrangements over shared variables. In contrast, polite combination requires an arrangement over all variables of the shared sorts. We show that when using polite combination, if the other theory is stably infinite with respect to a shared sort, only the shared variables of that sort need be considered in arrangements, as in the Nelson-Oppen method. The time required to reason about arrangements is exponential in the worst case, so reducing the number of variables considered has the potential to improve performance significantly. We show preliminary evidence for this by demonstrating a speed-up on a smart contract verification benchmark.

show abstract

Section: Preliminary Case Studymentioning

confidence: 99%

Politeness and Stable Infiniteness: Stronger Together

Sheng

Zohar

Ringeissen

et al. 2021

Automated Deduction – CADE 28

Self Cite

View full text Add to dashboard Cite

show abstract

“…There are also efforts to perform deductive verification of smart contracts both on the source level in languages such as Solidity [32,4,13] and Move [34], as well as on the the Ethereum virtual machine (EVM) level [2,28]. This paper improves the effectiveness of these approaches by developing techniques for automatically reasoning about unbounded sums.…”

Section: Related Workmentioning

confidence: 99%

Summing Up Smart Transitions

Elad¹,

Rain²,

Immerman³

et al. 2021

Preprint

View full text Add to dashboard Cite

Some of the most significant high-level properties of currencies are the sums of certain account balances. Properties of such sums can ensure the integrity of currencies and transactions. For example, the sum of balances should not be changed by a transfer operation. Currencies manipulated by code present a verification challenge to mathematically prove their integrity by reasoning about computer programs that operate over them, e.g., in Solidity. The ability to reason about sums is essential: even the simplest ERC-20 token standard of the Ethereum community provides a way to access the total supply of balances. Unfortunately, reasoning about code written against this interface is nontrivial: the number of addresses is unbounded, and establishing global invariants like the preservation of the sum of the balances by operations like transfer requires higher-order reasoning. In particular, automated reasoners do not provide ways to specify summations of arbitrary length. In this paper, we present a generalization of first-order logic which can express the unbounded sum of balances. We prove the decidablity of one of our extensions and the undecidability of a slightly richer one. We introduce first-order encodings to automate reasoning over software transitions with summations. We demonstrate the applicability of our results by using SMT solvers and first-order provers for validating the correctness of common transitions in smart contracts.This submission is an extended version of the CAV 2021 paper "Summing Up Smart Transitions", by N. Elad, S. Rain, N. Immerman, L. Kovács and M. Sagiv.

show abstract

“…The results presented in Section 4 was motivated by a set of smart contract verification benchmarks. We obtained these benchmarks by applying the opensource Move Prover verifier [23] to smart contracts found in the open-source Diem project [10]. The Move prover is a formal verifier for smart contracts written in the Move language [6] and was designed to target smart contracts used in the Diem blockchain [1].…”

Section: Preliminary Case Studymentioning

confidence: 99%

Politeness and Stable Infiniteness: Stronger Together

Sheng

Zohar

Ringeissen

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

We make two contributions to the study of polite combination in satisfiability modulo theories. The first is a separation between politeness and strong politeness, by presenting a polite theory that is not strongly polite. This result shows that proving strong politeness (which is often harder than proving politeness) is sometimes needed in order to use polite combination. The second contribution is an optimization to the polite combination method, obtained by borrowing from the Nelson-Oppen method. The Nelson-Oppen method is based on guessing arrangements over shared variables. In contrast, polite combination requires an arrangement over all variables of the shared sorts. We show that when using polite combination, if the other theory is stably infinite with respect to a shared sort, only the shared variables of that sort need be considered in arrangements, as in the Nelson-Oppen method. The time of reasoning about arrangements is exponential in the worst case, so reducing the number of variables considered has the potential to improve performance significantly. We show preliminary evidence for this by demonstrating a speed-up on a smart contract verification benchmark.

show abstract

The Move Prover

Cited by 19 publications

References 27 publications

Politeness and Stable Infiniteness: Stronger Together

Politeness and Stable Infiniteness: Stronger Together

Summing Up Smart Transitions

Politeness and Stable Infiniteness: Stronger Together

Contact Info

Product

Resources

About