We describe a formal specification and verification in PVS for the general theory of SRT
division, and for the hardware design of a specific implementation. The specification
demonstrates how attributes of the PVS language (in particular, predicate subtypes) allow
the general theory to be developed in a readable manner that is similar to textbook
presentations, while the PVS table construct allows direct specification of the
implementation's quotient look-up table. Verification of the derivations in the SRT theory and …

We describe a formal specification and mechanized verification in PVS of the general theory
of SRT division along with a specific hardware realization of the algorithm. The specification
demonstrates how attributes of the PVS language (in particular, predicate subtypes) allow
the general theory to be developed in a readable manner that is similar to textbook
presentations, while the PVS table construct allows direct specification of the
implementation's quotient lookup table. Verification of the derivations in the SRT theory and …