Subtypes for Specifications: Predicate Subtyping in PVS

  • Authors:
  • John Rushby;Sam Owre;Natarajan Shankar

  • Affiliations:
  • Computer Science Laboratory, Menlo Park, CA;Computer Science Laboratory, Menlo Park, CA;Computer Science Laboratory, Menlo Park, CA

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

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.