diff --git a/examples/viz/tree_visualization.cpp b/examples/viz/tree_visualization.cpp
index 40bec673d..2d8442e3e 100644
--- a/examples/viz/tree_visualization.cpp
+++ b/examples/viz/tree_visualization.cpp
@@ -28,7 +28,7 @@ template <typename Points>
 void loadPointCloud(std::string const &filename, Points &random_points)
 {
   static_assert(Kokkos::is_view_v<Points>);
-  static_assert(Points::rank == 1);
+  static_assert(Points::rank() == 1);
   static_assert(
       ArborX::GeometryTraits::dimension_v<typename Points::value_type> == 3);
 
@@ -55,7 +55,7 @@ template <typename Points>
 void writePointCloud(Points random_points, std::string const &filename)
 {
   static_assert(Kokkos::is_view_v<Points>);
-  static_assert(Points::rank == 1);
+  static_assert(Points::rank() == 1);
   static_assert(
       ArborX::GeometryTraits::dimension_v<typename Points::value_type> == 3);
 
diff --git a/src/distributed/detail/ArborX_Distributor.hpp b/src/distributed/detail/ArborX_Distributor.hpp
index a7637f020..ce05fd4c4 100644
--- a/src/distributed/detail/ArborX_Distributor.hpp
+++ b/src/distributed/detail/ArborX_Distributor.hpp
@@ -217,7 +217,7 @@ class Distributor
     Kokkos::Profiling::ScopedRegion guard(
         "ArborX::Distributor::createFromSends(batched)");
 
-    static_assert(View::rank == 1);
+    static_assert(View::rank() == 1);
     static_assert(
         std::is_same<typename View::non_const_value_type, int>::value);
 
@@ -238,7 +238,7 @@ class Distributor
     Kokkos::Profiling::ScopedRegion guard(
         "ArborX::Distributor::createFromSends");
 
-    static_assert(View::rank == 1);
+    static_assert(View::rank() == 1);
     static_assert(
         std::is_same<typename View::non_const_value_type, int>::value);
 
@@ -289,12 +289,12 @@ class Distributor
     static_assert(
         KokkosExt::is_accessible_from<typename decltype(_permute)::memory_space,
                                       ExecutionSpace>::value);
-    static_assert(ExportView::rank == 1 &&
+    static_assert(ExportView::rank() == 1 &&
                   (std::is_same_v<typename ExportView::array_layout,
                                   Kokkos::LayoutLeft> ||
                    std::is_same_v<typename ExportView::array_layout,
                                   Kokkos::LayoutRight>));
-    static_assert(ImportView::rank == 1 &&
+    static_assert(ImportView::rank() == 1 &&
                   (std::is_same_v<typename ImportView::array_layout,
                                   Kokkos::LayoutLeft> ||
                    std::is_same_v<typename ImportView::array_layout,
diff --git a/src/interpolation/ArborX_InterpMovingLeastSquares.hpp b/src/interpolation/ArborX_InterpMovingLeastSquares.hpp
index cc4aa76f3..15af3fdfb 100644
--- a/src/interpolation/ArborX_InterpMovingLeastSquares.hpp
+++ b/src/interpolation/ArborX_InterpMovingLeastSquares.hpp
@@ -146,7 +146,7 @@ class MovingLeastSquares
         "Memory space must be accessible from the execution space");
 
     // SourceValues is a 1D view of all source values
-    static_assert(Kokkos::is_view_v<SourceValues> && SourceValues::rank == 1,
+    static_assert(Kokkos::is_view_v<SourceValues> && SourceValues::rank() == 1,
                   "Source values must be a 1D view of values");
     static_assert(
         KokkosExt::is_accessible_from<typename SourceValues::memory_space,
@@ -154,7 +154,7 @@ class MovingLeastSquares
         "Source values must be accessible from the execution space");
 
     // ApproxValues is a 1D view for approximated values
-    static_assert(Kokkos::is_view_v<ApproxValues> && ApproxValues::rank == 1,
+    static_assert(Kokkos::is_view_v<ApproxValues> && ApproxValues::rank() == 1,
                   "Approx values must be a 1D view");
     static_assert(
         KokkosExt::is_accessible_from<typename ApproxValues::memory_space,
diff --git a/src/interpolation/detail/ArborX_InterpDetailsMovingLeastSquaresCoefficients.hpp b/src/interpolation/detail/ArborX_InterpDetailsMovingLeastSquaresCoefficients.hpp
index 05722488e..7596c50d1 100644
--- a/src/interpolation/detail/ArborX_InterpDetailsMovingLeastSquaresCoefficients.hpp
+++ b/src/interpolation/detail/ArborX_InterpDetailsMovingLeastSquaresCoefficients.hpp
@@ -241,7 +241,7 @@ auto movingLeastSquaresCoefficients(ExecutionSpace const &space,
       "Memory space must be accessible from the execution space");
 
   // SourcePoints is a 2D view of points
-  static_assert(Kokkos::is_view_v<SourcePoints> && SourcePoints::rank == 2,
+  static_assert(Kokkos::is_view_v<SourcePoints> && SourcePoints::rank() == 2,
                 "source points must be a 2D view of points");
   static_assert(
       KokkosExt::is_accessible_from<typename SourcePoints::memory_space,
diff --git a/src/interpolation/detail/ArborX_InterpDetailsSymmetricPseudoInverseSVD.hpp b/src/interpolation/detail/ArborX_InterpDetailsSymmetricPseudoInverseSVD.hpp
index 19abe8faf..e277ee095 100644
--- a/src/interpolation/detail/ArborX_InterpDetailsSymmetricPseudoInverseSVD.hpp
+++ b/src/interpolation/detail/ArborX_InterpDetailsSymmetricPseudoInverseSVD.hpp
@@ -26,7 +26,7 @@ KOKKOS_INLINE_FUNCTION void
 ensureIsSquareMatrix([[maybe_unused]] Matrix const &mat)
 {
   static_assert(Kokkos::is_view_v<Matrix>, "Matrix must be a view");
-  static_assert(Matrix::rank == 2, "Matrix must be 2D");
+  static_assert(Matrix::rank() == 2, "Matrix must be 2D");
   KOKKOS_ASSERT(mat.extent(0) == mat.extent(1));
 }
 
@@ -95,7 +95,7 @@ KOKKOS_FUNCTION void symmetricPseudoInverseSVDKernel(Matrix &mat, Diag &diag,
                 "mat must be writable");
 
   static_assert(Kokkos::is_view_v<Diag>, "diag must be a view");
-  static_assert(Diag::rank == 1, "diag must be 1D");
+  static_assert(Diag::rank() == 1, "diag must be 1D");
   static_assert(!std::is_const_v<typename Diag::value_type>,
                 "diag must be writable");
 
@@ -237,7 +237,7 @@ void symmetricPseudoInverseSVD(ExecutionSpace const &space,
   static_assert(Kokkos::is_view_v<InOutMatrices>, "matrices must be a view");
   static_assert(!std::is_const_v<typename InOutMatrices::value_type>,
                 "matrices must be writable");
-  static_assert(InOutMatrices::rank == 3,
+  static_assert(InOutMatrices::rank() == 3,
                 "matrices must be a list of square matrices");
   static_assert(
       ArborX::Details::KokkosExt::is_accessible_from<
diff --git a/src/kokkos_ext/ArborX_KokkosExtMinMaxReduce.hpp b/src/kokkos_ext/ArborX_KokkosExtMinMaxReduce.hpp
index be5839d1b..19191dbf8 100644
--- a/src/kokkos_ext/ArborX_KokkosExtMinMaxReduce.hpp
+++ b/src/kokkos_ext/ArborX_KokkosExtMinMaxReduce.hpp
@@ -30,7 +30,8 @@ minmax_reduce(ExecutionSpace const &space, ViewType const &v)
   static_assert(is_accessible_from<typename ViewType::memory_space,
                                    ExecutionSpace>::value,
                 "View must be accessible from the execution space");
-  static_assert(ViewType::rank == 1, "minmax_reduce requires a View of rank 1");
+  static_assert(ViewType::rank() == 1,
+                "minmax_reduce requires a View of rank 1");
 
   auto const n = v.extent(0);
   ARBORX_ASSERT(n > 0);
@@ -65,7 +66,7 @@ typename ViewType::non_const_value_type min_reduce(ExecutionSpace const &space,
   static_assert(is_accessible_from<typename ViewType::memory_space,
                                    ExecutionSpace>::value,
                 "View must be accessible from the execution space");
-  static_assert(ViewType::rank == 1, "min_reduce requires a View of rank 1");
+  static_assert(ViewType::rank() == 1, "min_reduce requires a View of rank 1");
 
   auto const n = v.extent(0);
   ARBORX_ASSERT(n > 0);
@@ -92,7 +93,7 @@ typename ViewType::non_const_value_type max_reduce(ExecutionSpace const &space,
   static_assert(is_accessible_from<typename ViewType::memory_space,
                                    ExecutionSpace>::value,
                 "View must be accessible from the execution space");
-  static_assert(ViewType::rank == 1, "max_reduce requires a View of rank 1");
+  static_assert(ViewType::rank() == 1, "max_reduce requires a View of rank 1");
 
   auto const n = v.extent(0);
   ARBORX_ASSERT(n > 0);
diff --git a/src/kokkos_ext/ArborX_KokkosExtSort.hpp b/src/kokkos_ext/ArborX_KokkosExtSort.hpp
index 2f7f4341b..f76005e2e 100644
--- a/src/kokkos_ext/ArborX_KokkosExtSort.hpp
+++ b/src/kokkos_ext/ArborX_KokkosExtSort.hpp
@@ -83,8 +83,8 @@ void sortByKey(ExecutionSpace const &space, Keys &keys, Values &values)
 
   static_assert(Kokkos::is_view<Keys>::value);
   static_assert(Kokkos::is_view<Values>::value);
-  static_assert(Keys::rank == 1);
-  static_assert(Values::rank == 1);
+  static_assert(Keys::rank() == 1);
+  static_assert(Values::rank() == 1);
   static_assert(KokkosExt::is_accessible_from<typename Keys::memory_space,
                                               ExecutionSpace>::value);
   static_assert(KokkosExt::is_accessible_from<typename Values::memory_space,
@@ -125,8 +125,8 @@ void sortByKey(
   using ExecutionSpace = std::decay_t<decltype(space)>;
   static_assert(Kokkos::is_view<Keys>::value);
   static_assert(Kokkos::is_view<Values>::value);
-  static_assert(Keys::rank == 1);
-  static_assert(Values::rank == 1);
+  static_assert(Keys::rank() == 1);
+  static_assert(Values::rank() == 1);
   static_assert(KokkosExt::is_accessible_from<typename Keys::memory_space,
                                               ExecutionSpace>::value);
   static_assert(KokkosExt::is_accessible_from<typename Values::memory_space,
@@ -158,8 +158,8 @@ void sortByKey(Kokkos::Experimental::SYCL const &space, Keys &keys,
   using ExecutionSpace = std::decay_t<decltype(space)>;
   static_assert(Kokkos::is_view<Keys>::value);
   static_assert(Kokkos::is_view<Values>::value);
-  static_assert(Keys::rank == 1);
-  static_assert(Values::rank == 1);
+  static_assert(Keys::rank() == 1);
+  static_assert(Values::rank() == 1);
   static_assert(KokkosExt::is_accessible_from<typename Keys::memory_space,
                                               ExecutionSpace>::value);
   static_assert(KokkosExt::is_accessible_from<typename Values::memory_space,
diff --git a/src/kokkos_ext/ArborX_KokkosExtStdAlgorithms.hpp b/src/kokkos_ext/ArborX_KokkosExtStdAlgorithms.hpp
index ceea6d7d3..b9d72ca54 100644
--- a/src/kokkos_ext/ArborX_KokkosExtStdAlgorithms.hpp
+++ b/src/kokkos_ext/ArborX_KokkosExtStdAlgorithms.hpp
@@ -33,7 +33,7 @@ void iota(ExecutionSpace const &space, ViewType const &v,
   static_assert(is_accessible_from<typename ViewType::memory_space,
                                    ExecutionSpace>::value,
                 "View must be accessible from the execution space");
-  static_assert(unsigned(ViewType::rank) == unsigned(1),
+  static_assert(unsigned(ViewType::rank()) == unsigned(1),
                 "iota requires a View of rank 1");
 
   using ValueType = typename ViewType::value_type;
diff --git a/src/misc/ArborX_SortUtils.hpp b/src/misc/ArborX_SortUtils.hpp
index f8b57c3a5..d68c42347 100644
--- a/src/misc/ArborX_SortUtils.hpp
+++ b/src/misc/ArborX_SortUtils.hpp
@@ -51,8 +51,8 @@ void applyInversePermutation(ExecutionSpace const &space,
 {
   static_assert(Kokkos::is_view_v<InputView>);
   static_assert(Kokkos::is_view_v<OutputView>);
-  static_assert(InputView::rank == 1);
-  static_assert(OutputView::rank == 1);
+  static_assert(InputView::rank() == 1);
+  static_assert(OutputView::rank() == 1);
   static_assert(std::is_integral_v<typename PermutationView::value_type>);
 
   auto const n = input_view.extent(0);
@@ -73,8 +73,8 @@ void applyPermutation(ExecutionSpace const &space,
 {
   static_assert(Kokkos::is_view_v<InputView>);
   static_assert(Kokkos::is_view_v<OutputView>);
-  static_assert(InputView::rank == 1);
-  static_assert(OutputView::rank == 1);
+  static_assert(InputView::rank() == 1);
+  static_assert(OutputView::rank() == 1);
   static_assert(std::is_integral_v<typename PermutationView::value_type>);
 
   auto const n = input_view.extent(0);
diff --git a/src/spatial/detail/ArborX_AccessTraits.hpp b/src/spatial/detail/ArborX_AccessTraits.hpp
index 7eed68bc6..4bc7c1151 100644
--- a/src/spatial/detail/ArborX_AccessTraits.hpp
+++ b/src/spatial/detail/ArborX_AccessTraits.hpp
@@ -39,7 +39,7 @@ using AccessTraitsNotSpecializedArchetypeAlias =
 
 template <typename View, typename Tag>
 struct AccessTraits<
-    View, Tag, std::enable_if_t<Kokkos::is_view<View>{} && View::rank == 1>>
+    View, Tag, std::enable_if_t<Kokkos::is_view<View>{} && View::rank() == 1>>
 {
   // Returns a const reference
   KOKKOS_FUNCTION static typename View::const_value_type &get(View const &v,
@@ -56,7 +56,7 @@ struct AccessTraits<
 
 template <typename View, typename Tag>
 struct AccessTraits<
-    View, Tag, std::enable_if_t<Kokkos::is_view<View>{} && View::rank == 2>>
+    View, Tag, std::enable_if_t<Kokkos::is_view<View>{} && View::rank() == 2>>
 {
   template <std::size_t... Is>
   KOKKOS_FUNCTION static auto getPoint(std::index_sequence<Is...>,
diff --git a/test/ArborX_EnableViewComparison.hpp b/test/ArborX_EnableViewComparison.hpp
index f391299ec..b40c6894c 100644
--- a/test/ArborX_EnableViewComparison.hpp
+++ b/test/ArborX_EnableViewComparison.hpp
@@ -29,7 +29,7 @@ template <typename U, typename V>
 void arborxViewCheck(U const &u, V const &v, std::string const &u_name,
                      std::string const &v_name, CommonValueType<U, V> tol = 0)
 {
-  static constexpr int rank = U::rank;
+  static constexpr int rank = U::rank();
 
   bool same_dim_size = true;
   for (int i = 0; i < rank; i++)
@@ -88,8 +88,8 @@ void arborxViewCheck(U const &u, V const &v, std::string const &u_name,
     auto view_a = Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace{}, u); \
     auto view_b = Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace{}, v); \
                                                                                \
-    static_assert(unsigned(std::decay_t<decltype(u)>::rank) ==                 \
-                      unsigned(std::decay_t<decltype(v)>::rank),               \
+    static_assert(unsigned(std::decay_t<decltype(u)>::rank()) ==               \
+                      unsigned(std::decay_t<decltype(v)>::rank()),             \
                   "'" #VIEWA "' and '" #VIEWB "' must have the same rank");    \
                                                                                \
     std::string view_a_name(#VIEWA);                                           \
@@ -115,7 +115,7 @@ struct is_forward_iterable<Kokkos::View<T, P...>> : public boost::mpl::true_
   // NOTE Prefer static assertion to SFINAE because error message about no
   // operator== for the operands is not as clear.
   static_assert(
-      Kokkos::View<T, P...>::rank == 1 &&
+      Kokkos::View<T, P...>::rank() == 1 &&
           !std::is_same_v<typename Kokkos::View<T, P...>::array_layout,
                           Kokkos::LayoutStride> &&
           ArborX::Details::KokkosExt::is_accessible_from_host<