Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Software Engineering, IEEE Transactions on

Issue 2 • Date March 1983

Filter Results

Displaying Results 1 - 20 of 20
  • IEEE Transactions on Software Engineering - Table of contents

    Publication Year: 1983 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (425 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1983 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (304 KB)  
    Freely Available from IEEE
  • Editorial

    Publication Year: 1983 , Page(s): 117
    Save to Project icon | Request Permissions | PDF file iconPDF (1264 KB)  
    Freely Available from IEEE
  • Guest Editorial: COMPSAC '81 Special Section

    Publication Year: 1983 , Page(s): 118 - 119
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1608 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Syntax-Directed Pretty Printing—A First Step Towards a Syntax-Directed Editor

    Publication Year: 1983 , Page(s): 119 - 127
    Cited by:  Papers (6)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4280 KB)  

    A language-independent syntax-directed pretty printer has been implemented as the first step towards building a language-independent syntax-directed editor. The syntax-directed pretty printer works in two phases: the grammar processing phase and the program processing phase. In the grammar processing stage, a grammar which contains a context-free grammar and information for the parser and pretty printer is processed and all files needed by the second phase are written. With these files, the syntax-directed pretty printer works for the language of the grammar. The syntax-directed editor would use the same grammar processing phase to construct the files needed to make it work for a specific language. In the program processing phase, programs in the language of the grammar are parsed and parse trees are built. If syntax errors are found, error messages are produced and error recovery is done. The parse trees are pretty printed according to the pretty printer specifications given in the grammar, resulting in well-indented, syntactically clear programs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locality of Reference in Hierarchical Database Systems

    Publication Year: 1983 , Page(s): 128 - 134
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2416 KB)  

    Localized information referencing is a long-known and much-exploited facet of program behavior. The existence of such behavior in the data accessing patterns produced by database management systems is not currently supported by empirical results. We present experimental results which demonstrate that in certain environments and under certain important applications, locality of reference is an undeniable characteristic of the information accessing behavior of a hierarchical database management system. Furthermore, database locality of reference is in a sense more regular, predictable, and hence, more exploitable than the localized reference activity found in programs in general. The implications of these results for the performance enhancement and workload characterization of database management systems are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Selection of an Optimal Set of Indexes

    Publication Year: 1983 , Page(s): 135 - 143
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3904 KB)  

    A problem of considerable interest in the design of a database is the selection of indexes. In this paper, we present a probabilistic model of transactions (queries, updates, insertions, and deletions) to a file. An evaluation function, which is based on the cost saving (in terms of the number of page accesses) attributable to the use of an index set, is then developed. The maximization of this function would yield an optimal set of indexes. Unfortunately, algorithms known to solve this maximization problem require an order of time exponential in the total number of attributes in the file. Consequently, we develop the theoretical basis which leads to an algorithm that obtains a near optimal solution to the index selection problem in polynomial time. The theoretical result consists of showing that the index selection problem can be solved by solving a properly chosen instance of the knapsack problem. A theoretical bound for the amount by which the solution obtained by this algorithm deviates from the true optimum is provided. This result is then interpreted in the light of evidence gathered through experiments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MIKE: A Network Operating System for the Distributed Double-Loop Computer Network

    Publication Year: 1983 , Page(s): 143 - 154
    Cited by:  Papers (16)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (5048 KB)  

    This paper presents the framework and model of a network operating system (NOS) called MIKE for use in distributed systems in general and for use in the Distributed Double-Loop Computer Network (DDLCN) in particular. MIKE, which stands for Multicomputer Integrator KErnel, provides system-transparent operation for users and maintains cooperative autonomy among local hosts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Science Revisited: A Critical Analysis of the Theory and Its Empirical Support

    Publication Year: 1983 , Page(s): 155 - 165
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3632 KB)  

    The theory of software science was developed by the late M. H. Halstead of Purdue University during the early 1970's. It was first presented in unified form in the monograph Elements of Software Science published by Elsevier North-Holland in 1977. Since it claimed to apply scientific methods to the very complex and important problem of software production, and since experimental evidence supplied by Halstead and others seemed to support the theory, it drew widespread attention from the computer science community. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Science and Cognitive Psychology

    Publication Year: 1983 , Page(s): 166 - 171
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2408 KB)  

    Halstead proposed a methodology for studying the process of programming known as software science. This methodology merges theories from cognitive psychology with theories from computer science. There is evidence that some of the assumptions of software science incorrectly apply the results of cognitive psychology studies. HAlstead proposed theories relative to human memory models that appear to be without support from psychologists. Other software scientists, however, report empirical evidence that may support some of those theories. This anomaly places aspects of software science in a precarious position. The three conflicting issues discussed in this paper are 1) limitations of short-term memory and number of sub-routine parameters, 2) searches in human memory and programming effort, and 3) psychological time and programming time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Properties Derived from Structural Analysis of Program Graph Models

    Publication Year: 1983 , Page(s): 172 - 178
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2688 KB)  

    It is considered interesting to identify, from the structure of control flow and of relationships among variables in a program, some properties allowing to point out possible sources of errors or of faulty behavior. In particular, it is found that information about termination of loops and about meaningfulness of acceptance tests in recopery block strategy can be extracted from such structural analysis. Criteria for applying this analysis to programs with arbitrary structures are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Very High-Level Interactive Graphical Trace for the Pascal Heap

    Publication Year: 1983 , Page(s): 179 - 185
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2560 KB)  

    A very high-level trace for data structures is one which displays a data structure in the shape in which the user conceptualizes it, be it a tree, an array, or a graph. GRAPHTRACE is a system that facilitates the very high-level graphic display of interrelationships among dynamically allocated Pascal records. It offers the user a wide range of options to enable him to "see" the data structures on a graphics screen in a format as close as possible to that in which he visualizes it, thereby providing a useful display capability when the user's conceptual model is a directed graph or tree. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anatomy of a Small Pascal Compiler

    Publication Year: 1983 , Page(s): 185 - 191
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3960 KB)  

    An exceptionally compact Pascal Compiler was written. We explain how. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Engineering Approach to Software Test Data Design

    Publication Year: 1983 , Page(s): 191 - 200
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4560 KB)  

    A systematic approach to test data design is presented based on both practical translation of theory and organization of professional lore. The approach is organized around five domains and achieving coverage (exercise) of them by the test data. The domains are processing functions, input, output, interaction among functions, and the code itself. Checklists are used to generate data for processing functions. Separate checklists have been constructed for eight common business data processing functions such as editing, updating, sorting, and reporting. Checklists or specific concrete directions also exist for input, output, interaction, and code coverage. Two global heuristics concerning all test data are also used. A limited discussion on documenting test input data, expected results, and actual results is included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling a Multiprocessor Architecture

    Publication Year: 1983 , Page(s): 201 - 210
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2624 KB)  

    Instead of using a very expensive and powerful central processing unit, the Hypercube F8 uses independent parallel microprocessors that are slow and inexpensive. This architecture is modeled in order to determine the proper number of microprocessors and to validate the system. The model is hierarchical. Different levels of the model are considered. Each level model corresponds to a subsystem of the Hypercube F8. Most of the common analytical methods are used and direct calculations are made. For each level several methods are compared and the approximations validated. The level 1 direct method is a general solution of polling models. The global model gives the throughput of the system the utilizations of the processors and the service times. We discuss the values of the parameters of the system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A System to Automatically Analyze Assembled Programs

    Publication Year: 1983 , Page(s): 210 - 213
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2016 KB)  

    An original system to perform an automatic analysis of assembled programs is presented. Executable programs are analyzed from the description of the machine on which they run and are translated into an intermediate language taking into account the particularities of the considered machine. The system was primarily designed as the first step of a project for transferring programs from one machine to another. The final goal of the project is to achieve an even utilization of computer resources for a real-time controlled robot, on the basis of partially dedicated processors. At the present time, the actual implementation provides a tool for studying the theoretical aspect of machine-level program analysis. Nevertheless, other applications can be found in program debugging and assembled program validation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database Engineering

    Publication Year: 1983 , Page(s): 213
    Save to Project icon | Request Permissions | PDF file iconPDF (183 KB)  
    Freely Available from IEEE
  • Nominations Invited for IEEE Awards

    Publication Year: 1983 , Page(s): 213-b - 213-c
    Save to Project icon | Request Permissions | PDF file iconPDF (344 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1983 , Page(s): 213-d
    Save to Project icon | Request Permissions | PDF file iconPDF (216 KB)  
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1983 , Page(s): 213
    Save to Project icon | Request Permissions | PDF file iconPDF (188 KB)  
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Software Engineering is interested in well-defined theoretical results and empirical studies that have potential impact on the construction, analysis, or management of software. The scope of this Transactions ranges from the mechanisms through the development of principles to the application of those principles to specific environments. Specific topic areas include: a) development and maintenance methods and models, e.g., techniques and principles for the specification, design, and implementation of software systems, including notations and process models; b) assessment methods, e.g., software tests and validation, reliability models, test and diagnosis procedures, software redundancy and design for error control, and the measurements and evaluation of various aspects of the process and product; c) software project management, e.g., productivity factors, cost models, schedule and organizational issues, standards; d) tools and environments, e.g., specific tools, integrated tool environments including the associated architectures, databases, and parallel and distributed processing issues; e) system issues, e.g., hardware-software trade-off; and f) state-of-the-art surveys that provide a synthesis and comprehensive review of the historical development of one particular area of interest.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Matthew B. Dwyer
Dept. Computer Science and Engineering
256 Avery Hall
University of Nebraska-Lincoln
Lincoln, NE 68588-0115 USA
tseeicdwyer@computer.org