Principles and pragmatics of subtyping in PVS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1827, Issue , 2000, Pages 37-52

  Shankar, Natarajan ^a   Owre, Sam ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORMAL LOGIC; SPECIFICATION LANGUAGES;

DEPENDENT TYPES; HIGHER ORDER LOGIC; INTERACTIVE PROOF DEVELOPMENT; ORDER PRESERVING MAPS; PRIME NUMBER; PROTOTYPE VERIFICATION SYSTEMS; SUBTYPINGS; TYPE SYSTEMS;

FORMAL SPECIFICATION;

EID: 84947211472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44616-3_3     Document Type: Conference Paper

References (32)

1. Peter B. Andrews. An Introduction to Logic and Type Theory: To Truth through Proof. Academic Press, New York, NY, 1986.
2. H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North- Holland, Amsterdam, 1978.
3. R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, Englewood Cliffs, NJ, 1986.
4. Luca Cardelli. Type systems. In Handbook of Computer Science and Engineering, chapter 103, pages 2208–2236. CRC Press, 1997. Available at http://www.research.digital.com/SRC.
5. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. F. Quesada. Maude: Specification and programming in rewriting logic. Technical Report CDRL A005, Computer Science Laboratory, SRI International, March 1999.
6. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.
7. J. H. Cheng and C. B. Jones. On the usability of logics which handle partial functions. In Carroll Morgan and J. C. P.Woodcock, editors, Proceedings of the Third Refinement Workshop, pages 51–69. Springer-Verlag Workshops in Computing, 1990.
8. N. G. de Bruijn. A survey of the project Automath. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 589–606. Academic Press, 1980.
9. Gilles Dowek, Amy Felty, Hugo Herbelin, Gérard Huet, Christine Paulin-Mohring, and Benjamin Werner. The COQ proof assistant user’s guide: Version 5.6. Rapports Techniques 134, INRIA, Rocquencourt, France, December 1991.
10. Kokichi Futatsugi, Joseph Goguen, Jean-Pierre Jouannaud, and José Meseguer. Principles of OBJ2. In Brian K. Reid, editor, 12th ACM Symposium on Principles of Programming Languages, pages 52–66. Association for Computing Machinery, 1985.
11. M. Futatsugi, J. Goguen, J-P. Jouanaud, and J. Meseguer. Principles of OBJ2. In Proceedings of the 12th ACM Symposium on Principles of Programming, 1985.
12. G. Frege. Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought, 1967. First published 1879.
13. G. Frege. Letter to Russell, 1967. Written 1902.
14. David Griffioen and Marieke Huisman. A comparison of PVS and Isabelle/ HOL. In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs’98, volume 1479 of Lecture Notes in Computer Science, pages 123–142, Canberra, Australia, September 1998. Springer-Verlag.
15. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge, UK, 1993.
16. Mike Gordon. Notes on PVS from a HOL perspective. Available at http://www.cl.cam.ac.uk/users/mjcg/PVS.html, August 1995.
17. Paul Jackson. Undecidable typing, abstract theories and tactics in Nuprl and PVS (tutorial). In Joakim von Wright, Jim Grundy, and John Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs’96, volume 1125 of Lecture Notes in Computer Science, Turku, Finland, August 1996. Springer-Verlag.
18. Cliff B. Jones. Systematic Software Development Using VDM. PrenticeHall International Series in Computer Science. Prentice Hall, Hemel Hempstead, UK, second edition, 1990.
19. William J. Leveque. Elementary Theory of Numbers. Dover, 1990. Originally published by Addison-Wesley, 1962.
20. Leslie Lamport and Lawrence C. Paulson. Should your specification language be typed? ACM Transactions on Programming Languages and Systems, 21(3):133–169, May 1999.
21. Peter D. Mosses. Casl: A guided tour of its design. In José Luiz Fiadeiro, editor, Recent Trends in Algebraic Specification Languages, number 1589 in Lecture Notes in Computer Science, pages 216–240. Springer Verlag, 1998.
22. Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, February 1995.
23. Sam Owre and Natarajan Shankar. Abstract datatypes in PVS. Technical Report SRI-CSL-93-9R, Computer Science Laboratory, SRI International, Menlo Park, CA, December 1993. Extensively revised June 1997; Also available as NASA Contractor Report CR-97-206264.
24. Sam Owre and Natarajan Shankar. The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park, CA, August 1997.
25. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
26. John Rushby, Sam Owre, and N. Shankar. Subtypes for specifications: Predicate subtyping in PVS. IEEE Transactions on Software Engineering, 24(9):709–720, September 1998.
27. Bertrand Russell. Letter to Frege, 1967. Written 1902.
28. John Rushby. Formal methods and the certification of critical systems. Technical Report SRI-CSL-93-7, Computer Science Laboratory, SRI International, Menlo Park, CA, December 1993. Also issued under the title Formal Methods and Digital Systems Validation for Airborne Systems as NASA Contractor Report 4551, December 1993.
29. N. Shankar. Efficiently executing PVS. Project report, Computer Science Laboratory, SRI International, Menlo Park, CA, November 1999. Available at http://www.csl.sri.com/shankar/PVSeval.ps.gz.
30. J. M. Spivey. Understanding Z: A Specification Language and its Formal Semantics. Cambridge Tracts in Theoretical Computer Science 3. Cambridge University Press, Cambridge, UK, 1988.
31. Jean van Heijenoort, editor. From Frege to Gödel. Harvard University Press, Cambridge, MA, 1967.
32. A. N. Whitehead and B. Russell. Principia Mathematica. Cambridge University Press, Cambridge, revised edition, 1925–1927. Three volumes. The first edition was published 1910–1913.