diff --git a/.clang-tidy b/.clang-tidy
index 0936994542..c1b1ffa39f 100644
--- a/.clang-tidy
+++ b/.clang-tidy
@@ -16,7 +16,6 @@ Checks: >
     -cppcoreguidelines-no-malloc,
     -cppcoreguidelines-non-private-member-variables-in-classes,
     -cppcoreguidelines-owning-memory,
-    -cppcoreguidelines-pro-bounds-array-to-pointer-decay,
     -cppcoreguidelines-pro-bounds-pointer-arithmetic,
     -cppcoreguidelines-pro-type-const-cast,
     -cppcoreguidelines-pro-type-member-init,
diff --git a/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp b/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp
index 3377fa5343..bba5c01468 100644
--- a/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp
+++ b/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp
@@ -144,7 +144,7 @@ pgr_do_binaryBreadthFirstSearch(
     std::ostringstream err;
     std::ostringstream notice;
     const char *hint = nullptr;
-    const char c_err_msg[] = "Graph Condition Failed: Graph should have at most two distinct non-negative edge costs! "
+    const std::string c_err_msg = "Graph Condition Failed: Graph should have at most two distinct non-negative edge costs! "
                              "If there are exactly two distinct edge costs, one of them must equal zero!";
 
     try {
diff --git a/src/common/assert.cpp b/src/common/assert.cpp
index c491821514..5c96d181fe 100644
--- a/src/common/assert.cpp
+++ b/src/common/assert.cpp
@@ -44,8 +44,8 @@ std::string get_backtrace() {
         void *trace[16];
         int i = 0, trace_size = 0;
 
-        trace_size = backtrace(trace, 16);
-        char** funcNames = backtrace_symbols(trace, trace_size);
+        trace_size = backtrace(static_cast<void**>(trace), 16);
+        char** funcNames = backtrace_symbols(static_cast<void**>(trace), trace_size);
 
 
         std::string message = "\n*** Execution path***\n";