Abstract:
Abstract. Specification languages are best used in environments that provide effective theorem proving. Having such support available, it is feasible to contemplate forms of typechecking that can use the services of a theorem prover. This allows interesting extensions to the type systems provided for specification languages. I describe one such extension called "predicate subtyping " and illustrate its utility as mechanized in PVS. 1
Citations
|
604
|
A formulation of the simple theory of types
– Church
- 1940
|
|
592
|
Systematic Software Development Using VDM
– Jones
- 1986
|
|
166
|
The Modula-3 type system
– Cardelli, Donahue, et al.
- 1989
|
|
83
|
A partial functions version of Church's simple theory of types
– Farmer
- 1990
|
|
83
|
Imps: An interactive mathematical proof system
– Farmer, Guttman, et al.
- 1993
|
|
76
|
An overview of the extended static checking system
– Detlefs
- 1996
|
|
52
|
On Shostak's decision procedure for combinations of theories
– Cyrluk, Lincoln, et al.
- 1996
|
|
48
|
A logic covering undefinedness in program proofs
– Barringer, Cheng, et al.
- 1984
|
|
48
|
On the usability of logics which handle partial functions
– Cheng, Jones
- 1990
|
|
39
|
Should your specification language be typed
– Lamport, Paulson
- 1997
|
|
16
|
Foundations of Constructive Mathematics. Ergebnisse der Mathematik und ihrer Grenzgebiete; 3. Folge \Delta Band 6
– Beeson
- 1985
|
|
8
|
Olaf Owe. ANNA - A Language for Annotating Ada Programs
– Luckham, Henke, et al.
- 1987
|
|
7
|
Verification assessment study final report
– Kemmerer
- 1986
|
