Using eternity variables to specify and prove a serializable database interface

DOI10.1016/J.SCICO.2003.06.001zbMath1091.68041OpenAlexW2067629577WikidataQ111096752 ScholiaQ111096752MaRDI QIDQ1881266

Wim H. Hesselink

Publication date: 4 October 2004

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/2968057/2004SciCompProgHesselink.pdf

zbMATH Keywords

NQTHMdistributed database

Mathematics Subject Classification ID

Database theory (68P15) Distributed algorithms (68W15)

Related Items (7)

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ A criterion for atomicity revisited ⋮ Simulation Refinement for Concurrency Verification ⋮ Universal extensions to simulate specifications ⋮ Simulation refinement for concurrency verification ⋮ Splitting forward simulations to cope with liveness ⋮ Refinement verification of the lazy caching algorithm

Uses Software

• NQTHM

This page was built for publication: Using eternity variables to specify and prove a serializable database interface