论文信息 - Another Incompleteness Result for Hoare's Logic

Another Incompleteness Result for Hoare's Logic

It is known ( Bergstra and Tucker (1982) J. Comput. System Sci. 25, 217) that if the Hoare rules are complete for a first-order structure %plane1D;49C;, then the set of partial correctness assertions true over %plane1D;49C; is recursive in the first-order theory of %plane1D;49C;. We show that the converse is not true. Namely, there is a first-order structure %plane1D;49E; such that the set of partial correctness assertions true over %plane1D;49E; is recursive in the theory of %plane1D;49E;, but the Hoare rules are not complete for %plane1D;49E;.

Jan A. Bergstra | Jerzy Tiuryn | Anna Chmielinska

[1] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.

[2] Jan A. Bergstra,et al. Two Theorems About the Completeness of Hoare's Logic , 1982, Inf. Process. Lett..

[3] Jan A. Bergstra,et al. Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs , 1982, Theor. Comput. Sci..

[4] Jan A. Bergstra,et al. Expressiveness and the Completeness of Hoare's Logic , 1982, J. Comput. Syst. Sci..

[5] David Harel,et al. First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[6] Albert R. Meyer,et al. Computability and completeness in logics of programs (Preliminary Report) , 1977, STOC '77.

[7] Stephen A. Cook,et al. Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..

[8] Bruno Courcelle,et al. Attribute Grammars and Recursive Program Schemes II , 1982, Theor. Comput. Sci..