diff --git a/src/borrow_tracker/stacked_borrows/stack.rs b/src/borrow_tracker/stacked_borrows/stack.rs
index bebd14d2f1..55ff09c53f 100644
--- a/src/borrow_tracker/stacked_borrows/stack.rs
+++ b/src/borrow_tracker/stacked_borrows/stack.rs
@@ -248,7 +248,7 @@ impl<'tcx> Stack {
     #[cfg(feature = "stack-cache")]
     fn find_granting_cache(&mut self, access: AccessKind, tag: BorTag) -> Option<usize> {
         // This looks like a common-sense optimization; we're going to do a linear search of the
-        // cache or the borrow stack to scan the shorter of the two. This optimization is miniscule
+        // cache or the borrow stack to scan the shorter of the two. This optimization is minuscule
         // and this check actually ensures we do not access an invalid cache.
         // When a stack is created and when items are removed from the top of the borrow stack, we
         // need some valid value to populate the cache. In both cases, we try to use the bottom
diff --git a/src/shims/windows/foreign_items.rs b/src/shims/windows/foreign_items.rs
index ec4c610148..c81d6b2f7f 100644
--- a/src/shims/windows/foreign_items.rs
+++ b/src/shims/windows/foreign_items.rs
@@ -653,7 +653,7 @@ pub trait EvalContextExt<'mir, 'tcx: 'mir>: crate::MiriInterpCxExt<'mir, 'tcx> {
                     OsStr::new(&formatted),
                     buffer,
                     size.into(),
-                    /*trunacte*/ false,
+                    /*truncate*/ false,
                 )?;
                 if !complete {
                     // The API docs don't say what happens when the buffer is not big enough...
diff --git a/src/shims/x86/mod.rs b/src/shims/x86/mod.rs
index 615821b2e3..a5bfd30cf6 100644
--- a/src/shims/x86/mod.rs
+++ b/src/shims/x86/mod.rs
@@ -650,7 +650,7 @@ fn convert_float_to_int<'tcx>(
         let dest = this.project_index(&dest, i)?;
 
         let res = this.float_to_int_checked(&op, dest.layout, rnd)?.unwrap_or_else(|| {
-            // Fallback to minimum acording to SSE/AVX semantics.
+            // Fallback to minimum according to SSE/AVX semantics.
             ImmTy::from_int(dest.layout.size.signed_int_min(), dest.layout)
         });
         this.write_immediate(*res, &dest)?;
diff --git a/src/shims/x86/sse.rs b/src/shims/x86/sse.rs
index b8c0dfb1c7..1760883731 100644
--- a/src/shims/x86/sse.rs
+++ b/src/shims/x86/sse.rs
@@ -182,7 +182,7 @@ pub(super) trait EvalContextExt<'mir, 'tcx: 'mir>:
                 };
 
                 let res = this.float_to_int_checked(&op, dest.layout, rnd)?.unwrap_or_else(|| {
-                    // Fallback to minimum acording to SSE semantics.
+                    // Fallback to minimum according to SSE semantics.
                     ImmTy::from_int(dest.layout.size.signed_int_min(), dest.layout)
                 });
 
diff --git a/src/shims/x86/sse2.rs b/src/shims/x86/sse2.rs
index 9db30d7ddc..9268766fc0 100644
--- a/src/shims/x86/sse2.rs
+++ b/src/shims/x86/sse2.rs
@@ -420,7 +420,7 @@ pub(super) trait EvalContextExt<'mir, 'tcx: 'mir>:
                 };
 
                 let res = this.float_to_int_checked(&op, dest.layout, rnd)?.unwrap_or_else(|| {
-                    // Fallback to minimum acording to SSE semantics.
+                    // Fallback to minimum according to SSE semantics.
                     ImmTy::from_int(dest.layout.size.signed_int_min(), dest.layout)
                 });
 
@@ -447,7 +447,7 @@ pub(super) trait EvalContextExt<'mir, 'tcx: 'mir>:
                 let res0 = this.float_to_float_or_int(&right0, dest0.layout)?;
                 this.write_immediate(*res0, &dest0)?;
 
-                // Copy remianing from `left`
+                // Copy remaining from `left`
                 for i in 1..dest_len {
                     this.copy_op(&this.project_index(&left, i)?, &this.project_index(&dest, i)?)?;
                 }
diff --git a/tests/pass/const-addrs.rs b/tests/pass/const-addrs.rs
index 6c14f0b679..727c67ebfb 100644
--- a/tests/pass/const-addrs.rs
+++ b/tests/pass/const-addrs.rs
@@ -4,7 +4,7 @@
 // deallocated.
 // In Miri we explicitly store previously-assigned AllocIds for each const and ensure
 // that we only hand out a finite number of AllocIds per const.
-// MIR inlining will put every evaluation of the const we're repeatedly evaluting into the same
+// MIR inlining will put every evaluation of the const we're repeatedly evaluating into the same
 // stack frame, breaking this test.
 //@compile-flags: -Zinline-mir=no
 #![feature(strict_provenance)]
diff --git a/tests/pass/issues/issue-miri-1909.rs b/tests/pass/issues/issue-miri-1909.rs
index ce2114e760..8a2e67cdd0 100644
--- a/tests/pass/issues/issue-miri-1909.rs
+++ b/tests/pass/issues/issue-miri-1909.rs
@@ -9,7 +9,7 @@ use std::alloc::System;
 /// `ptr` must be valid for writes of `len` bytes
 unsafe fn volatile_write_zeroize_mem(ptr: *mut u8, len: usize) {
     for i in 0..len {
-        // ptr as usize + i can't overlow because `ptr` is valid for writes of `len`
+        // ptr as usize + i can't overflow because `ptr` is valid for writes of `len`
         let ptr_new: *mut u8 = ((ptr as usize) + i) as *mut u8;
         // SAFETY: `ptr` is valid for writes of `len` bytes, so `ptr_new` is valid for a
         // byte write