IEEE Transactions on Software Engineering

Issue 4 • April 1986

Filter Results

Displaying Results 1 - 13 of 13
  • Some design aspects of databases through Petri net modeling

    Publication Year: 1986, Page(s):505 - 510
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1281 KB)

    The authors exploit the concepts of Petri nets for the modeling of databases through a meaningful interpretation of various database structures. This has been achieved using, specifically, the reachability and conflict concepts of Petri nets. The concept of conflict has been given a mathematical interpretation to suit its applications to database structures. Starting with a network structure, a ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed database management model and validation

    Publication Year: 1986, Page(s):511 - 520
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2273 KB)

    The authors describe a simple, yet effective, distributed database model that simulates database usage and buffer management in the distributed data processing environment. The model is table driven such that database access requirements, file location, and other information defining the database environment are set up internally in several tables, and linked lists represent the directory and data... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decomposition solution to a queueing network model of a distributed file system with dynamic locking

    Publication Year: 1986, Page(s):521 - 530
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1930 KB)

    The author presents a new approach to modeling file systems using queueing networks. The delays due to locking the files are modeled using service centers whose service times and probabilities of access are estimated from the values of measurable quantities. The model of a lock is based on the analysis of execution of transactions in the system. The lock for every file is modeled as a sequence of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed scheme for detecting communication deadlocks

    Publication Year: 1986, Page(s):531 - 537
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1521 KB)

    A distributed system is an interconnected network of computing elements or nodes, each of which has its own storage. A distributed program is a collection of processes which execute asynchronously, possibly in different nodes of a distributed system, and they communicate with each other in order to realize a common goal. In such an environment, a group of processes may sometimes get involved in a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A layout algorithm for data flow diagrams

    Publication Year: 1986, Page(s):538 - 546
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1380 KB)

    A layout algorithm is presented that allows the automatic drawing of data flow diagrams, a diagrammatic representation widely used in the functional analysis of information systems. A grid standard is defined for such diagrams, and aesthetics for good readability are identified. The layout algorithm receives as input an abstract graph specifying connectivity relations between the elements of the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of a debugger for a concurrent language

    Publication Year: 1986, Page(s):547 - 553
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1784 KB)

    The authors discuss issues related to the debugging of concurrent programs. A set of desirable characteristics for a debugger for concurrent languages is deduced from a review of the differences between the debugging of concurrent programs and that of sequential ones. A debugger for concurrent language based upon CSP is then described. The debugger makes it possible to compare a description of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load-leveling in fault-tolerant distributed computing systems

    Publication Year: 1986, Page(s):554 - 560
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1656 KB)

    Assuming a horizontally distributed computing system, formulations of the edge-failure and node-failure recovery problems from the standpoint of load-leveling are presented. The conditions for the existence of solutions to these problems are examined and simple algorithms are proposed for these problems. In connection with the node-failure recovery problem, the concept of a node-failure metric to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining queueing network and Generalized Stochastic Petri Net models for the analysis of some software blocking phenomena

    Publication Year: 1986, Page(s):561 - 576
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2571 KB)

    Much work has been done on the modeling of hardware resources; far fewer studies have been conducted on the impact of software systems on the underlying hardware. The authors address one such case in which blocking is present because of critical sections of code; this cannot be treated within the framework of product-form queuing network models. They show how a combination of generalized stochasti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NON-VON's performance on certain database benchmarks

    Publication Year: 1986, Page(s):577 - 583
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1743 KB)

    In a paper by P.B. Hawthorn and D.J. DeWitt (1982) the projected performance of several proposed database machines was examined for three relational database queries. The present authors investigate the performance of a massively parallel machine called NON-VON for the same queries under comparable assumptions. In the case of simple queries, a NON-VON machine of comparable size to those considered... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Validating Halstead's theory with system 3 data

    Publication Year: 1986, Page(s): 584
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    Gaffney (ibid., vol.SE-10, no.7, pp.459-463, 1984) concludes that the number of faults per line of code is independent of whether Assembly language or a high order language is used. This is contrary to the results published by the commenter (ibid. vol.SE-8, pp.437-439, July 1982). It is contended that the paper by Gaffney contains some technical errors and uses erroneous data. An explanation of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on “estimating the number of faults in code” and two corrections to published data

    Publication Year: 1986, Page(s):584 - 585
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB)

    The subject paper1 concludes that number of faults per line of code is independent of whether Assembly language or a high order language (HOL) is used, contrary to previously published results by the author of this correspondence. However, the subject paper contains some technical errors and uses erroneous data. An explanation of the source of the erroneous data is given. Also, previous... 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: 1986, Page(s):586 - 587
    Request permission for commercial reuse | PDF file iconPDF (159 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 1986, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (247 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