Model Checking, Tla Plus, TLC, Java, Concurrency.
deadlock. The shortest trace is 431 steps and TLC had to generate 2,219,959,047 states (23,011,357 of which are distinct) to find it. How often is it going to happen to the Java program with random timings? The buffer example described here is deadlock free exactly when the number of threads is at