Proof of a program

DOI10.1145/362452.362489MaRDI QIDQ5621948zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tony Hoare

Publication date 1971

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/362452.362489

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(22)

• A calculus of refinements for program derivations
• A logical basis for programming methodology
• Hierarchical development of programming languages
• Reasoning about programs
• The use of Hoare's method of program verification for the Quicksort algorithm
• The validity of return address schemes
• Computing and estimating the volume of the solution space of SMT(LA) constraints
• Automatic program verification. I: A logical basis and its implementation
• Turing's 1949 paper in context
• Fifty years of Hoare's logic
• Axiomatic approach to total correctness of programs
• Performance estimation using symbolic data
• Current methods for proving program correctness
• On compound statements in a conversational language
• Verification of a program complex
• Automatic construction of test sets: Practical approach
• Journeys in non-classical computation I: A grand challenge for computing research
• An experiment in structured programming
• Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
• Extending rely-guarantee thinking to handle real-time scheduling
• Order statistics in large arrays (OSILA): a simple randomised algorithm for a fast and efficient attainment of the order statistics in very large arrays
• Tony Hoare: his path to the ACM Turing Award

This page was built for publication: Proof of a program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5621948)