The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An Introduction to Proving the Correctness of Programs
ACM Computing Surveys (CSUR)
Social processes and proofs of theorems and programs
Communications of the ACM
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
The Science of Programming
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
A Discipline of Programming
A proposed graduate course in automatic software generation
ACM SIGCSE Bulletin
| Hi-index | 0.00 |
Informal mathematical proofs admit and require interpretation while formal logic proofs suppress (abstract from) meanings. The former is closely related to problem solving and computer programming. The latter, which is commonly used for proving program correctness, complicates this procedure because it separates problem solving from programming. A constructive mathematical proof in finite discrete mathematics of an existential theorem is a computer program if the pertinent data structures and functions are expressed in a programming language. Several detailed examples of graph theoretical problems and theorems are presented along with their constructive proofs and corresponding programs.