Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Safe programming

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Safe specifications and programs are advocated as a simple way of enhancing the reliability of software. The behaviour of a safe program can be more easily certified as being correct with respect to its safe specification, which implies guaranteed termination. This paper describes the theory of safe programming, demonstrates the building of a safe program and summarises the experience gained from practical applications of safe programming.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Anderson,Probably Safe Programs, Tech. Rep. 70, Computing Laboratory, University of Newcastle upon Tyne (February 1975).

  2. R. L. Constable and A. B. Borodin,Subrecursive Programming Languages, Part I: Efficiency and Program Structure, J. ACM 19 (July 1972), 526–568.

    Article  Google Scholar 

  3. E. W. Dijkstra,Concern for Correctness as a Guiding Principle for Program Composition, Infotech State of the Art Report 1: The Fourth Generation (1971), 357–367.

  4. E. W. Dijkstra,A Discipline of Programming, Prentice-Hall (1976).

  5. S. L. Gerhart and L. Yelowitz,Observations of Fallibility in Applications of Modern Programming Methodologies, IEEE Trans. on Software Engineering 2 (September 1976), 195–207.

    Google Scholar 

  6. D. C. Luckham and N. Suzuki,Proof of Termination within a Weak Logic of Programs, Acta Informatica 8 (1977), 21–36.

    Google Scholar 

  7. L. P. Meissner,Bounded Loops, FOR-WORD 3 (January 1977).

  8. B. Randell,System Structure for Software Fault Tolerance, Current Trends in Programming Methodology 1, Prentice-Hall (1977), 195–219.

  9. E. H. Satterthwaite,Debugging Tools for High Level Languages, Software — Practice & Experience 2 (July 1972), 197–217.

    Google Scholar 

  10. C. T. Zahn,A Control Statement for Natural Top-Down Structured Programming, Lecture Notes in Computer Science 19, Springer Verlag (1974), 170–180.

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Newcastle Upon Tyne, England

    T. Anderson & R. W. Witty

  2. Atlas Computing Division, Rutherford Laboratory, Chilton, Didcot, Oxfordshire, England

    T. Anderson & R. W. Witty

Authors
  1. T. Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. W. Witty
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anderson, T., Witty, R.W. Safe programming. BIT 18, 1–8 (1978). https://doi.org/10.1007/BF01947739

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words

Search

Navigation