, Volume 3, Issue 4, pp 15–29 | Cite as


10. Correctness of programs
Series Article


In the previous article, we studied notions such as algorithmic universality, computability, and incomputability. In this article, we study the notion of correctness of programs, illustrate a method of establishing the correctness of programs and discuss issues in the development of correct software.


Formal Method Partial Correctness Intended Behaviour Input Domain Great Common Divisor 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Suggested Reading


  1. N Wirth.Systematic Programming: An Introduction. Prentice Hall, Englewood Cliffs. New Jersey, 1972.Google Scholar
  2. EW Dijkstra.A Discipline of Programming. Prentice Hall. Inc., 1976.Google Scholar
  3. R G Dromey.How to Solve it by Computer. Prentice Hall International, 1982.Google Scholar

General and Undecidability

  1. D Harel.Algorithmics: The Spirit of Computing. Addison-Wesley Publishing Co.. Inc., 1987.Google Scholar
  2. C A R Hoare and C B Jones.Essays in Computing Science. Prentice-Hall. Inc., 1989.Google Scholar
  3. C A R Hoare and D C S Allison.Incomputability, ACM Computing Surveys. September 1992.Google Scholar
  4. Collected works of A M Turing. North-Holland Publ. Co., Amsterdam, 1992.Google Scholar

Copyright information

© Indian Academy of Sciences 1998

Authors and Affiliations

  1. 1.Computer Science GroupTata Institute of Fundamental ResearchMumbaiIndia

Personalised recommendations