Appears in IEEE Transactions on Software Engineering, Volume 24, Number 9. September, 1998.

Authors

Abstract

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.

gzipped postscript

postscript

pdf

BibTeX Entry

@article{Rushby98:TSE,
    AUTHOR = {John Rushby and Sam Owre and {N.} Shankar},
    TITLE = {Subtypes for Specifications: Predicate Subtyping in {PVS}},
    JOURNAL = {{IEEE} Transactions on Software Engineering},
    VOLUME = {24},
    NUMBER = {9},
    YEAR = {1998},
    PAGES = {709--720},
    MONTH = {sep},
    URL = {http://www.csl.sri.com/papers/tse98/}
}