A method for automatically analyzing programs

Authors:
Richard C. Waters
Affiliations:
Artificial Intelligence Laboratory and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass.
Venue:
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Year:
1979

Citing 13
Cited 0

An Algorithm for Structuring Flowgraphs

Journal of the ACM (JACM)
Subgoal induction

Communications of the ACM
Abstraction and verification in Alphard: defining and specifying iteration and generators

Communications of the ACM
Abstraction mechanisms in CLU

Communications of the ACM
Logical analysis of programs

Communications of the ACM
The synthesis of loop predicates

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Compilation and delayed evaluation in APL

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
APL: The Language and Its Usage

APL: The Language and Its Usage
Some classes of naturally provable programs

ICSE '76 Proceedings of the 2nd international conference on Software engineering
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Initial Report on A LISP Programmer''s Apprentice

Initial Report on A LISP Programmer''s Apprentice
Automatic Analysis of the Logical Structure of Programs

Automatic Analysis of the Logical Structure of Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for automatically analyzing programs and discusses why it is a useful way to look at programs. The method is based on the idea that there are only a few basic ways in which the logical structure Of programs is built up. An experiment is presented which shows that this accounts for the structure of a large class Of programs. The paper discusses how the method can be used to automatically analyze the structure of a program, and how the resulting analysis can be used to guide a proof of correctness for the program. An automatic system is described which performs this type of analysis. The paper discusses the relationship between the structure building methods presented and programming language constructs.