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.
p. 25 - Assigning Meanings to Programs (1967)
![It is, therefore, possible to extend a partially specified interpretation to a complete interpretation, without loss of verifiability, [...] This...](https://img.libquotes.com/pic-quotes/v1/robert-floyd-quote-lbh5k6r.jpg)
![It is, therefore, possible to extend a partially specified interpretation to a complete interpretation, without loss of verifiability, [...] This...](https://img.libquotes.com/pic-quotes/v2/robert-floyd-quote-lbh5k6r.jpg)
![It is, therefore, possible to extend a partially specified interpretation to a complete interpretation, without loss of verifiability, [...] This...](https://img.libquotes.com/pic-quotes/v3/robert-floyd-quote-lbh5k6r.jpg)
![It is, therefore, possible to extend a partially specified interpretation to a complete interpretation, without loss of verifiability, [...] This...](https://img.libquotes.com/pic-quotes/v4/robert-floyd-quote-lbh5k6r.jpg)







