Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Proofs and types
How to make ad-hoc polymorphism less ad hoc
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Social processes and proofs of theorems and programs
Communications of the ACM
ACM SIGSAM Bulletin - Special issue of OpenMath
An axiomatic basis for computer programming
Communications of the ACM
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
A Syntactic Approach to Foundational Proof-Carrying Code
Journal of Automated Reasoning
Towards the Formal Verification of a C0 Compiler: Code Generation and Implementation Correctnes
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A formally verified proof of the prime number theorem
ACM Transactions on Computational Logic (TOCL)
Formal verification of translation validators: a case study on instruction scheduling optimizations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modular formalisation of finite group theory
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Theory-specific automated reasoning
A 25-year perspective on logic programming
Some considerations on the usability of interactive provers
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Minds and Machines
Proof, message and certificate
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
In a controversial paper (De Millo et al. 1979) at the end of the 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 their 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 with, but to ease and enhance the collaborative, organic nature of this process, eventually helping us to master the growing complexity of scientific knowledge.