By Topic

Software Engineering, IEEE Transactions on

Issue 7 • Date July 1985

Filter Results

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

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

    Publication Year: 1985 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (193 KB)  
    Freely Available from IEEE
  • Foreword Computers Come and Go But Data Go On Forever

    Publication Year: 1985 , Page(s): 573
    Save to Project icon | Request Permissions | PDF file iconPDF (1400 KB)  
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gambit: An Interactive Database Design Tool for Data Structures, Integrity Constraints, and Transactions

    Publication Year: 1985 , Page(s): 574 - 583
    Cited by:  Papers (5)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3608 KB)  

    The design of a database is a rather complex and dynamic process that requires comprehensive knowledge and experience. There exist many manual design tools and techniques, but the step from a schema to an implementation is still a delicate subject. The interactive database design tool Gambit supports the whole process in an optimal way. It is based on an extended relational-entity relationship model. The designer is assisted in outlining and describing data structures and consistency preserving update transactions. The constraints are formulated using the database programming language Modula/R which is based upon first-order predicate calculus. The update transactions are generated automatically as Modula/R programs and include all defined integrity constraints. They are collected in so-called data modules that represent the only interface to the database apart from read operations. The prototype facility of Gambit allows the designer to test the design of the database. The results can be used as feedback leading to an improvement of the conceptual schema and the transactions. View full abstract»

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

    Publication Year: 1985 , Page(s): 583 - 591
    Cited by:  Papers (3)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4552 KB)  

    Sedaco (the semantic database constructor) is a tool which may be used to implement databases. It is based on a semantic data model. Sedaco provides primitives for implementing semantic schemas and buffers the database designer from most low-level data structuring issues. Sedaco also efficiently maintains consistency within complex semantic databases. The tool is written in C and runs under Unix. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Application of Statistical Databases in Manufacturing Testing

    Publication Year: 1985 , Page(s): 591 - 598
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4448 KB)  

    This paper discusses some applications of statistical and database techniques for integrating tests in manufacturing products. It shows how statistical databases can be used for automatically controlling a manufacturing process in real time. Some new statistical methods of manufacturing testing, e. g., test-compression, testing-by-sampling, testing-by-factorial-design, are discussed. All these techniques are possible because of the availability of a statistical database. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilizing an Executable Specification Language for an Information System

    Publication Year: 1985 , Page(s): 598 - 605
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4224 KB)  

    This paper describes an approach to software specification development with interpretation as applied to an information storage and retrieval system. Machine execution of software specifications is possible with both partial and complete specifications. A partial specification is interpreted using abstract execution. The Descartes specification language is utilized to describe a functional aspect of an existing information storage and retrieval system, namely, the MADAM (Multics Approach to Data Access and Management) system at the University of Southwestern Louisiana. Brief descriptions of both the Descartes language and the MADAM system precede the example specification. The paper concludes with a discussion of the expected results that this methodology could have on the pragmatic development and evolution of information systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Distributed Databases on Local Computer Systems with a Multiaccess Network

    Publication Year: 1985 , Page(s): 606 - 619
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4760 KB)  

    Concurrency control, distribution design, and query processing are some of the important issues in the design of distributed databases. In this paper, we have studied these issues with respect to a relational database on a local computer system connected by a multiaccess broadcast bus. A broadcast bus allows information to be distributed efficiently, and hence simplifies the solutions to some of these issues. A transaction model that integrates the control strategies in concurrency control and query processing is proposed. In concurrency control, the lock, unlock, and update of data are achieved by a few broadcasts. A dynamic strategy is used in query processing, as less data are transferred when compared to a static strategy. The status information needed in dynamic query processing can be conveniently obtained by broadcasting. Lastly, some NP-hard file placement problems are found to be solvable in polynomial time when updates are broadcast. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Use of an Extended Relational Model to Handle Changing Incomplete Information

    Publication Year: 1985 , Page(s): 620 - 633
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4512 KB)  

    In this paper we consider approaches to updating databases containing null values and incomplete information. Our approach distinguishes between modeling incompletely known worlds and modeling changes in these worlds. As an alternative to the open and closed world assumptions, we propose the expanded closed world assumption. Under this assumption, we discuss how to perform updates on databases containing set nulls, marked nulls, and simple conditional tuples, and address some issues of refining incompletely specified information. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebra for a General Entity-Relationship Model

    Publication Year: 1985 , Page(s): 634 - 643
    Cited by:  Papers (7)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3480 KB)  

    Although many data manipulation languages (DML's) have been proposed for the entity-relationship (ER) model, there is no agreement on what are the basic manipulations that any ER DML must offer. Moreover, there is no DML which fully supports all the capabilities of a general ER model with n-ary relationships, relationships with attributes, optional, complex, and multivalued attributes. This paper consequently proposes a definition of a set of algebraic operators to be applied on a general ER database. The algebra is said to be complete through equivalence with the usual definition of completeness for relational data manipulation languages. This work is intended to provide a sound basis for the definition of complete entity-relationship DML's, an essential feature to make the ER model fully operational. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing Roles in Universal Scheme Interfaces

    Publication Year: 1985 , Page(s): 644 - 652
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3496 KB)  

    Users of a relational database must explicitly navigate between relations in order to establish a connection among a set of attributes spanning several relation schemes. While a universal scheme interface to a relational database provides users with automatic navigation, it usually imposes on the database a unique role assumption. This assumption requires every attribute name to represent a unique role in the database, so that connections among sets of attributes are unambiguous. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for papers

    Publication Year: 1985 , Page(s): 653
    Save to Project icon | Request Permissions | PDF file iconPDF (126 KB)  
    Freely Available from IEEE
  • Tutorial Week Washington 1985

    Publication Year: 1985 , Page(s): 654
    Save to Project icon | Request Permissions | PDF file iconPDF (224 KB)  
    Freely Available from IEEE
  • IEEE copyright form

    Publication Year: 1985 , Page(s): 655
    Save to Project icon | Request Permissions | PDF file iconPDF (262 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1985 , Page(s): 655-b
    Save to Project icon | Request Permissions | PDF file iconPDF (240 KB)  
    Freely Available from IEEE
  • Beyond The Basics: A Software Publication Series for Successful Computer Professionals From the IEEE Computer Society

    Publication Year: 1985 , Page(s): 655-c
    Save to Project icon | Request Permissions | PDF file iconPDF (1112 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