A Program Logic for First-Order Encapsulated WebAssembly
Venue
Proceedings of the 33rd European Conference on Object-Oriented Programming (ECOOP 2019), pp. 9:1–9:30
Publication Year
2019
Identifiers
- DOI: doi:10.4230/LIPIcs.ECOOP.2019.9
- ISBN: 978-3-95977-111-5
Authors
- Conrad Watt
- Petar Maksimovic
- Neelakantan R. Krishnaswami
- Philippa Gardner
Abstract
We introduce Wasm Logic, a sound program logic for first-order, encapsulated WebAssembly. We design a novel assertion syntax, tailored to WebAssembly’s stack-based semantics and the strong guarantees given by WebAssembly’s type system, and show how to adapt the standard separation logic triple and proof rules in a principled way to capture WebAssembly’s uncommon structured control flow. Using Wasm Logic, we specify and verify a simple WebAssembly B-tree library, giving abstract specifications independent of the underlying implementation. We mechanise Wasm Logic and its soundness proof in full in Isabelle/HOL. As part of the soundness proof, we formalise and fully mechanise a novel, big-step semantics of WebAssembly, which we prove equivalent, up to transitive closure, to the original WebAssembly small-step semantics. Wasm Logic is the first program logic for WebAssembly, and represents a first step towards the creation of static analysis tools for WebAssembly.