1. 22
  1. 1

    As someone who has spent wayyyy too much time in the world of CSP I applaud this effort.

    1. 2

      How did you spend the time? golang?

      1. 2

        Was working on a proof tool for CSP for a number of years.

        1. 1

          Interesting, because to quote Hoare’s original paper:

          However, this paper also ignores many serious problems. The most serious is that it fails to suggest any proof method to assist in the development and verification of correct programs.

          Not sure what the current status is with proof tools.

          1. 2

            The common thing to use with CSP-like formalism in industry was SPIN model-checker. It was used a lot. Various temporal logics have also been modeled in proof assistants. People dont do it a lot but I think it’s more lack of interest than difficulty.

            Anyway, I took a look and found CSP-Prover. They had an initial paper then another in search results about deadlock detection. Hope yall enjoy it.

            1. 1

              Iirc SPIN is the best of the open source CSP capable checkers. Not looked at it for a few years though.