The problem of single stuck-at, stuck-open, and stuck-on fault detection in cascode voltage switch (CVS) parity trees is considered. The results are also applied to parity and two-rail checkers. CVS circuits are dynamic CMOS circuits which can implement both inverting and noninverting functions. If the CVS parity tree consists of only differential cascode voltage switch (DCVS) EX-OR gates, then it is shown that at most only five tests are needed (in some cases only four tests are required) for detecting all single stuck-at, stuck-open, and stuck-on faults, independent of the number of primary inputs and the number of inputs to any EX-OR gate in the tree. If, however, only a single-ended output is desired from the tree, then the final gate will be a single-ended cascode voltage switch (SCVS) EX-OR gate. For such a tree it is shown that only eight tests are enough.