Skip to main content

Mathematical methods for digital systems development

  • Conference paper
  • First Online:

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

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. Robert L. Akers, Bret A. Hartman, Lawrence M. Smith, Millard C. Taylor, William D. Young, Gypsy Verification Environment User's Manual. Technical Report 61, Computational Logic, Inc., 1990.

    Google Scholar 

  2. William R. Bevier, “Kit and the Short Stack,” Journal of Automated Reasoning, 5(4), December, 1989.

    Google Scholar 

  3. William R. Bevier, Warren A. Hunt, Jr., J Strother Moore, William D. Young, “An Approach to Systems Verification,” Journal of Automated Reasoning, 5(4), December, 1989.

    Google Scholar 

  4. R, S, Boyer and J S, Moore. A Computational Logic, Academic Press, New York, 1979

    Google Scholar 

  5. R, S, Boyer and J S, Moore, A Computational Logic Handbook. Academic Press, Boston, 1988.

    Google Scholar 

  6. Warren A. Hunt, Jr., “Microprocessor Design Verification,” Journal of Automated Reasoning, 5(4), December, 1989.

    Google Scholar 

  7. Jeffery Joyce, Graham Birtwistle, and Mike Gordon, “Proving a Computer Correct in Higher Order Logic,” University of Calgary, Department of Computer Science, August, 1985.

    Google Scholar 

  8. Matt Kaufmann, “A User's Manual for an Interactive Enhancement to the Boyer-Moore Theorem Prover,” Technical Report 19, Computational Logic, Inc., 1988.

    Google Scholar 

  9. J Strother Moore, “A Mechanically Verified Language Implemenation,” Journal of Automated Reasoning, 5(4), December, 1989.

    Google Scholar 

  10. James H. Paul, Gregory C. Simon, “Bugs in the Program, Problems in Federal Government Procurement Regulation,” U. S. House of Representatives, September, 1989.

    Google Scholar 

  11. L. Robinson and K. Levitt, “Proof Techniques for Hierarchically Structured Programs,” CACM, 20(4): April, 1977.

    Google Scholar 

  12. Larry Wos and William McCune, “Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs,” Springer-Verlag Lecture Notes in Computer Science 310, Proceedings of the 9th International Conference on Automated Deduction, May, 1988.

    Google Scholar 

  13. William D. Young, “A Mechanically Verified Code Generator,” Journal of Automated Reasoning, 5(4), December, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Søren Prehn Hans Toetenel

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Good, D.I., Young, W.D. (1991). Mathematical methods for digital systems development. In: Prehn, S., Toetenel, H. (eds) VDM '91 Formal Software Development Methods. VDM 1991. Lecture Notes in Computer Science, vol 552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020002

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46456-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics