Write a Rust implementation of a Michael-Scott queue (a lock-free concurrent queue). Ensure your implementation uses `unsafe` blocks minimally and strictly adheres to Rust's ownership and borrowing rules. You must handle the `ABA` problem appropriately using atomic operations. Provide unit tests that verify thread safety by pushing and popping elements concurrently from 10 different threads. Explain the memory ordering constraints you chose.