Analysis of structured programs
Reads0
Chats0
TLDR
It is shown that an arbitrary program P is reducible to a D-chart if and only if P does not contain a loop with two distinct exits.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1974-12-01 and is currently open access. It has received 98 citations till now.read more
Citations
More filters
Book
A complexity measure
TL;DR: In this paper, a graph-theoretic complexity measure for managing and controlling program complexity is presented. But the complexity is independent of physical size, and complexity depends only on the decision structure of a program.
Journal ArticleDOI
A Complexity Measure
TL;DR: Several properties of the graph-theoretic complexity are proved which show, for example, that complexity is independent of physical size and complexity depends only on the decision structure of a program.
Journal ArticleDOI
Software unit test coverage and adequacy
TL;DR: The notion of adequacy criteria is examined together with its role in software dynamic testing and the methods for comparison and assessment of criteria are reviewed.
Refactoring object-oriented frameworks
TL;DR: This thesis gives some conservative algorithms for determining whether a program satisfies constraints, and describes how to use this design information to refactor a program.
Book
Concepts, Techniques, and Models of Computer Programming
Peter Van Roy,Seif Haridi +1 more
TL;DR: This innovative text presents computer programming as a unified discipline in a way that is both practical and scientifically sound and allows programmer and student to grasp the underlying unity of programming.
References
More filters
Journal ArticleDOI
Letters to the editor: go to statement considered harmful
TL;DR: My considerations are that, although the programmer's activity ends when he has constructed a correct program, the process taking place under control of his program is the true subject matter of his activity, and that his intellectual powers are rather geared to master static relations and his powers to visualize processes evolving in time are relatively poorly developed.
Book
Flow diagrams, Turing machines and languages with only two formation rules
Corrado Böhm,Giuseppe Jacopini +1 more
TL;DR: Bohm and Jacopini as mentioned in this paper showed that any flowchart can be drawn from combinations of standard "structured" flowchart elements; they did not prove that any COBOL program can be written without goto statements.
Journal ArticleDOI
Flow diagrams, turing machines and languages with only two formation rules
Corrado Böhm,Giuseppe Jacopini +1 more
TL;DR: In the first part of the paper, flow diagrams are introduced to represent inter ah mappings of a set into itself due to a suitable extension of the given set and of the basic mappings defined in it.
Book
Chief programmer team management of production programming
TL;DR: In the early 1970s, the early discussion about structured programming and the related techniques was conducted by academic people and was published in scholarly journals, thus escaping the attention of the average software professional.
Journal ArticleDOI
Chief programmer team management of production programming
TL;DR: As is evident from some of the other material reprinted in this book, much of the early discussion about structured programming and the related techniques was conducted by academic people and was published in scholarly journals, thus escaping the attention of the average software professional.