We show that every set in $\cal P$ is strongly testable under a suitable encoding. By ``strongly testable'' we mean having a (proximity oblivious) tester that makes a constant number of queries and rejects with probability that is proportional to the distance of the tested object from the property. By a ``suitable encoding'' we mean one that is polynomial-time computable and invertible.
This result stands in contrast to the known fact that some sets in $\cal P$ are extremely hard to test, providing another demonstration of the crucial role of representation in the context of property testing.

The testing result is proved by showing
that any set in $\cal P$ has a {\em strong canonical PCP}, where canonical means that (for yes-instances) there exists a single proof that is accepted with probability 1 by the system, whereas all other potential proofs are rejected with probability proportional to their distance from this proof.
In fact, we show that $\cal UP$ equals the lass of sets having strong canonical PCPs (of logarithmic randomness), whereas the class of sets having strong canonical PCPs with polynomial proof length equals ``unambiguous-$\cal MA$''.
Actually, for the testing result, we use a PCP-of-Proximity version of the foregoing notion and an analogous positive result (i.e., strong canonical PCPPs of logarithmic randomness for any set in $\cal UP$).