article

Free access

A New Incompleteness Result for Hoare's System

Author:

Mitchell WandAuthors Info & Claims

Journal of the ACM (JACM), Volume 25, Issue 1

Pages 168 - 175

https://doi.org/10.1145/322047.322062

Published: 01 January 1978 Publication History

PDF eReader

References

[1]

BETH, E W Formal Methods D Reldel, Dordrecht-Holland, 1962.

Google Scholar

[2]

BOYER, R S, ANt) MOORE, JS Proving theorems about LISP functions J ACM 22, 1 (Jan 1975), 129-144

Crossref

Google Scholar

[3]

COOK, S A Axiomattc and interpretive semantics for an ALGOL fragment Tech Rep 79, Dept. Comptr. Sci, U of Toronto, Toronto, Ont, Feb 1975

Google Scholar

[4]

DEBAKKER, J W, AND MEERTENS, L G L T On the completeness of the inductive assertion method J Comptr Syst Scl 11 (1975), 323-357

Google Scholar

[5]

FOKKINGA, M.M. Inducttve assertton patterns for recurstve procedures. Proc. Colloq sur la Programmation, Pans, April 1974, in Lecture Notes m Computer Science, Vol 19, Sprmger-Verlag, 1974, pp 221-233

Crossref

Google Scholar

[6]

HF.WITT, C W, AND SMITH, B Towards a programming apprentice IEEE Trans on Software Eng SE- 1 (1975), 25-45.

Google Scholar

[7]

HOARE, C A R An axiomatic basis for computer programming Comm ACM 12, 10 (Oct 1969), 576-580,583

Crossref

Google Scholar

[8]

HoA~., C A R Proof of a program: FIND Comm ACM 14, 1 (Jan 1971), 39-45

Crossref

Google Scholar

[9]

HOARE, C A R, AND LAUER, P Consistent and complementary formal theories of the semanucs of programming languages Acta Informattca 3 (1974), 135-153

Google Scholar

[10]

LONDON, R.L A view of program verification Proc 1975 Int Conf on Rehable Software, Los Angeles, 1975, m SIGPLAN Notices (ACM) 10, 6 (June 1975), 534-545

Crossref

Google Scholar

[11]

LYONS, T, AND BaUNO, J An interactive system for program verification Courant Computer Sctence Symposmm 4 Algorahm Spect/icatlon, R Rustm, Ed, 1971, pp 117-141

Google Scholar

[12]

MANNA, Z Mathema,cal Theory of Computatton McGraw-Hill, New York, 1974

Crossref

Google Scholar

[13]

PRATT, V Semantical considerations on Floyd-Hoare log,c Proc IEEE Syrup on Foundations of Comptr Scl., 1976, pp. 109-121.

Google Scholar

[14]

SHOENFIELD, J R. Mathemattcal Logtc Addison-Wesley, Reading, Mass., 1967

Google Scholar

[15]

Suztrrl, N Verifying programs by algebraic and logical reduc.on Proc Int Conf on Rehable Software, Los Angeles, 1975. SIGPLAN Notices (ACM) 10, 6 (june 1975), 473-481

Crossref

Google Scholar

Cited By

View all

Jutla CRao J(2022)A methodology for designing proof rules for fair parallel programsFormal Aspects of Computing10.1007/BF012112969:4(359-378)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1007/BF01211296
Apt KOlderog E(2021)Assessing the Success and Impact of Hoare’s LogicTheories of Programming10.1145/3477355.3477359(41-76)Online publication date: 4-Oct-2021
https://dl.acm.org/doi/10.1145/3477355.3477359
Apt KOlderog E(2019)Fifty years of Hoare’s logicFormal Aspects of Computing10.1007/s00165-019-00501-331:6(751-807)Online publication date: 27-Nov-2019
https://dl.acm.org/doi/10.1007/s00165-019-00501-3
Show More Cited By

Index Terms

A New Incompleteness Result for Hoare's System

Recommendations

Hoare's logic and VDM
Abstract
A relational framework which unifies Hoare's logic and VDM is presented. Within this framework a partial correctness version of VDM is defined. It is argued that this partial correctness version of VDM is intuitive and consistent with the original ...
Deducing fairness properties in UNITY logic—a new completeness result

We explore the use of UNITY logic in specifying and verifying fairness properties of UNITY and UNITY-like programs whose semantics can be modeled by weakly fair transition systems. For such programs, strong fairness properties in the form of “if p holds ...
Information-theoretic incompleteness

We propose an improved definition of the complexity of a formal axiomatic system: this is now taken to be the minimum size of a self-delimiting program for enumerating the set of theorems of the formal system. Using this new definition, we show (a) that ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 25, Issue 1

Jan. 1978

175 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322047

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1978

Published in JACM Volume 25, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
420
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)4

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jutla CRao J(2022)A methodology for designing proof rules for fair parallel programsFormal Aspects of Computing10.1007/BF012112969:4(359-378)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1007/BF01211296
Apt KOlderog E(2021)Assessing the Success and Impact of Hoare’s LogicTheories of Programming10.1145/3477355.3477359(41-76)Online publication date: 4-Oct-2021
https://dl.acm.org/doi/10.1145/3477355.3477359
Apt KOlderog E(2019)Fifty years of Hoare’s logicFormal Aspects of Computing10.1007/s00165-019-00501-331:6(751-807)Online publication date: 27-Nov-2019
https://dl.acm.org/doi/10.1007/s00165-019-00501-3
Enjalbert P(2011)Systèmes de déduction pour les arbres et les schémas de programmes (I)RAIRO. Informatique théorique10.1051/ita/198014030247114:3(247-278)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1980140302471
Ray SRay S(2010)Connecting Different Proof StylesScalable Techniques for Formal Verification10.1007/978-1-4419-5998-0_6(81-92)Online publication date: 19-Apr-2010
https://doi.org/10.1007/978-1-4419-5998-0_6
Ray SHunt WMatthews JMoore J(2008)A Mechanical Analysis of Program Verification StrategiesJournal of Automated Reasoning10.1007/s10817-008-9098-140:4(245-269)Online publication date: 1-May-2008
https://dl.acm.org/doi/10.1007/s10817-008-9098-1
Hungar H(2005)Correctness of programs over poor signaturesFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-54967-6_64(109-120)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-54967-6_64
Bergstra JTiuryn J(2005)PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctnessLogics of Programs10.1007/3-540-12896-4_354(45-56)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-12896-4_354
Langmaack HOlderog E(2005)Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensionsAutomata, Languages and Programming10.1007/3-540-10003-2_84(363-373)Online publication date: 24-May-2005
https://doi.org/10.1007/3-540-10003-2_84
Cousineau GEnjalbert P(2005)Program equivalence and provabilityMathematical Foundations of Computer Science 197910.1007/3-540-09526-8_20(237-245)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-09526-8_20
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Hoare's logic and VDM

Deducing fairness properties in UNITY logic—a new completeness result

Information-theoretic incompleteness

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations