Feldman, Y. M. Y., Khyzha, A., Enea, C., Morrison, A., Nanevski, A., Rinetzky, N., & Shoham, S. (2020). Proving highly-concurrent traversals correct. Proceedings of ACM on programming languages, 4(OOPSLA), 1-29. https://doi.org/10.1145/3428196
Citace podle Chicago (17th ed.)Feldman, Yotam M. Y., Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, a Sharon Shoham. "Proving Highly-concurrent Traversals Correct." Proceedings of ACM on Programming Languages 4, no. OOPSLA (2020): 1-29. https://doi.org/10.1145/3428196.
Citace podle MLA (9th ed.)Feldman, Yotam M. Y., et al. "Proving Highly-concurrent Traversals Correct." Proceedings of ACM on Programming Languages, vol. 4, no. OOPSLA, 2020, pp. 1-29, https://doi.org/10.1145/3428196.