A method for pogram analysis and Its applications to program-correctness problems

Abstract

Described in this paper is a program-analysis method that can be used to effectively determine the logical structure of a program, explicate the computation a program will perform, and show the equivalence of programs. Applications to the problem areas in test-case generation, proving program correctness, and translation of “GOTO” programs into “GOTO-less” programs are discussed.

Keywords:

• Program analysis
• program testing
• test-case generation
• equivalence of programs
• program correctness
• program translation
• graph representation of programs
• path predicate

C.R. Categories:

• 3.64
• 4.20
• 4.42
• 5.21
• 5.24