ThesaHelp: ACM references a-e
ThesaHelp: references c-d
Topic: program proving is infeasible
Topic: mathematical proof as a social process
Group: engineering
Topic: science as mathematics
Group: philosophy of mathematics
Group: testing
Topic: reusable programming
| |
Reference
DeMillo, R.A., Lipton, R.J., Perlis, A.J.,
"Social processes and proofs of theorems and programs",
Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pp. 206-214, 1977.
Google
Quotations
206 ;;Quote: an important part of 'proof' in mathematics is the social mechanism; does not exist for proving programs
| 209 ;;Quote: mathematical theorems are believed because of social processes; reading, publishing, generalizing, using, etc.
| 209 ;;Quote: engineers depend on theorems when they 'plug in' a value and rely on a particular physical interpretation of the result
| 209 ;;Quote: the most important mathematical problems are clean and simple to state
| 210 ;;Quote: simple, unspecialized theorems become part of mathematics, but program proving produces narrow theorems for a paltry class of structures
| 212 ;;Quote: in a mature engineering discipline, 'reliable' never means 'perfect'
| 212+;;Quote: there are no proofs that bridges stand, that airplanes fly, or that power systems deliver electricity
| 212 ;;Quote: engineers limit the amount of innovation in a design by recycling; increases safety
|
Related Topics
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references c-d (337 items)
Topic: program proving is infeasible (46 items)
Topic: mathematical proof as a social process (14 items)
Group: engineering (30 topics, 302 quotes)
Topic: science as mathematics (26 items)
Group: philosophy of mathematics (11 topics, 330 quotes)
Group: testing (18 topics, 551 quotes)
Topic: reusable programming (77 items)
|