By Topic

IEEE Transactions on Software Engineering

Issue 4 • Date April 1988

Filter Results

Displaying Results 1 - 15 of 15
  • Comments on "Formal specification of user interfaces: a comparison and evaluation of four axiomatic approaches" by U.H. Chi

    Publication Year: 1988, Page(s):438 - 439
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (103 KB)

    A recent paper (see ibid., vol.11, no.8, p.671-88, Aug. 1985) compared several axiomatic methods of formal specification, one of which was Z. As a result of a comparison made with Z and a similar, but executable, specification language called Me too, it was pointed out that one of the Z specifications given was not correct. In this response, the erroneous function is described and some conclusions... View full abstract»

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

    Publication Year: 1988, Page(s): 521
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (3152 KB)
    Freely Available from IEEE
  • Verification of concurrent control flow in distributed computer systems

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

    An approach to verifying control flow in distributed computer systems (DCS) is presented. The approach is based on control flow checking among software components distributed over processors and cooperating among them. In this approach, control-flow behavior of DCS software is modeled and contained in special software components called verifiers. The verifiers are distributed over the processors a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance comparison of multimicro and mainframe database architectures

    Publication Year: 1988, Page(s):522 - 531
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The performance of a hypothetical multiprocessor back-end database machine is compared to that of a mainframe database system. The hypothetical database machine uses standard microprocessors and disks as well as processors and disks projected to be available in the future. The class of workloads considered is high-volume transaction processing. Analytic queueing models of the two architectures are... View full abstract»

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

    Publication Year: 1988, Page(s):444 - 454
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    FPOPT, a globally optimizing compiler for FP, was built to study the efficiency of compiling a functional programming language by translating it into an intermediate language and then optimizing that intermediate language. The FPOPT system, the design of the intermediate language and the optimizations performed are described. The relative effectiveness of these optimizations, singly and in combina... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel discrete event simulation using shared memory

    Publication Year: 1988, Page(s):541 - 553
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    With traditional event-list techniques, evaluating a detailed discrete event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments using the Chand... View full abstract»

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

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

    The formal semantics of a novel language, called EqL, are presented for first-order functional and Horn logic programming. An EqL program is a set of conditional pattern-directed rules, where the conditions are expressed as a conjunction of equations. The programming paradigm provided by this language may be called equational programming. The declarative semantics of equations is given in terms of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parsing languages by pattern matching

    Publication Year: 1988, Page(s):498 - 511
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1284 KB)

    The language of universal algebras is used as an alternative approach for programming language specification. BNF (Backus-Naur form) rules are used for specifying the signature of the language algebras instead of the context-free syntax. The algorithm for program parsing is inductively defined by the following universal algebraic construction: any function defined on the generators of a free algeb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Other comments on 'Optimization algorithms for distributed queries' by P.M.G. Apears

    Publication Year: 1988, Page(s):439 - 441
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    An erroneous fact concerning the assumption of irreducibility of nonjoining attributes of the distributed query optimization algorithm called GENERAL presented in the above paper (see ibid., vol.SE-9, no.1, p.57-68, Jan. 1983) is pointed out. It is shown that it is possible to generate an efficient semijoin program with better response time than the one produced by the GENERAL algorithm. A counter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mean value analysis for blocking queueing networks

    Publication Year: 1988, Page(s):418 - 428
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    An approximation is introduced for the mean value analysis of queueing networks with transfer blocking. The blocking occurs when a job, after completing service at a station, wants to join a station which is full. The job resides in the server of the source station until a place becomes available in the destination station. The approximation is based on the modification of mean residence times, du... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of parallel processing systems

    Publication Year: 1988, Page(s):532 - 540
    Cited by:  Papers (69)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    A bulk arrival Mx/M/c queuing system is used to model a centralized parallel processing system with job splitting. In such a system, jobs wait in a central queue, which is accessible by all the processors, and are split into independent tasks that can be executed on separate processors. The job response-time consists of three components: queuing delay, service time, and synchronization ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A language and system for the construction and tuning of parallel programs

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

    The programming of efficient parallel software typically requires extensive experimentation with program prototypes. To facilitate such experimentation, any programming system that supports rapid prototyping of parallel programs should provide high-level language primitives with which programs can be explicitly, statically, or dynamically tuned with respect to performance and reliability. Such lan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A predicate-transition net model for parallel interpretation of logic programs

    Publication Year: 1988, Page(s):481 - 497
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1532 KB)

    A predicate/transition net model for a subset of Horn clause logic programs is presented. The syntax, transformation procedure, semantics, and deduction process for the net model are discussed. A possible parallel implementation for the net model is described, which is based on the concepts of communicating processes and relations. The proposed net model offers a syntactical variant of Horn clause... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model of visibility control

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

    A formal model for describing and evaluating visibility control mechanisms is introduced. The model reflects a general view of visibility in which the concepts of requisition of access and provision of access are distinguished. This model provides a means for characterizing and reasoning about the various properties of visibility control mechanisms. Specifically, the notion of preciseness is defin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Version support for engineering database systems

    Publication Year: 1988, Page(s):429 - 437
    Cited by:  Papers (53)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    In engineering applications, multiple copies of object descriptions have to coexist in a single database. A scheme is proposed that enables users to explicitly deal with these object versions. After introducing a basic version model, the problem of rerouting interobject references on the creation of new versions is solved by providing generic references and user-specific environments. Logical vers... 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