logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Subtypes for specifications: Predicate subtyping in PVS

delete1998-01-01
delete81
PRE
AI
J
John Rushby *
S
Sam Owre
N
Natarajan Shankar
DOI：10.1109/32.713327delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
formal methods
specification languages
type systems
subtypes
typechecking
consistency
PVS

Journal

IEEE Transactions on Software Engineering cover
IEEE Transactions on Software Engineering
IF:
5.6
Papers:
2.8K
Citations:
1.1W

Organization

No organization information available