A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
1979
Journal of the ACM
Hoare axiom systems for establishing partial correctness of programs may fail to be complete because of (a) incompleteness of the assertion language relative to the underlying interpretation or (b) inability of the assertion language to express the mvanants of loops Cook has shown that if there IS a complete proof system for the assertion language (l e all true formulas of the assertion language) and if the assertion language satisfies a natural expresstbthty condition then a sound and complete
doi:10.1145/322108.322121
fatcat:ffyhp2ky3bc3jbwn6e2debkigq