Proof of a program

DOI10.1145/362452.362489zbMath0217.53701OpenAlexW2160363852WikidataQ56656273 ScholiaQ56656273MaRDI QIDQ5621948

C. A. R. 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)

Related Items

Automatic construction of test sets: Practical approach, A calculus of refinements for program derivations, Computing and estimating the volume of the solution space of SMT(LA) constraints, An experiment in structured programming, The validity of return address schemes, A logical basis for programming methodology, Hierarchical development of programming languages, Reasoning about programs, Turing's 1949 paper in context, Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses, The use of Hoare's method of program verification for the Quicksort algorithm, Fifty years of Hoare's logic, On compound statements in a conversational language, Verification of a program complex, Current methods for proving program correctness, Journeys in non-classical computation I: A grand challenge for computing research, Axiomatic approach to total correctness of programs, Performance Estimation Using Symbolic Data, Automatic program verification. I: A logical basis and its implementation