This time I’d like to focus on operating systems architectures. The base to the consideration is Operating system concepts book written by Abraham Silberschatz, Peter B. Galvin, Greg Cagne [1].
*
^
^ ^
^ @ ^
^ ^ ^ ^
^ @ @ @ ^
^ ^ @ @ ^ ^
^ @ ^ @ ^ @ ^
^ ^ ^ ^ ^ ^ ^ ^
^ @ @ @ @ @ @ @ ^
^ ^ @ @ @ @ @ @ ^ ^
^ @ ^ @ @ @ @ @ ^ @ ^
^ ^ ^ ^ @ @ @ @ ^ ^ ^ ^
^ @ @ @ ^ @ @ @ ^ @ @ @ ^
^ ^ @ @ ^ ^ @ @ ^ ^ @ @ ^ ^
^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^
^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^
^ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ ^
^ ^ @ @ @ @ @ @ @ @ @ @ @ @ @ @ ^ ^
^ @ ^ @ @ @ @ @ @ @ @ @ @ @ @ @ ^ @ ^
^ ^ ^ ^ @ @ @ @ @ @ @ @ @ @ @ @ ^ ^ ^ ^
^ @ @ @ ^ @ @ @ @ @ @ @ @ @ @ @ ^ @ @ @ ^
^ ^ @ @ ^ ^ @ @ @ @ @ @ @ @ @ @ ^ ^ @ @ ^ ^
^ @ ^ @ ^ @ ^ @ @ @ @ @ @ @ @ @ ^ @ ^ @ ^ @ ^
^ ^ ^ ^ ^ ^ ^ ^ @ @ @ @ @ @ @ @ ^ ^ ^ ^ ^ ^ ^ ^
^ @ @ @ @ @ @ @ ^ @ @ @ @ @ @ @ ^ @ @ @ @ @ @ @ ^
^ ^ @ @ @ @ @ @ ^ ^ @ @ @ @ @ @ ^ ^ @ @ @ @ @ @ ^ ^
^ @ ^ @ @ @ @ @ ^ @ ^ @ @ @ @ @ ^ @ ^ @ @ @ @ @ ^ @ ^
^ ^ ^ ^ @ @ @ @ ^ ^ ^ ^ @ @ @ @ ^ ^ ^ ^ @ @ @ @ ^ ^ ^ ^
^ @ @ @ ^ @ @ @ ^ @ @ @ ^ @ @ @ ^ @ @ @ ^ @ @ @ ^ @ @ @ ^
^ ^ @ @ ^ ^ @ @ ^ ^ @ @ ^ ^ @ @ ^ ^ @ @ ^ ^ @ @ ^ ^ @ @ ^ ^
^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^ @ ^
^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^
This Xmas tree is written in Java. If you are interested in code and theory behind the tree structure, please read on.
This post is about halting problem, infinite loops and their detection in FindBugsTM. The initial inspiration to write it was Tom Stuart’s presentation “Impossible Programs” from QCon London 2014 Conference and further investigation of the mentioned issues. In the beginning there are introduced basic terms and then is the practical part with Java code snippets with the FindBugs analysis outcome.