Meeting C++ 2025 - Seeing all possible paths forward

Hana Dusíková

On Day 1 at 14:30 (CET/Berlin) in Track A [Saphir Room and online]

Let's look at measuring (constexpr) test coverage, evaluating coroutines, and an undefined behaviour in program. These topic has all one thing in common: path analysis. I will show how these thing can be implemented in a compiler and how thinking about all possible paths can help you write better and safer code. 

This talk is a sequel of "My Favorite Data Structures" talk from last year, but I won't expect you to see it.

Try to look at following code and ask your self, how many possible paths are there?

int divide(int x, int y) {
  if (y != 0) return 0;
  return x / y;
}

Please login to comment