In a controversial paper at the end of 1970's, R.A. De Millo, R.J. Lipton and A.J. Perlis argued against formal verifications of programs, mostly motivating their position by an analogy with proofs in mathematics, and in particular with the impracticality of a strictly formalist approach to this discipline. The recent, impressive achievements in the field of interactive theorem proving provide an interesting ground for a critical revisiting of those theses. We believe that the social nature of proof and program development is uncontroversial and ineluctable but formal verification is not antithetical to it. Formal verification should strive not only to cope, but to ease and enhance the collaborative, organic nature of this process, eventually helping to master the growing complexity of scientific knowledge.Curry-Howard analogy
A.Asperti, H.Geuvers, R.Natarajan (2009). Social processes, program verification and all that. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 19, 1-20 [10.1017/S0960129509990041].
Social processes, program verification and all that
ASPERTI, ANDREA;
2009
Abstract
In a controversial paper at the end of 1970's, R.A. De Millo, R.J. Lipton and A.J. Perlis argued against formal verifications of programs, mostly motivating their position by an analogy with proofs in mathematics, and in particular with the impracticality of a strictly formalist approach to this discipline. The recent, impressive achievements in the field of interactive theorem proving provide an interesting ground for a critical revisiting of those theses. We believe that the social nature of proof and program development is uncontroversial and ineluctable but formal verification is not antithetical to it. Formal verification should strive not only to cope, but to ease and enhance the collaborative, organic nature of this process, eventually helping to master the growing complexity of scientific knowledge.Curry-Howard analogyI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.