Skip to main content

Formal methods: A panacea or academic poppycock?

  • Conference paper
  • First Online:
  • 163 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1212))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Archer, C. L. Heitmeyer. Verifying hybrid systems modeled as timed automata: A case study. Proceedings, Hybrid and Real-Time Systems Workshop (HART '97), Grenoble, France, March, 1997.

    Google Scholar 

  2. R. Bharadwaj, C. L. Heitmeyer. Applying the SCR requirements specification method to practical systems: A case study. Proceedings, Twenty-First Annual Software Engineering Workshop, Greenbelt, MD, December 1996.

    Google Scholar 

  3. R. Bharadwaj, C. L. Heitmeyer. Verifying SCR requirements specifications using state exploration. Proceedings, First ACM SIGPLAN Workshop on the Automated Analysis of Software, Paris, France, January 1997.

    Google Scholar 

  4. Ricky W. Butler. An Introduction to Requirements Capture Using PVS: Specification of a Simple Autopilot. NASA Technical Memorandum 110255. NASA Langley Research Center, Hampton VA 23681.

    Google Scholar 

  5. E. M. Clarke, E. A. Emerson and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2):244–263, 1986.

    Google Scholar 

  6. K. Gödel. On Decidable Propositions of Formal Mathematical Systems. Notes by Kleene and Rosser on Gödel's 1934 Lecture to the IAS. Reprinted in The Undecidable, ed., Martin Davis.

    Google Scholar 

  7. M. Heimdahl, N. Leveson. Completeness and consistency analysis of state-based requirements. Proceedings, 17th International Conference on Software Engineering (ICSE '95). Seattle, WA, April 1995.

    Google Scholar 

  8. Constance Heitmeyer, et al. SCR*: A toolset for specifying and analyzing requirements. Proceedings, 10 th Annual Conference on Computer Assurance(COMPASS '95), Gaithersburg MD, June 1995.

    Google Scholar 

  9. C. L. Heitmeyer, R. D. Jeffords, and B. G. Labaw. Automated consistency checking of requirements specifications. ACM Trans. on Software Engg. and Methodology, 5(3)231–261, July 1996.

    Google Scholar 

  10. Matt Kaufmann and J Strother Moore. ACL2: An industrial-strength version of Nqthm. Proceedings, 11th Annual Conference on Computer Assurance (COMPASS '96). Gaithersburg, MD, June 17–21, 1996.

    Google Scholar 

  11. Sam Owre, John Rushby, Natarajan Shankar, Friedrich von Henke. Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS. IEEE Transactions on Soft-ware Engineering, vol. 21, no. 2, pp. 107–125, Feb. 1995.

    Google Scholar 

  12. D. L. Parnas and J. Madey. Functional documents for computer systems. Science of Computer Programming, 25(1), pp 41–62, Oct 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jonathan P. Bowen Michael G. Hinchey David Till

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heitmeyer, C. (1997). Formal methods: A panacea or academic poppycock?. In: Bowen, J.P., Hinchey, M.G., Till, D. (eds) ZUM '97: The Z Formal Specification Notation. ZUM 1997. Lecture Notes in Computer Science, vol 1212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027280

Download citation

  • DOI: https://doi.org/10.1007/BFb0027280

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62717-3

  • Online ISBN: 978-3-540-68490-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics