Using PVS to prove some theorems of David Parnas

  • John Rushby
  • Mandayam Srivas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 780)


David Parnas [13] describes some theorems representative of those encountered in support of certification of software for the Darlington nuclear reactor. We describe the verification of these theorems using PVS.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Michael J. Beeson. Foundations of Constructive Mathematics. Ergebnisse der Mathematik und ihrer Grenzgebiete; 3. Folge · Band 6. Springer Verlag, 1985.Google Scholar
  2. [2]
    Michael J. Beeson. Proving programs and programming proofs. In International Congress on Logic, Methodology and Philosophy of Science VII, pages 51–82, Amsterdam, 1986. North-Holland. Proceedings of a meeting held at Salzburg, Austria, in July, 1983.Google Scholar
  3. [3]
    Michael J. Beeson. Towards a computation system based on set theory. Theoretical Computer Science, 60:297–340, 1988.Google Scholar
  4. [4]
    Ermanno Bencivenga. Free logics. In Dov M. Gabbay and Franz Guenthner, editors, Handbook of Philosophical Logic-Volume III: Alternatives to Classical Logic, volume 166 of Synthese Library, chapter III.6, pages 373–426. D. Reidel Publishing Company, Dordrecht, Holland, 1985.Google Scholar
  5. [5]
    William M. Farmer. A partial functions version of Church's simple theory of types. Journal of Symbolic Logic, 55(3):1269–1291, September 1990.Google Scholar
  6. [6]
    William M. Farmer, Joshua D. Guttman, and F. Javier Thayer. IMPS: An interactive mathematical proof system. In Mark E. Stickel, editor, 10th International Conference on Automated Deduction (CADE), pages 653–654, Kaiserslautern, Germany, July 1990. Volume 449 of Lecture Notes in Computer Science, Springer Verlag.Google Scholar
  7. [7]
    Raymond D. Gumb. Programming Logics: An Introduction to Verification and Semantics. John Wiley and Sons, New York, NY, 1989.Google Scholar
  8. [8]
    Susumu Hayashi and Hiroshi Nakano. PX: A Computational Logic. Foundations of Computing. MIT Press, Cambridge, MA, 1988.Google Scholar
  9. [9]
    C. A. Middelburg and G. R. Renardel de Lavalette. LPF and MPLω—a logical comparison of VDM SL and COLD-K. In S. Prehn and W. J. Toetenel, editors, VDM '91: Formal Software Development Methods, pages 279–308, Noordwijkerhout, The Netherlands, October 1991. Volume 551 of Lecture Notes in Computer Science, Springer Verlag. Volume 1: Conference Contributions.Google Scholar
  10. [10]
    S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In Deepak Kapur, editor, 11th International Conference on Automated Deduction (CADE), pages 748–752, Saratoga, NY, June 1992. Volume 607 of Lecture Notes in Artificial Intelligence, Springer Verlag.Google Scholar
  11. [11]
    Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architectures: Some lessons learned. In J. C. P. Woodcock and P. G. Larsen, editors, FME '93: Industrial-Strength Formal Methods, pages 482–500, Odense, Denmark, April 1993. Volume 670 of Lecture Notes in Computer Science, Springer Verlag.Google Scholar
  12. [12]
    David Lorge Parnas. Predicate logic for software engineering. Technical Report TRIO-CRL-241, Telecommunications Research Institute of Ontario (TRIO), Faculty of Engineering, McMaster University, Hamilton, Ontario, Canada, February 1992.Google Scholar
  13. [13]
    David Lorge Parnas. Some theorem we should prove. Technical report, Telecommunications Research Institute of Ontario (TRIO), Faculty of Engineering, Mc-Master University, Hamilton, Ontario, Canada, June 1993.Google Scholar
  14. [14]
    Robert E. Shostak. On the SUP-INF method for proving Presburger formulas. Journal of the ACM, 24(4):529–543, October 1977.Google Scholar
  15. [15]
    Robert E. Shostak. An algorithm for reasoning about equality. Communications of the ACM, 21(7):583–585, July 1978.Google Scholar
  16. [16]
    Robert E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351–360, April 1979.Google Scholar
  17. [17]
    Robert E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1–12, January 1984.Google Scholar
  18. [18]
    A. S. Troelstra and D. van Dalen. Constructivism in Mathematics: An Introduction, volume 121 and volume 123 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, Holland, 1988. In two volumes.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • John Rushby
    • 1
  • Mandayam Srivas
    • 1
  1. 1.Computer Science Laboratory SRI InternationalMenlo ParkUSA

Personalised recommendations