Autors:

CiteWeb id: 19690000010

CiteWeb score: 6046

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.

The publication "An axiomatic basis for computer programming" is placed in the Top 10000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 1000. Additionally, the publicaiton "An axiomatic basis for computer programming" is placed in the Top 100 among other scientific works published in 1969.
Links to full text of the publication: