Journal Article10.1109/TSE.1979.234185
A Method for Analyzing Loop Programs
94
TL;DR: This paper presents a method for automatically analyzing loops, and discusses why it is a useful way to look at loops and the relationship between the structure building methods presented and programming language constructs.
read more
Abstract: This paper presents a method for automatically analyzing loops, and discusses why it is a useful way to look at loops. The method is based on the idea that there are four basic ways in which the logical structure of a loop is built up. An experiment is presented which shows that this accounts for the structure of a large class of loops. The paper discusses how the method can be used to automatically analyze the structure of a loop, and how the resulting analysis can be used to guide a proof of correctness for the loop. 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. A system is described which is designed to assist a person who is writing a program. The intent is that the system will cooperate with a programmer throughout aUl phases of work on a program and be able to communicate with the programmer about it.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Structure and Interpretation of Computer Programs
Harold Abelson,Gerald Jay Sussman,Julie Sussman +2 more
- 01 Jan 1985
TL;DR: Structure and Interpretation of Computer Programs emphasizes the central role played by different approaches to dealing with time in computational models, appropriate for an introduction to computer science courses, as well as programming languages and program design.
Stimulus structures and mental representations in expert comprehension of computer programs
TL;DR: This article investigated the role of programming knowledge in program comprehension and the nature of mental representations of programs; specifically, whether procedural (control flow) or functional (goal hierarchy) relations dominate programmers' mental representations.
593
Automated program recognition: a feasibility demonstration
TL;DR: A prototype recognition system which demonstrates the feasibility of automating program recognition, and is built on two previous advances: a graphical, programming-language-independent representation for programs, called the Plan Calculus, and an efficient graph parsing algorithm.
142
The Programmer's Apprentice: Knowledge Based Program Editing
TL;DR: In this article, an initial implementation of an interactive programming assistant system called the programmer's apprentice (PA) is described, which is designed to be midway between an improved programming methodology and an automatic programming system.
142
Structure and Interpretation of Computer Programs Second Edition
Harold Abelson
- 01 Jan 1996
TL;DR: Higher-order functions enable us to represent these abstractions explicitly as elements in the authors' programming language, so that they can be handled just like other computational elements.
109
References
•Book
An axiomatic basis for computer programming
C. A. R. Hoare
- 01 Jan 2002
TL;DR: In this article, the logical foundations of computer programming are explored by using techniques first applied in the study of geometry and later extended to other branches of mathematics, and a formal proof of a simple theorem is displayed.
3.3K
•Proceedings Article
Coroutines and Networks of Parallel Processes
Gilles Kahn,David B. MacQueen +1 more
- 01 Jan 1976
TL;DR: Ce langage de programmation permet aussi de clarifier les relations entre plusieurs concepts : coroutines, appel par necessite, structures de donnees dynamiques et calcul parallele.
627
Abstraction mechanisms in CLU
TL;DR: This paper provides an introduction to the abstraction mechanisms in CLU and illustrates the utility of the three kinds of abstractions in program construction and shows how CLU programs may be written to use and implement abstractions.
536
Logical analysis of programs
Shmuel Katz,Zohar Manna +1 more
TL;DR: This paper suggests conducting a logical analysis of programs by using invariants which express what is actually occurring in the program, and provides criteria for using the invariants to check simultaneously for correctness or incorrectness.
156