1981 **Abstract:** A survey of various results concerning Hoare's approach to proving partial and total correctness of programs is presented. Emphasis is placed on the soundness and completeness issues. Various proof systems for while programs, recursive procedures, local variable declarations, and procedures with parameters, together with the corresponding soundness, completeness, and incompleteness results, are discussed.

Help me understand this report

Search citation statements

Paper Sections

Select...

2

1

1

Citation Types

1

218

0

2

Year Published

1991

2018

Publication Types

Select...

2

2

Relationship

0

4

Authors

Journals

(221 citation statements)

(99 reference statements)

1

218

0

2

“…Separation Logic builds on Floyd-Hoare logic (Apt 1981) (henceforth, 'Hoare logic'). Hoare logic developed through the 1970s specifically to reason about the execution of computer programs.…”

confidence: 99%

“…Separation Logic builds on Floyd-Hoare logic (Apt 1981) (henceforth, 'Hoare logic'). Hoare logic developed through the 1970s specifically to reason about the execution of computer programs.…”

confidence: 99%

“…One formative idea is Hoare's development of assertion programs, with the insight that valid program execution can be interpreted as a logical proof from the pre-conditions to the post-conditions (Apt 1981). However, the familiar classical logical connectives-¬, ∨, ∧ and →-and quantifiers-∃ and ∀-did not capture the resource management problems that computer science then found intractable.…”

confidence: 99%

“…Some special purpose logics such as Hoare-Logic [17], Dynamic Logic [18] or even tools such as KeY [19] could be used to formally show this entailment relationship. The fact that restrictive contracts are comparably weak is also illustrated by the presence of the well-known frame problem [20,21].…”

confidence: 99%

“…A proof outline is locally correct, if the usual verification conditions [7] for standard sequential constructs hold: The precondition of a multiple assignment must imply its postcondition after the execution of the assignment. For assignments occurring outside of critical sections, ¬critsec expresses the enabledness of the assignment.…”

confidence: 99%