Linked from

The 10 pages that link to Program verification, each with the reason it gives.

• Halting problemRelated: Many verification questions ask whether a program can reach a stopping state.

• Computability theoryRelated: Undecidability results limit which program properties can be checked automatically in full generality.

• Rice's theoremRelated: A nontrivial correctness property of computed behavior cannot be decided for every arbitrary program.

• Formal semanticsRelated: Precise program meanings make correctness claims mathematically checkable.

• Hoare logicNarrower topic: Hoare logic is one deductive method within the broader practice of program verification.

• Structured programmingNarrower topic: Structured control flow can make correctness arguments easier to organize.

• Undecidable problemRelated: Undecidability limits automatic verification of unrestricted program behavior.

• The Art of Computer ProgrammingNarrower topic: Correctness arguments in the series anticipate systematic reasoning about programs.

• Structured program theoremRelated: Structured forms can aid reasoning, but the theorem alone proves no program correct.

• Turing's proofRelated: Undecidability limits universal automated verification of nontrivial program behavior.