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
311 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Misconceptions in Finite-Trace and Infinite-Trace Linear Temporal Logic;Lecture Notes in Computer Science;2024-09-11
2. Code to Qed, the Project Manager's Guide to Proof Engineering;ACM Transactions on Software Engineering and Methodology;2024-08-26
3. What Is an Algorithm?;Advances in Information Quality and Management;2024-07-01
4. Considerations on Approaches and Metrics in Automated Theorem Generation/Finding in Geometry;Electronic Proceedings in Theoretical Computer Science;2024-01-22
5. Inverting Hierarchies: The Sociology of Mathematical Practice;Handbook of the History and Philosophy of Mathematical Practice;2024