diff --git a/ir/function.cpp b/ir/function.cpp
index 9afcfc44d..b737fd89e 100644
--- a/ir/function.cpp
+++ b/ir/function.cpp
@@ -1090,7 +1090,7 @@ void LoopAnalysis::getDepthFirstSpanningTree() {
   }
 }
 
-// Implemention of Tarjan-Havlak algorithm.
+// Implementation of Tarjan-Havlak algorithm.
 //
 // Irreducible loops are partially supported.
 //
diff --git a/ir/memory.cpp b/ir/memory.cpp
index bab7af461..38585aa93 100644
--- a/ir/memory.cpp
+++ b/ir/memory.cpp
@@ -2070,7 +2070,7 @@ expr Memory::int2ptr(const expr &val0) const {
         val = val.subst(cond, subst);
         continue;
       }
-      // There's only only possible bid in this expression
+      // There's only one possible bid in this expression
       if (blks.size() == 1) {
         auto &fn = *blks.begin();
         expr bid;
@@ -2141,7 +2141,7 @@ expr Memory::blockValRefined(const Memory &other, unsigned bid, bool local,
     if (is_fn1 == 2 && is_fn2 == 2)
       return mem1.val == mem2;
 
-    // an inital memory (m0) vs a function call is always false, as a function
+    // an initial memory (m0) vs a function call is always false, as a function
     // may always store something to memory
     assert((is_fn1 == 1 && is_fn2 == 2) || (is_fn1 == 2 && is_fn2 == 1));
     return false;
diff --git a/ir/pointer.cpp b/ir/pointer.cpp
index faf6027ed..81542a113 100644
--- a/ir/pointer.cpp
+++ b/ir/pointer.cpp
@@ -431,7 +431,7 @@ static pair<expr, expr> is_dereferenceable(Pointer &p,
   return { std::move(cond), p.isAligned(align) };
 }
 
-// When bytes is 0, pointer is always derefenceable
+// When bytes is 0, pointer is always dereferenceable
 pair<AndExpr, expr>
 Pointer::isDereferenceable(const expr &bytes0, uint64_t align,
                            bool iswrite, bool ignore_accessability) {
diff --git a/ir/type.cpp b/ir/type.cpp
index 9417699c2..18f7d2f72 100644
--- a/ir/type.cpp
+++ b/ir/type.cpp
@@ -467,7 +467,7 @@ expr FloatType::fromFloat(State &s, const expr &fp, const Type &from_type0,
     }
   }
 
-  // 4) target specific preferred QNaN (a set, possibliy empty)
+  // 4) target specific preferred QNaN (a set, possibly empty)
   // approximated by adding just one more value
   exprs.add(expr::mkUInt(1, 1).concat(var.extract(fraction_bits - 2, 0)),
             expr(true));
diff --git a/llvm_util/utils.cpp b/llvm_util/utils.cpp
index 80b744c72..0e3aa9550 100644
--- a/llvm_util/utils.cpp
+++ b/llvm_util/utils.cpp
@@ -40,7 +40,7 @@ FloatType bfloat_type("bfloat", FloatType::BFloat);
 
 // cache complex types
 unordered_map<const llvm::Type*, unique_ptr<Type>> type_cache;
-unsigned type_id_counter; // for unamed types
+unsigned type_id_counter; // for unnamed types
 
 Function *current_fn;
 unordered_map<const llvm::Value*, Value*> value_cache;
diff --git a/smt/exprs.cpp b/smt/exprs.cpp
index 96c03c087..e48b37d70 100644
--- a/smt/exprs.cpp
+++ b/smt/exprs.cpp
@@ -90,7 +90,7 @@ static expr simplify(const expr &e, const expr &cond, bool negate) {
   // (bvadd ((_ extract ..) (ite cond X Y)) Z)
   // -> (bvadd ((_ extract ..) X) Z)  or  (bvadd ((_ extract ..) Y) Z)
   // NB: although this potentially increases the circuit size, it allows further
-  // simplifications down the road, and has been shown to be benefitial to perf
+  // simplifications down the road, and has been shown to be beneficial to perf
   expr a, b;
   if (e.isAdd(a, b)) {
     auto test = [&](const expr &a, const expr &b) -> expr {
diff --git a/tools/alive-tv.cpp b/tools/alive-tv.cpp
index 0a8bae325..0e4962988 100644
--- a/tools/alive-tv.cpp
+++ b/tools/alive-tv.cpp
@@ -87,7 +87,7 @@ version )EOF";
   Usage += R"EOF(
 see alive-tv --version for LLVM version info,
 
-This program takes either one or two LLVM IR files files as
+This program takes either one or two LLVM IR files as
 command-line arguments. Both .bc and .ll files are supported.
 
 If two files are provided, alive-tv checks that functions in the
@@ -110,7 +110,7 @@ by postfixing, after "src" and "tgt", either a unique integer or an
 '_' followed by an arbitrary string. For example if the file contains
 the following functions "src", "tgt", "src4", "tgt4", "src_foo",
 "tgt_foo", "src_bar", "tgt5", then the pairs "src" <-> "tgt", "src4"
-<-> "tgt4", and "src_foo" <-> "tgt_foo" will be verifed but "src_bar"
+<-> "tgt4", and "src_foo" <-> "tgt_foo" will be verified but "src_bar"
 and "tgt5" will unused.
 )EOF";
 
diff --git a/tools/alive.cpp b/tools/alive.cpp
index 5fb68b628..e21166420 100644
--- a/tools/alive.cpp
+++ b/tools/alive.cpp
@@ -29,7 +29,7 @@ static void show_help() {
           " -smt-stats\t\tShow SMT statistics\n"
           " -smt-to:x\t\tTimeout for SMT queries in ms\n"
           " -smt-random-seed:x\tRandom seed for the SMT solver\n"
-          " -max-mem:x\t\tMax memory consumption in MB (aprox)\n"
+          " -max-mem:x\t\tMax memory consumption in MB (approx)\n"
           " -smt-verbose\t\tPrint all SMT queries\n"
           " -tactic-verbose\tDebug SMT tactics\n"
           " -smt-log\t\tLog interactions with the SMT solver\n"
diff --git a/tools/transform.cpp b/tools/transform.cpp
index 20724c29e..5460e4fd4 100644
--- a/tools/transform.cpp
+++ b/tools/transform.cpp
@@ -959,7 +959,7 @@ static void calculateAndInitConstants(Transform &t) {
   set<string> inaccessiblememonly_fns;
   num_inaccessiblememonly_fns = 0;
 
-  // Mininum access size (in bytes)
+  // Minimum access size (in bytes)
   uint64_t min_access_size = 8;
   uint64_t loc_src_alloc_aligned_size = 0;
   uint64_t loc_tgt_alloc_aligned_size = 0;
diff --git a/tv/tv.cpp b/tv/tv.cpp
index 361f5a87e..4ce4ab5c5 100644
--- a/tv/tv.cpp
+++ b/tv/tv.cpp
@@ -56,7 +56,7 @@ llvm::cl::opt<int> max_subprocesses("max-subprocesses",
 
 llvm::cl::opt<long> subprocess_timeout("tv-subprocess-timeout",
   llvm::cl::desc("Maximum time, in seconds, that a parallel TV call "
-                 "will be allowed to execeute (default=infinite)"),
+                 "will be allowed to execute (default=infinite)"),
   llvm::cl::init(-1), llvm::cl::cat(alive_cmdargs));
 
 llvm::cl::opt<bool> batch_opts("tv-batch-opts",