A Language-Independent Program Verification Framework

Chen, Xiaohong; Roşu, Grigore

doi:10.1007/978-3-030-03421-4_7

Cited by 4 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By executable, we mean that K provides concurrent and non-deterministic rewrite semantics [16] that allow for efficient execution of large programs in the developer-specified programming language model. Figure 1 shows the high-level goals of the K Framework, which include deriving an interpreter and compiler for a specified language semantics, as well as model-checking tools.…”

Section: Formal Verification Toolsmentioning

confidence: 99%

“…Indeed, several have been applied to model Ethereum-based systems in the past [5,7,21]. We refer the reader to [15,16,42] for details on the mathematical and formal foundations of K. We emphasize that our MEV-based secure composability definitions and general results are not specific to K.…”

Section: Formal Verification Toolsmentioning

confidence: 99%

“…Another key difference is that our abstract contract has imperative semantics while K is fundamentally rewrite-based [16] using "A => B" as a special operator meaning "A rewrites to B". Lines 1-6 in Figure 5 correspond to one of the rewrite operators in our CFF Uniswap model.…”

Section: Cff Uniswap Modelmentioning

confidence: 99%

See 2 more Smart Citations

Clockwork Finance: Automated Analysis of Economic Security in Smart Contracts

Babel,

Daian,

Kelkar

et al. 2021

Preprint

View full text Add to dashboard Cite

We introduce the Clockwork Finance Framework (CFF), a general purpose, formal verification framework for mechanized reasoning about the economic security properties of composed decentralized-finance (DeFi) smart contracts.CFF features three key properties. It is contract complete, meaning that it can model any smart contract platform and all its contracts-Turing complete or otherwise. It does so with asymptotically optimal model size. It is also attack-exhaustive by construction, meaning that it can automatically and mechanically extract all possible economic attacks on users' cryptocurrency across modeled contracts.Thanks to these properties, CFF can support multiple goals: economic security analysis of contracts by developers, analysis of DeFi trading risks by users, and optimization of arbitrage opportunities by bots or miners. Because CFF offers composability, it can support these goals with reasoning over any desired set of potentially interacting smart contract models.We instantiate CFF as an executable model for Ethereum contracts that incorporates a state-of-the-art deductive verifier. Building on previous work, we introduce extractable value (EV), a new formal notion of economic security in composed DeFi contracts that is both a basis for CFF analyses and of general interest.We construct modular, human-readable, composable CFF models of four popular, deployed DeFi protocols in Ethereum: Uniswap, Uniswap V2, Sushiswap, and MakerDAO, representing a combined 17 billion USD in value as of August 2021. We uses these models to show experimentally that CFF is practical and can drive useful, data-based EV-based insights from real world transaction activity. Without any explicitly programmed attack strategies, CFF uncovers on average an expected $56 million of EV per month in the recent past.

show abstract

Section: Formal Verification Toolsmentioning

confidence: 99%

Section: Formal Verification Toolsmentioning

confidence: 99%

See 1 more Smart Citation

Clockwork Finance: Automated Analysis of Economic Security in Smart Contracts

Babel,

Daian,

Kelkar

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In A Language-Independent Program Verification Framework [10], Chen and Rosu describe an approach to language-independent deductive verification, using the K semantics framework. They show how a program verifier as well as other, also dynamic, language tools are generated automatically, from the semantics description, correct-by-construction.…”

Section: Topic 3: Putting Combinations Of Static and Runtime Verificamentioning

confidence: 99%

A Broader View on Verification: From Static to Runtime and Back (Track Summary)

Ahrendt

Huisman

Reger

et al. 2018

Leveraging Applications of Formal Methods, Verification and Validation. Verification

View full text Add to dashboard Cite

When seeking to verify a computational system one can either view the system as a static description of possible behaviours or a dynamic collection of observed or actual behaviours. Historically, there have been clear differences between the two approaches in terms of their level of completeness, the associated costs, the kinds of specifications considered, how and when they are applied, and so on. Recently there has been a concentrated interest in the combination of static and runtime (dynamic) techniques and this track (taking place as part of ISoLA 2018) aims to explore this combination further.

show abstract

$$\mathbb {K}$$ and KIV: Towards Deductive Verification for Arbitrary Programming Languages

Klumpp

Lenzen

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A Language-Independent Program Verification Framework

Cited by 4 publications

References 17 publications

Clockwork Finance: Automated Analysis of Economic Security in Smart Contracts

Clockwork Finance: Automated Analysis of Economic Security in Smart Contracts

A Broader View on Verification: From Static to Runtime and Back (Track Summary)

$$\mathbb {K}$$ and KIV: Towards Deductive Verification for Arbitrary Programming Languages

Contact Info

Product

Resources

About