ThesaHelp: ACM references a-e
ThesaHelp: references a-b
Topic: test data selection
Group: program proving
Topic: trust
Topic: program proof via assertions
Group: testing
Topic: constructing proof and program together
| |
Reference
Bentley, J.,
"Programming Pearls: Writing correct programs",
Communications of the ACM, 26, 12, pp. 1040-1045, December 1983.
Google
Quotations
1043 ;;Quote: exhaustive test of binary search by all successes, all failures, and boundary conditions
| 1043 ;;Quote: exhaustive test of binary search for n=0 to 10 catches empty array, one, two, three, powers of two, one away from power of two
| 1043 ;;Quote: correct code by using sound principles during design, verification by analysis, and exhaustive testing of small cases
| 1043 ;;Quote: a loop is correct if the loop invariant is established by initialization and preserved each iteration; also prove final result and termination
| 1043 ;;Quote: verify a subroutine by its pre and postconditions; if preconditions satisfied then postconditions will be after execution
| 1043 ;;Quote: informal verification usually consists of executing a test case by hand
| 1043 ;;Quote: verification gives programmers a language for understanding the program as it is written; important explanations become assertions
|
Related Topics
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references a-b (396 items)
Topic: test data selection (39 items)
Group: program proving (10 topics, 310 quotes)
Topic: trust (16 items)
Topic: program proof via assertions (61 items)
Group: testing (18 topics, 551 quotes)
Topic: constructing proof and program together (22 items)
|