By Topic

IEEE Transactions on Software Engineering

Issue 11 • Date Nov 1988

Filter Results

Displaying Results 1 - 17 of 17
  • Web structures: a tool for representing and manipulating programs

    Publication Year: 1988, Page(s):1621 - 1639
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1332 KB)

    The authors introduce web structures and their transformations and develop their theory in the framework of category theory. Once a program has been represented as a web structure, software tools, such as a high-level data flow analyzer or other general program transformers, can be written as sets of web structure production rules. An implementation of web structure transformations is in progress.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing submodule specifications and network protocols

    Publication Year: 1988, Page(s):1565 - 1577
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    Applications of an automated tool for module specification (ATMS) that finds the specification for a submodule of a system are presented. Given the specification of a system, together with the specification for n-1 submodules, the ATMS constructs the specification for the nth addition submodule such that the interaction among the n submodules is equivalent to the specifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of response and stability on scheduling in distributed computing systems

    Publication Year: 1988, Page(s):1578 - 1588
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    An examination is made of the effects of response and stability on scheduling algorithms for general-purpose distributed computing systems. Response characterizes the time required, following a perturbation in the system state, to reach a new equilibrium state. Stability is a measure of the ability of a mechanism to detect when the effects of further actions will not improve the system state as de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved algorithm based on subset closures for synthesizing a relational database scheme

    Publication Year: 1988, Page(s):1731 - 1738
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    An algorithm for synthesizing a better relational database scheme in elementary key normal form (EKNF) is developed. This algorithm eliminates not only extraneous attributes and other redundancies, but also superfluities from a given set of functional dependences (FDs), based primarily on subset closures, Hamiltonian cycles of FDs, and equivalent subsets of attributes. Following this algorithm, a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software prototyping by relational techniques: experiences with program construction systems

    Publication Year: 1988, Page(s):1597 - 1609
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    A method for designing and prototyping program construction systems using relational databases is presented. Relations are the only data structures used inside the systems and for interfaces; programs extensively use relational languages, in particular relational algebra. Two large projects are described. The Ada Relational Translator (ART) is an experimental compiler-interpreter for Ada in which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of load dependent general queueing networks

    Publication Year: 1988, Page(s):1537 - 1545
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    A method for obtaining approximate solutions to load-dependent closed queueing networks containing general service-time distributions and first-come-first-served scheduling disciplines is presented. The technique demonstrated is an extension of the well-known method of R. Marie (1979). A formula for the conditional throughputs is derived. After each iteration a check is performed to guarantee that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and analysis of the behavior of information systems

    Publication Year: 1988, Page(s):1610 - 1620
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    Many widely used specification techniques for information systems are based on a hierarchy of information flow diagrams. A method is introduced which preserves the benefits of these techniques and adds the precision of the Petri net formalism. Information-flow diagram hierarchies are formalized by notions of net theory. The bottom-level nets of a hierarchy are treated as Petri nets. The behavior m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software complexity and its impact on software reliability

    Publication Year: 1988, Page(s):1645 - 1655
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    To produce reliable software, its complexity must be controlled by suitably decomposing the software system into smaller subsystems. A software complexity metric is developed that includes both the internal and external complexity of a module. This allows analysis of a software system during its development and provides a guide to system decomposition. The basis of this complexity metric is in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GENESIS: an extensible database management system

    Publication Year: 1988, Page(s):1711 - 1730
    Cited by:  Papers (30)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1600 KB)

    A novel yet simple technology is presented that enables customized database management systems (DBMSs) to be developed rapidly. The authors are designing an extensible DBMS, called GENESIS, which is based on this theory. They give a detailed description of their first operational prototype. DBMS software components in GENESIS can be written in a few months. When all components for a target DBMS ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Description for a tool specifying and prototyping concurrent programs

    Publication Year: 1988, Page(s):1554 - 1564
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    A specification language is introduced, able to define the behavior of concurrent programs. The language is particularly devoted to describing distributed applications, mainly with respect to scheduling problems. For this purpose, the language allows visibility of the past history of a computation and such history may be explicitly used to derive the choices on the future behavior of the computati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to software product testing

    Publication Year: 1988, Page(s):1589 - 1596
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    An approach is presented that uses the following techniques: automatic test case generation, self-checking test cases, black box test cases, random test cases, sampling, a form of exhaustive testing, correctness measurements, and the correction of defects in the test cases instead of in the product (defect circumvention). The techniques are cost-effective and have been applied to very large produc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compile-time program restructuring in multiprogrammed virtual memory systems

    Publication Year: 1988, Page(s):1640 - 1644
    Cited by:  Papers (4)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    An evaluation is made of a way to reduce the cost of program restructuring by having a compiler determine the program's packing in virtual address space from an analysis of its source code. Two features of this method are the duplication of code modules in virtual address space and the inline substitution of the code for a called procedure. This compile-time restructuring algorithm is evaluated us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for multidimensional partitioning of static files

    Publication Year: 1988, Page(s):1700 - 1710
    Cited by:  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    The problem of multidimensional file partitioning (MDFP) arises in large databases that are subject to frequent range queries on one or more attributes. In an MDFP scheme, the search attribute space is partitioned into cells, which are mapped to physical disk locations. This mapping preserves the order of the search attribute values so that range queries can be answered most efficiently, while mai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rendezvous facilities: Concurrent C and the Ada language

    Publication Year: 1988, Page(s):1546 - 1553
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The concurrent programming facilities in both Concurrent C and the Ada language are based on the rendezvous concept. Although these facilities are similar, there are substantial differences. Facilities in Concurrent C were designed keeping in perspective the concurrent programming facilities in the Ada language and their limitations. Concurrent C facilities have also been modified as a result of e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The join algorithms on a shared-memory multiprocessor database machine

    Publication Year: 1988, Page(s):1668 - 1683
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    The authors develop and present a large set of parallel algorithms for implementing the join operation on a shared-memory multiprocessor database machine. The development of these algorithms follows a structured approach. The major steps involved in the processing of the join operation by the machine are first identified. Then, alternative join algorithms are constructed by concatenating the diffe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Petri-net-based modeling and evaluation of pipelined processing of concurrent database queries

    Publication Year: 1988, Page(s):1656 - 1667
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    A description is given of a Petri-net-based methodology for modeling and evaluation of pipelined processing of concurrent database queries in an integrated data network (IDN). An extended Petri-net model is presented and used to model two key approaches to concurrent database query processing in the IDN, namely, pipelined and data-flow-based execution of queries and intermediate data sharing among... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering a DAG for CAD databases

    Publication Year: 1988, Page(s):1684 - 1699
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1404 KB)

    A DAG (direct acyclic graph) is an important data structure which requires efficient support in CAD (computer-aided design) databases. It typically arise from the design hierarchy, which describes complex designs in terms of subdesigns. A study is made of the properties of the three types of clustered sequences of nodes for hierarchies and DAGs, and algorithms are developed for generating the clus... View full abstract»

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

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