An Axiomatic Basis for Computer Programming by Tony Hoare, 1969.

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 advantage, both theoretical and practical, may follow from a pursuance of these topics.

Considered by many to be among the best of the great works in programming languages.

## Recent comments

1 hour 18 min ago

1 hour 55 min ago

2 hours 40 min ago

2 hours 59 min ago

3 hours 23 min ago

3 hours 35 min ago

4 hours 6 min ago

4 hours 16 min ago

5 hours 9 min ago

5 hours 12 min ago