The logical complexity of a program is a measure of the effort required to understand it. We hypothesize that the logical co.mplexity of a program increases with the increase in the opaqueness of the relationship between the physical data structures used in the program and their corresponding abstract data types. The results of an experiment conducted to investigate this hypothesis are reported. Documentation techniques for making programs easier to understand using complex data structures are discussed. Data structure diagrams, data structure invariants, stepwise transformation of data structures, and formal specification of the mapping between abstract and concrete data structures are illustrated using two nontrivial examples
AbstractThis paper introduces a new concept of computation trees of logic programs that will be used...
For a given set of strings, the problem of obtaining a succinct description becomes an important sub...
This paper has explored three examples of good semantical analyses of programming structures. The th...
The logical complexity of a program is a measure of the effort required to understand it. We hypothe...
The logical complexity of a program is a measure of the effort required to understand it. We hypothe...
The research in software science has so far been concentrated on three measures of program complexit...
This report presents a method for viewing complex programs as built up out of simpler ones. The ce...
This paper explains the vital role of data abstraction in the development of computer programs. Abst...
This paper concerns the question of how to create abstractions that are useful for program analysis....
Representing abstract data structures in a real programming language is a key step of algorithm impl...
Abstraction in computer programming provides a means of reducing complexity by emphasising the signi...
Control of complexity in large programming systems. Building abstractions: computational processes; ...
Because of the labor intensive nature of software, there is an urgent need to understand and measure...
This report describes a set of experiments to evaluate qualitatively the effectiveness of Data Struc...
: This paper concerns the formalization of our intuition of similar operational behavior of logic pr...
AbstractThis paper introduces a new concept of computation trees of logic programs that will be used...
For a given set of strings, the problem of obtaining a succinct description becomes an important sub...
This paper has explored three examples of good semantical analyses of programming structures. The th...
The logical complexity of a program is a measure of the effort required to understand it. We hypothe...
The logical complexity of a program is a measure of the effort required to understand it. We hypothe...
The research in software science has so far been concentrated on three measures of program complexit...
This report presents a method for viewing complex programs as built up out of simpler ones. The ce...
This paper explains the vital role of data abstraction in the development of computer programs. Abst...
This paper concerns the question of how to create abstractions that are useful for program analysis....
Representing abstract data structures in a real programming language is a key step of algorithm impl...
Abstraction in computer programming provides a means of reducing complexity by emphasising the signi...
Control of complexity in large programming systems. Building abstractions: computational processes; ...
Because of the labor intensive nature of software, there is an urgent need to understand and measure...
This report describes a set of experiments to evaluate qualitatively the effectiveness of Data Struc...
: This paper concerns the formalization of our intuition of similar operational behavior of logic pr...
AbstractThis paper introduces a new concept of computation trees of logic programs that will be used...
For a given set of strings, the problem of obtaining a succinct description becomes an important sub...
This paper has explored three examples of good semantical analyses of programming structures. The th...