By Topic

IEEE Transactions on Software Engineering

Issue 3 • Date March 1986

Filter Results

Displaying Results 1 - 16 of 16
  • Two-dimensional program design

    Publication Year: 1986, Page(s):377 - 384
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1870 KB)

    One-dimensional design methods focus on one way of looking at data and control relationships in a design. Structured design concentrates on top-down, or vertical relationships. Data flow diagrams concentrate on horizontal relationships, in which the output from one computation flows to the next computation to be done. Two-dimensional design allows the simultaneous consideration of both the functio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible software development for multiple computer systems

    Publication Year: 1986, Page(s):385 - 401
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4042 KB)

    The authors develop a model of concurrent software and the associated programming tools that jointly permit flexible software development for experimental programming on the Cm* multiprocessor. The model's implementation in the TASK and Bliss-11 programming languages is described using a sample concurrent program. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reuse of software through generation of partial systems

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

    The author considers the problem of constructing partial systems, where the program of a partial system is obtained by selecting only those code segments of the complete program that implement the capabilities needed. A heuristic for determining fragments of a program system, which can serve as the building blocks for the programs of partial systems, is presented. The notion of `B-program' ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A structure editor for abstract document objects

    Publication Year: 1986, Page(s):417 - 435
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3512 KB)

    The author presents an interactive document editor based on an expressive abstract document model for paper and electronic documents. The model introduces the notions of abstract and concrete objects, hierarchical composition of ordered and unordered objects, sharing of components, and reference links. It has been used to specify a wide variety of document objects, and is the basis for a document ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic storage fragmentation and file deterioration

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

    As a result of insertions and deletions, a file tends to be cluttered with deleted records which are physically present. These unwanted records cause fragmentation within the file and give rise to additional access overhead because they have to be skipped over during processing. A connection between the dynamic fragmentation characteristics and the pattern of record insertions and deletions over t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derivation of a parallel algorithm for balancing binary trees

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

    A recent trend in program methodologies is to derive efficient parallel programs from sequential programs. This study explores the question of transforming a sequential algorithm into an efficient parallel algorithm by considering the problem of balancing binary search trees. The derivation of the parallel algorithm makes use of stepwise refinement. The authors first derive a new iterative balanci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of open networks of queues with blocking: Tandem configurations

    Publication Year: 1986, Page(s):450 - 461
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2476 KB)

    An approximation procedure is developed for the analysis of tandem configurations consisting of single server finite queues linked in series. External arrivals occur at the first queue which may be either finite or infinite. Departures from the queuing network may only occur from the last queue. All service times and interarrival times are assumed to be exponentially distributed. The approximation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Commutable transactions and the time_pad synchronization mechanism for distributed systems

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

    The author develops the concept of commutable transactions, where a user initiating a commutable transaction permits the system to commute (recorder) his transaction in relation to other concurrent transactions so that the transaction, in case it faces abortion due to conflict, can be salvaged without the user's intervention. The user specifies a limit to the commutability of his transaction. A ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed agreement in the presence of processor and communication faults

    Publication Year: 1986, Page(s):477 - 482
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1298 KB)

    A model of distributed computation is proposed in which processes may fail by not sending or receiving the message specified by a protocol. The solution to the Byzantine generals problem for this model is presented. The algorithm exhibits early stopping under conditions of less than maximum failure and is as efficient as the algorithm developed for the more restrictive crash-fault model in terms o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal partitioning of randomly generated distributed programs

    Publication Year: 1986, Page(s):483 - 495
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2641 KB)

    An investigation is made of an optimal task-assignment policy for a random-graph model of a distributed program. The model of the distributed computer system assumes that communications overhead adds to total run time and that total run time decreases as the number of processors running the program is increased. When the processors are homogeneous, the optimal task-assignments are external in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The impact on software development costs of using HOL's

    Publication Year: 1986, Page(s):496 - 499
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (789 KB)

    The author quantifies the relative reduction in software development costs provided by the use of a higher order coding language (HOL). Paradoxically, as T. C. Jones (1978) has pointed out, when productivity is measured as source lines of code per labor month, there is `an apparent productivity lowering for the whole development cycle with high level (coding) languages, even though development cos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to “optimal load balancing in a multiple processor system with many job classes”

    Publication Year: 1986, Page(s): 500
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    In the above paper1, an error was made in the Load Balancing Algorithm. A more clear recursive way to present this algorithm is to modify steps S3 to S5 as follows. 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): 1
    Request permission for commercial reuse | PDF file iconPDF (230 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 1986, Page(s): 502
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 1986, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • Call for papers

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