Name
Abstract | ||
|---|---|---|
A specification language used in the context of an effective theorem prover can provide novel features that enhance precision and expressiveness. In particular, type checking 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 |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/32.713327 | Software Engineering, IEEE Transactions |
Keywords | Field | DocType |
formal specification,specification languages,theorem proving,type theory,PVS,formal specifications,predicate subtyping,specification language,theorem prover,type checking | Specification language,Programming language,Computer science,Automated theorem proving,Type theory,Exploit,Formal specification,Theoretical computer science,Formal methods,Predicate (grammar),Subtyping | Journal |
Volume | Issue | ISSN |
24 | 9 | 0098-5589 |
Citations | PageRank | References |
65 | 2.57 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Rushby | 1 | 2459 | 235.69 |
| Owre, S. | 2 | 391 | 36.97 |
| Natarajan Shankar | 3 | 3050 | 309.55 |