Advertisement

Practical experience with a formal verification system

  • Paul Smith
  • Nick Bleech
Part of the Software Science and Engineering book series (SSEN)

Abstract

This chapter reports on experience gained by the authors with the Gypsy Verification Environment (GVE) over the period 1985 to 1988. The emphasis is primarily on the fundamental approach to verification which Gypsy supports. The goal is to provide the reader with some insights into the practical problems of formal verification. A secondary concern is to show how the design constraints of Gypsy and the GVE in turn impose constraints and restrictions on the activities of specification, proof, and programming. Finally, we offer some observations on likely future directions for program specification and verification systems.

Keywords

Programming Logic Formal Verification Verification System Proof Obligation Symbolic Execution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Akers 83]
    Akers, R. L., A Gypsy-to-Ada Program Compiler, Report No. 39, Institute for Computing Science, University of Texas at Austin (1983).Google Scholar
  2. [CIP 85]
    CIP Language Group, The Munich Project Vol I: The Wide Spectrum Language CIP-L, Springer Verlag, Lecture Notes in Computer Science 183 (1985).Google Scholar
  3. [Crowe 86]
    Crowe, J., et al, SRI Specification and Verification System User’s Guide, SRI, Menlo Park (1986).Google Scholar
  4. [Floyd 67]
    Floyd, R., “Assigning meaning to programs”, Mathematical Aspects of Computer Science (Ed. J. T. Schwartz), American Mathematical Society (1967).Google Scholar
  5. [Good 86]
    Good, D. I., et al, Report of Gypsy 2.05, Institute for Computing Science, University of Texas at Austin (1986).Google Scholar
  6. [Hoare 78]
    Hoare, C. A. R., “An axiomatic basis for computer programming”, CACM, vol. 12, no. 10 (1978).Google Scholar
  7. [Jensen 75]
    Jensen, K. and Wirth, N., Pascal User Manual and Report, Springer Verlag (1975).Google Scholar
  8. [Jones 86]
    Jones, C. B., Systematic Software Development Using VDM, Prentice Hall (1986).Google Scholar
  9. [Lampson 77]
    Lampson, B. W., et al, Report on the Programming Language Euclid, ACM SIGPLAN Notices, vol. 12, no. 2 (1977).Google Scholar
  10. [Martin-Lof 82]
    Martin-Lof, P., “Constructive mathematics and computer programming”, in Logic, Methodology and Philosophy of Science VI, North Holland, Amsterdam (1982).Google Scholar
  11. [Smith 88]
    Smith, L., Using the Gypsy-to-Bliss Translator, Note 123, Institute for Computing Science, University of Texas at Austin (1988).Google Scholar
  12. [Warren 77]
    Warren, D. H. D. and Pereira, L. M., “PROLOG—the language and its implementation compared with LISP”, Proceedings of the Symposium on Artificial Intelligence and Programming Languages ACM SIGPLAN Notices, vol. 12, no. 8 (1977).Google Scholar
  13. [Woodcock 88]
    Woodcock, J. and Loomes, M., Software Engineering Mathematics, Pitman, London (1988) and Addison-Wesley, Reading, Ma., USA (1989).MATHCrossRefGoogle Scholar

Copyright information

© Crown Copyright and Pitman Publishing 1989

Authors and Affiliations

  • Paul Smith
    • 1
  • Nick Bleech
    • 2
  1. 1.Secure Information Systems Ltd.UK
  2. 2.SD-Scicon plc.UK

Personalised recommendations