On relative completeness of Hoare logics
Information and Control - The MIT Press scientific computation series
A New Incompleteness Result for Hoare's System
Journal of the ACM (JACM)
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
Journal of the ACM (JACM)
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
Effective Axiomatizations of Hoare Logics
Journal of the ACM (JACM)
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning About Procedures as Parameters
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Computability and completeness in logics of programs (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Completeness and incompleteness theorems for hoare-like axiom systems.
Completeness and incompleteness theorems for hoare-like axiom systems.
Topics in computational complexity
Topics in computational complexity
| Hi-index | 0.00 |
The nature of programming languages that fail to have a relatively complete proof formalism is discussed. First, it is shown that such failures may be due to the meagerness of the programming language, rather than to the presence of complex control structures as in the cases studied so far. The failure of relative completeness is then derived for two languages with a rich control structure, using simple simulations of general recursive functions by procedure call mechanisms.