By Topic

Software Engineering, IEEE Transactions on

Issue 1 • Date Jan. 1981

Filter Results

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

    Publication Year: 1981 , Page(s): c1
    Request Permissions | PDF file iconPDF (623 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1981 , Page(s): c2
    Request Permissions | PDF file iconPDF (256 KB)  
    Freely Available from IEEE
  • Editorial: Program Transformations

    Publication Year: 1981 , Page(s): 1 - 2
    Request Permissions | PDF file iconPDF (2648 KB)  
    Freely Available from IEEE
  • Transformational Implementation: An Example

    Publication Year: 1981 , Page(s): 3 - 14
    Cited by:  Papers (39)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2688 KB)  

    A system for mechanically transforming formal program specifications into efficient implementations under interactive user control is described and illustrated through a detailed example. The potential benefits and problems of this approach to software implementation are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program Development as a Formal Activity

    Publication Year: 1981 , Page(s): 14 - 22
    Cited by:  Papers (8)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2936 KB)  

    A methodology of program development by transformations is outlined. In particular, ways of representing the transformation rules are discussed, and the relationship between notions of their correctness and the semantic definition of programming languages is studied. How transformation techniques are complemented by the use of abstract data types and assertions is described. In the resulting calcu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Transformational Derivation of a Parsing Algorithm in a High-Level Language

    Publication Year: 1981 , Page(s): 23 - 31
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2528 KB)  

    This paper presents a detailed algorithm derivation scenario, using correctness preserving source-to-source transfonnations. The algorithm derived is the Cocke-Younger nodal spans parsing algorithm. We describe a high-level SETL-like specification language, and give a partial correctness formalism and a set of transformation rules which enable the combination of algorithms whose partial correctnes... View full abstract»

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

    Publication Year: 1981 , Page(s): 32 - 39
    Cited by:  Papers (1)  |  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3000 KB)  

    Current work on data structure encapsulation and abstraction focuses attention on individual structures and permits separate local optimizations, of these structures. We extend this work by developing the beginnings of an algebra for aggregating individual data types into larger more coordinated structures which can be more effectively optimized. The present work can well be viewed as the data equ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Analyzers for Selective Program Analysis

    Publication Year: 1981 , Page(s): 39 - 51
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4456 KB)  

    The need for programming environments which support different phases of the software life cycle using responsive tools is well established. This paper presents a method for developing automatic analyzers which analyze programs and provide programmers with a variety of messages for the purpose of validating these programs in the early stages of program development. We show using an example, that su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consequence Verification of Flowcharts

    Publication Year: 1981 , Page(s): 52 - 60
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2864 KB)  

    A common basis is presented, for Floyd's method of inductive assertions and for the subgoal induction method of Morris and Wegbreit. This basis is provided by consequence verification, a method for verifying logic programs. We connect flowcharts with logic programs by giving a recursive definition of the set of all computations of a flowchart. This definition can be given in two ways: the recursio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Qualified Data Flow Problems

    Publication Year: 1981 , Page(s): 60 - 78
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (6512 KB)  

    It is known that not aU paths are possible in the run time control flow of many programs. It is also known that data flow analysis cannot restrict attention to exactly those paths that are possible. It is, therefore, usual for analytic methods to consider aU paths. Sharper information can be obtained by considering a recursive set of paths that is large enough to include aUl possible paths, but sm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of the Number of Copies in a Distributed Data Base

    Publication Year: 1981 , Page(s): 78 - 84
    Cited by:  Papers (21)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3640 KB)  

    We consider the effect on system performance of the distribution of a data base in the form of multiple copies at distinct sites. The purpose of our analysis is to determine the gain in READ throughput that can be obtained in the presence of consistency preserving algorithms that have to be implemented when UPDATE operations are carried out on each copy. We show that READ throughput diminishes if ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further Analysis of the Entity-Relationship Approach to Database Design

    Publication Year: 1981 , Page(s): 85 - 99
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3160 KB)  

    The nondeterministic or deterministic entity-relationship model of a database is formaRy defined as a user's view of that database in terms of a collection of time-varying relations: the regular or weak entity relations, or the regular or weak relationship relations. Both nondeterministic and deterministic entity-relationship models have the same strength to characterize information concerning ent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping Considerations in the Design of Schemas for the Relational Model

    Publication Year: 1981 , Page(s): 99 - 111
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4200 KB)  

    The typical design process for the relational database model develops the conceptual schema and each of the external schemas separately and independently from each other. This paper proposes a new design methodology that constructs the conceptual schema in such a way that overlappings among external schemas are reflected. If the overlappings of external schemas do not produce transitivity at the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms to Distribute a Database for Parallel Searching

    Publication Year: 1981 , Page(s): 112
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (184 KB)  

    Algorithm of Ghosh [1] for distribution of segments over computer network for parallel searchability of multiple segments required by queries have been modified to reduce average running time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DMIN: An Algorithm for Computing the Optimal Dynamic Allocation in a Virtual Memory Computer

    Publication Year: 1981 , Page(s): 113 - 121
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4104 KB)  

    An optimal unrealizable (in real time) virtual memory allocation algorithm DMIN is developed. OMIN has the following properties. A dynamic (time-varying) size of allocation is computed by DMIN to minimize the space-time product of physical memory aliocated to a task during execution. The algorithm is a function of one parameter R, the reactivation time-the average time from the occurrence of a pag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comparison of Dynamic and Static Virtual Memory Allocation Algorithms

    Publication Year: 1981 , Page(s): 122 - 131
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1760 KB)  

    In this paper we compare the performance of virtual memory allocation algorithms. The primary measure of performance is the space-time product of primary memory occupancy, or space-time cost, used by a program during its execution. Using DMIN, an optimal dynamic aliocation algorithm, we compute the minimum space-time cost achievable for some benchmark program runs. We compare the DMIN space-time c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum Cell Size for the Storage of Messages

    Publication Year: 1981 , Page(s): 132 - 134
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1640 KB)  

    In this paper we discuss a memory allocation problem first introduced by Wolman in [1] (see also [2]). A general solution formula is presented, from which closed form expressions for a few special cases may be easily derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internal Scheduling and Memory Contention

    Publication Year: 1981 , Page(s): 135 - 146
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3536 KB)  

    It has been suggested that the algorithm used to schedule those processes active and in main memory can have an effect on memory contention. We create models for memory contention in a system that uses global LRU replacement and either round robin or priority internal scheduling. Parameters to our model include the ratio of secondary storage to primary storage access times, thus allowing considera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capture-Recapture Sampling for Estimating Software Error Content

    Publication Year: 1981 , Page(s): 147 - 148
    Cited by:  Papers (10)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (456 KB)  

    Mills capture-recapture sampling method allows the estimation of the number of errors in a program by randomly inserting known errors and then testing the program for both inserted and indigenous errors. This correspondence shows how correct confidence limits and maximum likelihood estimates can be obtained from the test results. Both fixed sample size testing and sequential testing are considered... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1980 Referees List

    Publication Year: 1981 , Page(s): 148 - 149
    Request Permissions | PDF file iconPDF (264 KB)  
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1981 , Page(s): 150
    Request Permissions | PDF file iconPDF (225 KB)  
    Freely Available from IEEE
  • IEEE copyright form

    Publication Year: 1981 , Page(s): 151
    Request Permissions | PDF file iconPDF (270 KB)  
    Freely Available from IEEE
  • 5th International Conference on Software Engineering

    Publication Year: 1981 , Page(s): 151
    Request Permissions | PDF file iconPDF (1473 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1981 , Page(s): 151-j
    Request Permissions | PDF file iconPDF (160 KB)  
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1981 , Page(s): 151
    Request Permissions | PDF file iconPDF (1277 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
tse-eic@computer.org