Exploring Extreme Programming
“Sufficient Completeness” is a characteristic of specifications, from the theory of abstract data types. It can help guide our testing. One way of looking at objects is to consider the history of what has happened to them: the sequence of Continue reading Sufficient Completeness and TDD
Current Trends in Programming Methodology, Volume 4: Data Structuring, Raymond T. Yeh, editor. Prentice-Hall, 1978. In parallel with “structured programming,” (which often focused on code structure), there was more esoteric work done on “structured data.” A lot of this found Continue reading Review – Current Trends in Programming Methodology, Vol. 4: Data Structuring
One way to determine “sufficient completeness” suggests considering all sequences of calls that can take an object to a state. This enumeration suggests important test cases. Continue reading Sufficient Completeness and Testing
Structured Programming O.-J. Dahl, E. W. Dijkstra, and C.A.R. Hoare. Academic Press, 1972. Dijkstra explains structured programming (with an eye to proofs), Hoare explains data structures, and Dahl and Hoare explain something called “objects.” Note the publication year. (Reviewed Nov., ’02)