-* Many programs require some form of fairness in order to terminate in a finite
- amount of time. C11Tester supports the `-y num` and `-f num` flags for these
- cases. The `-y` option (yield-based fairness) is preferable, but it requires
- careful usage of yields (i.e., `thrd_yield()`) in the test program. For
- programs without proper `thrd_yield()`, you may consider using `-f` instead.
-
-* Deadlock detection: C11Tester can detect deadlocks. For instance, try the
- following test program.
-
- > ./run.sh test/deadlock.o
-
- Deadlock detection currently detects when a thread is about to step into a
- deadlock, without actually including the final step in the trace. But you can
- examine the program to see the next step.
-
-* C11Tester has to speculatively explore many execution behaviors due to the
- relaxed memory model, and many of these turn out to be infeasible (that is,
- they cannot be legally produced by the memory model). C11Tester discards
- these executions as soon as it identifies them (see the "Number of infeasible
- executions" statistic); however, the speculation can occasionally cause
- C11Tester to hit unexpected parts of the unit test program (causing a
- division by 0, for instance). In such programs, you might consider running
- C11Tester with the `-u num` option.
-
-* Related to the previous point, C11Tester may report more than one bug for a
- particular candidate execution. This is because some bugs may not be
- reportable until C11Tester has explored more of the program, and in the
- time between initial discovery and final assessment of the bug, C11Tester may
- discover another bug.
-