By Topic

IEEE Transactions on Software Engineering

Issue 10 • Oct. 1988

Filter Results

Displaying Results 1 - 14 of 14
  • A prototyping language for real-time software

    Publication Year: 1988, Page(s):1409 - 1423
    Cited by:  Papers (43)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1625 KB)

    PSDL is a language for describing prototypes of real-time software systems. It is most useful for requirements analysis, feasibility studies, and the design of large embedded systems. PSDL has facilities for recording and enforcing timing constraints, and for modeling the control aspects of real-time systems using nonprocedural control constraints, operator abstractions, and data abstractions. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of inherently fault tolerant distributed programs

    Publication Year: 1988, Page(s):1432 - 1442
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1095 KB)

    Software for industrial process-control systems, such as nuclear power plant safety control systems and robots, can be very complex because of the large number of cases that must be considered. A design approach is proposed that uses decentralized control concepts, and is based on E.W. Dijkstra's concept of self-stabilizing systems (1974). This method greatly simplifies the software, so that its c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed deadlock detection and resolution algorithm and its correctness proof

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

    The key idea of the algorithm is to let one transaction controller be in charge of all transactions in a set of interacting transactions. Two transactions are interacting if they are both interested in (accessing) the same resource. In addition, the controller is in charge of all the resources allocated to any of the transactions in the set. Having one controller in charge of all the transactions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A strategy for comparing alternative software development life cycle models

    Publication Year: 1988, Page(s):1453 - 1461
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (773 KB)

    It is difficult to compare and contrast models of software development because their proponents often use different terminology, and the models often have little in common except their beginnings (marked by a recognition that a problem exists) and ends (marked by the existence of a software solution). A framework is provided that can serve: as a basis for analyzing the similarities and differences... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An applicable family of data flow testing criteria

    Publication Year: 1988, Page(s):1483 - 1498
    Cited by:  Papers (228)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB)

    The authors extend the definitions of the previously introduced family of data flow testing criteria to apply to programs written in a large subset of Pascal. They then define a family of adequacy criteria called feasible data flow testing criteria, which are derived from the data-flow testing criteria. The feasible data flow testing criteria circumvent the problem of nonapplicability of the data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining static concurrency analysis with symbolic execution

    Publication Year: 1988, Page(s):1499 - 1511
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1479 KB)

    Static concurrency analysis detects anomalous synchronization patterns in concurrent programs, but may also report spurious errors involving infeasible execution paths. Integrated application of static concurrency analysis and symbolic execution sharpens the results of the former without incurring the full costs of the latter when applied in isolation. Concurrency analysis acts as a path selection... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extended domain-based model of software reliability

    Publication Year: 1988, Page(s):1512 - 1524
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1327 KB)

    A definition of software reliability is proposed in which reliability is treated as a generalization of the probability of correctness of the software in question. A tolerance function is introduced as a method of characterizing an acceptable level of correctness. This in turn is used, together with the probability function defining the operational input distribution, as a parameter of the definit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handling timing errors in distributed programs

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

    The authors describe a tool called TAP, which is defined to aid the programmer in discovering the causes of timing errors in running programs. TAP is similar to a postmortem debugger, using the history of interprocess communication to construct a timing graph, a directed graph where an edge joins node x to node y if event x directly precedes event y in time. The programmer can then use TAP to look... View full abstract»

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

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

    H.D. Mills and R.C. Linger (1986) propose adding the datatype set to existing programming languages. During some investigations using sets, it became apparent that Quicksort can be written without using stacks (or recursion). Using sets can lead to efficient multiprocessor usage, because if the elements of a set can be processed in any order, they can frequently be processed simultaneously. An exa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability of systems with Markov transfer of control, II

    Publication Year: 1988, Page(s):1478 - 1480
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    A software/hardware system is considered that can be decomposed into a finite number of modules. It is assumed that control of the system is transferred among the modules according to a Markov process. Each module has an associated reliability that gives the probability that the module will operate correctly when called and will transfer control successfully when finished. The measure of reliabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PHILAN: a LAN providing a reliable message service for distributed processing

    Publication Year: 1988, Page(s):1424 - 1431
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A local area network (LAN) design based on a ring topology is presented which can support both packet-switched and circuit-switched traffic. The packet-switching service is reliable in that the LAN controllers deal with all protocol problems, i.e., medium arbitrations as well as flow and error control. The service can meet real-time constraints, since the performance is stable under high load cond... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying synthesis principles to create responsive software systems

    Publication Year: 1988, Page(s):1394 - 1408
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1432 KB)

    The general principles for formulating software requirements and designs that meet response-time goals are reviewed. The principles are related to the system performance parameters that they improve, and thus their application may not be obvious to those whose speciality is system architecture and design. The author addresses the designer's perspective and illustrates how these principles apply to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding and controlling software costs

    Publication Year: 1988, Page(s):1462 - 1477
    Cited by:  Papers (202)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1464 KB)

    A discussion is presented of the two primary ways of understanding software costs. The black-box or influence-function approach provides useful experimental and observational insights on the relative software productivity and quality leverage of various management, technical, environmental, and personnel options. The glass-box or cost distribution approach helps identify strategies for integrated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gray codes for partial match and range queries

    Publication Year: 1988, Page(s):1381 - 1393
    Cited by:  Papers (45)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    It is suggested that Gray codes be used to improve the performance of methods for partial match and range queries. Specifically, the author illustrates the improved clustering of similar records that Gray codes can achieve with multiattribute hashing. Gray codes are used instead of binary codes to map record signatures to buckets. In Gray codes, successive codewords differ in the value of exactly ... 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