Social processes and proofs of theorems and programs

It is argued that formal verifications of programs, no matter how obtained, will not play the same key role in the development of computer science and software engineering as proofs do in mathematics. Furthermore the absence of continuity, the inevitability of change, and the complexity of specification of significantly many real programs make the formal verification process difficult to justify and manage. It is felt that ease of formal verification should not dominate program language design.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  A. Kempe.  On the Geographical Problem of the Four Colours , 1879 .

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  J. Hadamard.  Sur la distribution des zéros de la fonction $\zeta (s)$ et ses conséquences arithmétiques , 1896 .

[5]  Thomas L. Heath,et al.  Thirteen Books of Euclid's Elements , 1911, The Mathematical Gazette.

[6]  G. Gibson.  The Thirteen Books of Euclid's Elements , 1927, Nature.

[7]  C. A. R. Hoare,et al.  Algorithm 65: find , 1961, Commun. ACM.

[8]  P. J. Cohen,et al.  THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[9]  J. Rosser,et al.  Simplified Independence Proofs. , 1971 .

[10]  A. Robinson.  Infinite Forcing in Model Theory , 1971 .

[11]  J. A. George.  Computer implementation of the finite element method , 1971 .

[12]  F. T. Baker,et al.  Chief Programmer Team Management of Production Programming , 1972, IBM Syst. J..

[13]  Philip J. Davis,et al.  Fidelity in mathematical discourse: is one and one really two? , 1972 .

[14]  J. L. Britton.  The Existence of Infinite Burnside Groups , 1973 .

[15]  N. S. Sridharan,et al.  The discovery of organic synthetic routes by computer , 1973 .

[16]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[17]  S. Ulam,et al.  Adventures of a Mathematician , 2019, Mathematics: People · Problems · Results.

[18]  I. Lakatos,et al.  Proofs and Refutations: Frontmatter , 1976 .

[19]  G. Kolata.  Mathematical proofs: the genesis of reasonable doubt. , 1976, Science.

[20]  Mary Shaw,et al.  Abstraction and verification in alphard , 1976 .

[21]  Lawrence Yelowitz,et al.  Observations of Fallibility in Applications of Modern Programming Methodologies , 1976, IEEE Transactions on Software Engineering.

[22]  Butler W. Lampson,et al.  Notes on the design of Euclid , 1977, Language Design for Reliable Software.

[23]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[24]  Imre Lakatos,et al.  On the Uses of Rigorous Proof. (Book Reviews: Proofs and Refutations. The Logic of Mathematical Discovery) , 1977 .

[25]  P. Bateman,et al.  John E. Littlewood (1885–1977) An Informal Obituary , 1978 .