Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. Formal construction of a non-blocking concurrent queue algorithm;Abrial;Journal of Universal Computer Science,2005
2. Amit, D., N. Rinetzky, T. Reps, M. Sagiv and E. Yahav, Comparison under abstraction for verifying linearizability, in: CAV'07: Computer Aided Verification 2007, 2007, to appear
3. Back, R.-J. and J. von Wright, Trace refinement of action systems, in: International Conference on Concurrency Theory, 1994, pp. 367–384
4. Cohen, E. and L. Lamport, Reduction in TLA, in: International Conference on Concurrency Theory (CONCUR), 1998, pp. 317–331
5. Colvin, R. and L. Groves, Formal verification of an array-based nonblocking queue, in: ICECCS '05: Proceedings of the Internation Conference on Engineering of Complex Computer Systems (2005), pp. 92–101
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献