Metadata only
Autor(in)
Alle anzeigen
Datum
2020-11Typ
- Conference Paper
ETH Bibliographie
yes
Altmetrics
Abstract
To verify distributed systems, prior work introduced a methodology for verifying both the code running on individual machines and the correctness of the overall system when those machines interact via an asynchronous distributed environment. The methodology requires neither domain-specific logic nor tooling. However, distributed systems are only one instance of the more general phenomenon of systems code that interacts with an asynchronous environment. We argue that the software of a storage system can (and should!) be viewed similarly.
We evaluate this approach in VeriSafeKV, a key-value store based on a state-of-the-art B^ε-tree. In building VeriSafeKV, we introduce new techniques to scale automated verification to larger code bases, still without introducing domain-specific logic or tooling. In particular, we show a discipline that keeps the automated verification development cycle responsive. We also combine linear types with dynamic frames to relieve the programmer from most heap-reasoning obligations while enabling them to break out of the linear type system when needed. VeriSafeKV exhibits similar query performance to unverified databases. Its insertion performance is 15× faster than unverified BerkeleyDB and 6× slower than RocksDB. Mehr anzeigen
Publikationsstatus
publishedBuchtitel
Proceedings of the14th USENIX Symposium on Operating Systems Design and Implementation (OSDI '20)Seiten / Artikelnummer
Verlag
USENIX AssociationKonferenz
Anmerkungen
Conference lecture held on November 4, 2020. Due to the Coronavirus (COVID-19) the conference was conducted virtually.ETH Bibliographie
yes
Altmetrics