A logical basis for programming methodology

Satoru Takasu, Sukemitsu Kawabata
1981 Theoretical Computer Science  
In this paper, the relation between WHILE-programs and formal prrjnfs of their quantified specificationis studied. This gives us a logical basis foa programming methodology since the programming concepts such as assignment statements, IIF-statements and WHI[LE-statements are fully explained logically, here '1ogiczAly' means 'how to think '., As an example, H:oare's progra& . FIND is stprdied methodologically.
doi:10.1016/0304-3975(81)90030-x fatcat:wcgq5uwon5hbnfwppz7xpau6di