Affiliation:
1. Georgia Institute of Technology, Atlanta
2. Yale Univ., New Haven, CT
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference20 articles.
1. Chief programmer team management of production programming
2. The independence of the continuum hypothesis. Proc. Nat. Acad. Sci;Cohen P.J;USA. Part I,1964
3. Fidelity in Mathematical Discourse: Is One and One Really Two?
4. Bateman P. and Diamond H. John E. Littlewood (1885-1977): An informal obituary. The Math. lntelligencer 1 l (1978) 28-33. Bateman P. and Diamond H. John E. Littlewood (1885-1977): An informal obituary. The Math. lntelligencer 1 l (1978) 28-33.
5. The discovery of organic synthetic roots by computer;Gelerenter H.;Topics in Current Chemistry,1973
Cited by
307 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Considerations on Approaches and Metrics in Automated Theorem Generation/Finding in Geometry;Electronic Proceedings in Theoretical Computer Science;2024-01-22
2. A System Engineering Approach to AI Security and Safety;Computer;2023-11
3. A Pragmatic Approach to Syntax Repair;Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2023-10-22
4. Checking correctness in mathematical peer review;Social Studies of Science;2023-09-30
5. A formally certified end-to-end implementation of Shor’s factorization algorithm;Proceedings of the National Academy of Sciences;2023-05-15