Cada entrada indica en qué prácticas aparece citada. Si usas LaTeX para tus reportes,
puedes descargar el archivo sample.bib y citar con las mismas claves.
Obras citadas
Almeida, Paulo Sérgio, y Carlos Baquero. 2019. «Scalable
eventually consistent counters over unreliable networks».
Distrib. Comput. 32 (1): 69-89. https://doi.org/10.1007/s00446-017-0322-2.
Citada en: Práctica 7
Attiya, Hagit, Maurice Herlihy, y Ophir Rachman. 1995. «Atomic
snapshots using lattice agreement». Distributed
Computing 13 (9). https://doi.org/10.1007/BF02242714.
Citada en: Snapshots (material extra)
Attiya, Hagit, Nancy Lynch, y Nir Shavit. 1994. «Are wait-free
algorithms fast?» J. ACM 41 (4): 725-63. https://doi.org/10.1145/179812.179902.
Citada en: Snapshots (material extra)
Blum, Erica, Derek Leung, Julian Loss, Jonathan Katz, y Tal Rabin. 2023.
«Analyzing the Real-World Security of the Algorand
Blockchain», noviembre. https://doi.org/10.60882/cispa.25681101.v1.
Citada en: Práctica 6
Bonakdarpour, Borzoo, Pierre Fraigniaud, Sergio Rajsbaum, David
Rosenblueth, y Corentin Travers. 2022. «Decentralized Asynchronous
Crash-resilient Runtime Verification». J. ACM 69 (5). https://doi.org/10.1145/3550483.
Citada en: Snapshots (material extra)
Castañeda, Armando, y Gilde Valeria Rodrı́guez. 2023. «Asynchronous
Wait-Free Runtime Verification and Enforcement of
Linearizability». En Proceedings of the 2023 ACM Symposium on
Principles of Distributed Computing, 90-101. PODC ’23. New York,
NY, USA: Association for Computing Machinery. https://doi.org/10.1145/3583668.3594563.
Citada en: Snapshots (material extra)
David, Bernardo, Peter Gaži, Aggelos Kiayias, y Alexander Russell. 2018.
«Ouroboros Praos: An Adaptively-Secure, Semi-synchronous
Proof-of-Stake Blockchain». En Advances in Cryptology –
EUROCRYPT 2018, editado por Jesper Buus Nielsen y Vincent Rijmen,
66-98. Cham: Springer International Publishing.
Citada en: Práctica 6
Gawlick, Rainer, Nancy Lynch, y Nir Shavit. 1992. «Concurrent
timestamping made simple». En Symposium Proceedings on Theory
of Computing and Systems, 171-83. ISTCS’92. Berlin, Heidelberg:
Springer-Verlag.
Citada en: Snapshots (material extra)
Gilbert, Seth, y Nancy Lynch. 2002. «Brewer’s conjecture and the
feasibility of consistent, available, partition-tolerant web
services». SIGACT News 33 (2): 51-59. https://doi.org/10.1145/564585.564601.
Citada en: Práctica 7
Herlihy, Maurice P., y Jeannette M. Wing. 1990. «Linearizability:
a correctness condition for concurrent objects». ACM Trans.
Program. Lang. Syst. 12 (3): 463-92. https://doi.org/10.1145/78969.78972.
Citada en: Práctica 7
Herlihy, Maurice, y Nir Shavit. 2008. The Art of Multiprocessor
Programming. San Francisco, CA, USA: Morgan Kaufmann Publishers
Inc.
Citada en: Práctica 7
Intel. 2024. «What Is Hyper-Threading?» https://www.intel.com/content/www/us/en/gaming/resources/hyper-threading.html#:~:text=Intel®%20Hyper%2DThreading%20Technology%20is%20a%20hardware%20innovation%20that,can%20be%20done%20in%20parallel.].
Citada en: Práctica 1
Lamport. 1979. «How to Make a Multiprocessor Computer That
Correctly Executes Multiprocess Programs». IEEE Transactions
on Computers C-28 (9): 690-91. https://doi.org/10.1109/TC.1979.1675439.
Citada en: Práctica 7
Lipsky, Nikita. 2023. «JVM Anatomy 101». Youtube; https://youtu.be/BeMi8K0AFAc?si=X56D_vzpp-u7iNH9.
Citada en: Práctica 1
Lynch, Nancy A. 1996. Distributed Algorithms. San Francisco,
CA, USA: Morgan Kaufmann Publishers Inc.
Citada en: Práctica 6
Manson, Jeremy, William Pugh, y Sarita V. Adve. 2005. «The Java
memory model». En Proceedings of the 32nd ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Languages, 378-91. POPL ’05.
New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/1040305.1040336.
Citada en: Práctica 3
Mario Nemirovsky, Dean M. Tullsen. 17 January 2013. Multithreading
Architecture. Springer Cham.
Citada en: Práctica 1
McCaffrey, Caitie. 2015. «The Verification of a Distributed
System: A practitioner’s guide to increasing confidence in system
correctness». Queue 13 (9): 150-60. https://doi.org/10.1145/2857274.2889274.
Citada en: Snapshots (material extra)
Oaks, S., y H. Wong. 2004. Java Threads: Understanding and Mastering
Concurrent Programming. O’Reilly Media. https://books.google.com.mx/books?id=r8hhO7oGKrEC.
Citada en: Práctica 2
Saad, Muhammad, Afsah Anwar, Srivatsan Ravi, y David Mohaisen. 2024.
«Revisiting Nakamoto Consensus in Asynchronous Networks: A
Comprehensive Analysis of Bitcoin Safety and Chain Quality».
IEEE/ACM Transactions on Networking 32 (1): 844-58. https://doi.org/10.1109/TNET.2023.3302955.
Citada en: Práctica 6
Shavit, Nir. 2011. «Data Structures in the Multicore Age».
Commun. ACM 54 (3): 76-84. https://doi.org/10.1145/1897852.1897873.
Citada en: Práctica 7
Vogels, Werner. 2009. «Eventually consistent». Commun.
ACM 52 (1): 40-44. https://doi.org/10.1145/1435417.1435432.
Citada en: Práctica 7