Abstract
Wirth (1971) has proposed a method of `stepwise refinement' for writing computer programs. This paper proposes that the steps be expressed as proofs. A program for the eight queens problem is developed, and the proof method is applied across two of the steps of the development. The strengths and weaknesses of the method, and its implications for the programming process and programming language design are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
