Literatur

1. [1] “Aleph One”. Smashing The Stack For Fun And Profit. In: Phrack 7.49 (Nov. 1996). http://www.phrack.org/phrack/49/P49-14.
2. [2] Jon A. Rochlis und Mark W. Eichin. With Microscope and Tweezers: The Worm from MIT's Perspective. In: Communications of the ACM 32.6 (Juni 1989), S. 689–698.
3. [3] Jean-Philippe Aumasson. Serious Cryptography. No Starch Press, 2018.
4. [4] David Cassel. Pipe: How the System Call That Ties Unix Together Came About. Juli 2019. URL: https://thenewstack.io/pipe-how-the-system-call-that-ties-unix-together-came-about/.
5. [5] E.W. Dijkstra. Solution of a Problem in Concurrent Programming Control. In: Communications of the ACM 8.9 (Sep. 1965), S. 569.
6. [6] Edgar Dijkstra. Go To Statement Considered Harmful. In: Communications of the ACM 11.3 (März 1968), S. 147–148. DOI: 10.1145/362929.362947.
7. [7] Allen B. Downey. The Little Book of Semaphores. 2016. URL: http://grenteapress.com/wp/semaphores.
8. [8] Alfred J. Menezes, Paul C. van Oorschot und Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
9. [9] Sudarshan K. Dhall und C. L. Liu. On a Real-Time Scheduling Problem. In: Operations Research 26.1 (Jan. 1978), S. 127–140.
10. [10] Kyle Keen. Maintainers Matter. Juni 2016. URL: http://kmkeen.com/maintainers-matter/2016-06-15-11-51-16-472.html.
11. [11] Michael Kerrisk. The Linux Programming Interface. No Starch Press, 2010.
12. [12] Felix Leder und Tillmann Werner. Know Your Enemy: Containing Conficker. Apr. 2009. URL: https://www.honeynet.org/papers/kye-kyt/know-your-enemy-containing-conficker/.
13. [13] Jochen Liedtke. On μ-Kernel Construction. In: Proceedings of the 15th ACM Symposium on Operating System Principles (SOSP). Copper Mountain Resort, Colorado, Dez. 1995.
14. [14] Mark Ludwig. The Little Black Book of Computer Viruses. American Eagle Publications, Inc., 1991.
15. [15] Deutsches Institut für Normung. DIN 44300-1:1988-11 Informationsverarbeitung – Begriffe – Allgemeine Begriffe. Beuth Verlag, Berlin, Nov. 1988.
16. [16] P. J. Courtois, F. Heymans und D. L. Parnas. Concurrent Control with “Readers” and “Writers”. In: Communications of the ACM 14.10 (Okt. 1971), S. 667–668.
17. [17] Gary L. Peterson. Myths about the Mutual Exclusion Problem. In: Information Processing Letters 12.3 (Juni 1981), S. 116.
18. [18] Martin Pohlack. “Plattenscheduling für Quality-Assuring-Scheduling”. Magisterarb. Fakultät Informatik, Professur Betriebssysteme: Technische Universität Dresden, März 2003.
19. [19] David R. Butenhof. Programming with POSIX Threads. Addison-Wesley, 1997.
20. [20] Paul R. Wilson u. a. Dynamic Storage Allocation: A Survey and Critical Review. In: Proceedings of the International Workshop on Memory Management. Kinross, Scotland (UK), Sep. 1995.
21. [21] Ohad Rodeh, Josef Bacik und Chris Mason. BTRFS: The Linux B-Tree Filesystem. In: ACM Computing Surveys 9.3 (Aug. 2013), 9:1–9:32. DOI: 10.1145/2501620.2501623.
22. [22] Mendel Rosenblum und John K. Ousterhout. The Design and Implementation of a Log-Structured File System. In: Proceedings of the 13th ACM Symposium on Operating System Principles (SOSP-13). Pacific Grove, CA, Okt. 1991.
23. [23] Chris Ruemmler und John Wilkes. An introduction to disk drive modeling. In: IEEE Computer 27.3 (1994), S. 17–29.
24. [24] Mark Russinovich, David A. Solomon und Alex Ionescu. Windows Internals Part 1. 6. Aufl. Redmond, WA: Microsoft Press, 2012.
25. [25] Andrew S. Tanenbaum und Albert S. Woodhall. Operating Systems: Design and Implementation. Prentice Hall, 2006.
26. [26] W. Richard Stevens. Advanced Programming in the UNIX Environment. Professional Computing Series. Addison-Wesley, 1993.
27. [27] Andrew S. Tanenbaum und Herbert Bos. Modern Operating Systems: Global Edition. 4. Aufl. Pearson, 2014.
28. [28] Gadi Taubenfeld. Synchronization Algorithms and Concurrent Programming. Pearson, 2006.
29. [29] Andrew Waterman, Krste Asanović und John Hauser, Hrsg. The RISC-V Instruction Set Manual, Volume II: Privileged Architecture. Document Version 20211203. RISC-V International, Dez. 2021.