- 65 Downloads
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.
KeywordsFormal Method Partial Correctness Intended Behaviour Input Domain Great Common Divisor
Unable to display preview. Download preview PDF.
General and Undecidability
- D Harel.Algorithmics: The Spirit of Computing. Addison-Wesley Publishing Co.. Inc., 1987.Google Scholar
- C A R Hoare and C B Jones.Essays in Computing Science. Prentice-Hall. Inc., 1989.Google Scholar
- C A R Hoare and D C S Allison.Incomputability, ACM Computing Surveys. September 1992.Google Scholar
- Collected works of A M Turing. North-Holland Publ. Co., Amsterdam, 1992.Google Scholar