It is, therefore, possible to extend a partially specified interpretation to a complete interpretation, without loss of verifiability... This fact offers the possibility of automatic verification of programs, the programmer merely tagging entrances and one edge in each innermost loop.
"Assigning Meanings to Programs" by Robert W. Floyd, published in "Proceedings of Symposium on Applied Mathematics", Volume 19 (p. 25), 1967.
