Issue No. 09 - September (1998 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.713327
<p><b>Abstract</b>—A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, typechecking for the language can exploit the services of the theorem prover. We describe a feature called "predicate subtyping" that uses this capability and illustrate its utility as mechanized in PVS.</p>
Formal methods, specification languages, type systems, subtypes, typechecking, consistency, PVS.
S. Owre, J. Rushby and N. Shankar, "Subtypes for Specifications: Predicate Subtyping in PVS," in IEEE Transactions on Software Engineering, vol. 24, no. , pp. 709-720, 1998.