A mechanized refinement proof of the Chase–Lev deque using a proof system
- 2 July 2018
- journal article
- research article
- Published by Springer Nature in Computing
- Vol. 101 (1) , 59-74
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Automated and Modular Refinement Reasoning for Concurrent Programs2015
- A Scalable, Correct Time-Stamped StackACM SIGPLAN Notices, 2015
- Handling TSO in Mechanized Linearizability ProofsLecture Notes in Computer Science, 2014
- Dynamic synthesis for relaxed memory models2012
- Idempotent work stealingACM SIGPLAN Notices, 2009
- A calculus of atomic actionsACM SIGPLAN Notices, 2009
- Thread Scheduling for Multiprogrammed MultiprocessorsTheory of Computing Systems, 2001
- The implementation of the Cilk-5 multithreaded languageACM SIGPLAN Notices, 1998
- An axiomatic proof technique for parallel programs IActa Informatica, 1976
- ReductionCommunications of the ACM, 1975