refactor(kernel): split ipc/memory/lib/thread by concern; trim comments

crates/domain/src/endpoint/wait_queue.rs

@@ -85,9 +85,7 @@ impl<const N: usize> Default for WaitQueue<N> {
 mod proofs {
     use super::*;
 
-    /// Against a simple reference model (a plain array kept in arrival
-    /// order), any sequence of pushes, pops and removals behaves the same:
-    /// FIFO order, no duplicates, nothing lost.
+    /// Matches a plain arrival-ordered array model: FIFO, no duplicates, nothing lost.
     #[kani::proof]
     #[kani::unwind(7)]
     fn behaves_like_a_fifo_without_duplicates() {