If the checking algorithm return false, then the trace does not satisfy the PRAM Consistency indeed. However, the inverse is not trivially established without formal proof.
Therefore, it is valuable to test the witness (schedule which is claimed PRAM Consistent) when true is returned.
Solution:
Give a witness (schedule) and then check its validity.
Problem: partial self-test
If the checking algorithm return false, then the trace does not satisfy the PRAM Consistency indeed. However, the inverse is not trivially established without formal proof.
Therefore, it is valuable to test the witness (schedule which is claimed PRAM Consistent) when true is returned.
Solution:
Give a witness (schedule) and then check its validity.