12(10):576–580.

doi abstract bibtex

doi abstract bibtex

In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics.

@article{hoareAxiomaticBasisComputer1969, title = {An {{Axiomatic Basis}} for {{Computer Programming}}}, volume = {12}, issn = {00010782}, doi = {10.1145/363235.363259}, abstract = {In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics.}, number = {10}, journaltitle = {Communications of the ACM}, date = {1969}, pages = {576--580}, keywords = {0,20,21,22,23,24,4,5,and phrases,axiomatic method,cr category,design,formal language definition,machine-independent programming,program documentation,programming language,proofs of programs,theory of programming}, author = {Hoare, C. A. R.}, file = {/home/dimitri/Nextcloud/Zotero/storage/CQIK4EBT/Hoare - 1969 - An Axiomatic Basis for Computer Programming.pdf} }

Downloads: 0