Access Restriction

Author Iyengar, S. Sitharama ♦ Bastani, Farokh B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract The logical complexity of a program is a measure of the effort required to understand it. We hypothesize that the logical complexity 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.
Description Affiliation: Department of Computer Science, University of Houston, Houston, Tex. (Bastani, Farokh B.) || Department of Computer Science, Louisiana State University, Baton Rouge, La. (Iyengar, S. Sitharama)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 30
Issue Number 3
Page Count 10
Starting Page 250
Ending Page 259

Open content in new tab

   Open content in new tab
Source: ACM Digital Library