By Topic

IEEE Transactions on Software Engineering

Issue 5 • Date May 1989

Filter Results

Displaying Results 1 - 18 of 18
  • A software science model of compile time

    Publication Year: 1989, Page(s):543 - 549
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    The Halstead theory of software science is used to describe the compilation process and generate a compiler performance index. A nonlinear model of compile time is estimated for four Ada compilers. A fundamental relation between compile time and program modularity is proposed. Issues considered include data collection procedures, the development of a counting strategy, the analysis of the complexi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing two functional programming systems

    Publication Year: 1989, Page(s):532 - 542
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    A technique is presented for comparing the performance of functional languages with different evaluation strategies running on different machines. A set of small benchmarks is used, and th execution times of these programs running in the functional language and in the implementation language of the functional system are compared. The ratio of these execution times measured how well the functional ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed computing with single read-single write variables

    Publication Year: 1989, Page(s):569 - 574
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Single-read-single-write (SRSW) variables are presented for synchronous and asynchronous communication between processes. The operational semantics of the instruction accessing these variables is quite simple: a SRSW variable can be written if it is free, and, once written, it becomes busy. A SRSW variable can be read when busy, and, once read, it becomes free. A process attempting to read a free ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing the completeness of specifications

    Publication Year: 1989, Page(s):526 - 531
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    A system is described that tests for the completeness of axiomatic specifications of abstract data types. For testing, the system generates a set of test cases and an implementation of the data type from the specifications. The generated implementation is such that if the specifications are not complete, the implementation is not complete, and the behavior of all of the sequences of valid operatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of mutual exclusion solutions based on binary semaphores

    Publication Year: 1989, Page(s):560 - 568
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    A graphical form of the mutual exclusion problem is considered in which each vertex represents a process and each edge represents a mutual exclusion constraint between the critical sections of the processes associated with its endpoints. An edge semaphore solution for mutual exclusion problems is defined, and those graphs which are edge solvable are characterized in terms of both a forbidden subgr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visual language compiler

    Publication Year: 1989, Page(s):506 - 525
    Cited by:  Papers (49)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1944 KB)

    The SIL-ICON compiler is a software system for the specification, interpretation, prototyping, and generation of icon-oriented systems. The system design of the SIL-ICON compiler is presented. The icon system G, the icon dictionary ID, the operator dictionary OD, and the extended task action grammar ETAG are described. An application example to design a text editor using the Heidelberg icon set is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simplification of a conversation design scheme using Petri nets

    Publication Year: 1989, Page(s):658 - 660
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    In the conversation design procedure, the definition of the state of the system is one of the most important aspects. The question is how to identify transitions in Occam programs in order to express them as Petri nets. In the paper, a simplified transition identification method is proposed. Using the robot arm control program of A.M. Tyrrell and D.J. Holding it is shown that the correspondent Pet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experimental investigation of software metrics and their relationship to software development effort

    Publication Year: 1989, Page(s):649 - 653
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    The results are reported of an experimental study of software metrics for a fairly large software system used in a real-time application. A number of issues are examined, including the mutual relationship between various software metrics and, more importantly, the relationship between metrics and the development effort. Some interesting connections are reported between metrics and the software dev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving quicksort performance with a codeword data structure

    Publication Year: 1989, Page(s):622 - 631
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    The problem is discussed of how the use of a new data structure, the codeword structure, can help improve the performance of quicksort when the records to be sorted are long and the keys are alphanumeric sequences of bytes. The codeword is a compact representation of a key with respect to some codeword generator. It consists of a byte for a character count of equal bytes, a byte for the first none... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mathematical principles for a first course in software engineering

    Publication Year: 1989, Page(s):550 - 559
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    An introductory computer science course is developed, much as calculus is a basic course for mathematics and the physical sciences, concerned primarily with theoretical foundations and methodology rather than apprenticeship through applications. In this work, the principles taught in the course are described and an example illustrating them is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analytic/empirical study of distributed sorting on a local area network

    Publication Year: 1989, Page(s):575 - 586
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1232 KB)

    A model for distributed sorting on a local area network (LAN) is presented. This model, contrary to the conventional model, takes into account both local processing time and communication time. This model is intended to provide a framework within which the performances of various distributed sorting algorithms are analyzed and implemented on Ethernet-connected Sun workstations. The empirical resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authentication mechanisms in microprocessor-based local area networks

    Publication Year: 1989, Page(s):654 - 658
    Cited by:  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    The problem of authenticating the users of a computer network in order to protect the shared resources against unauthorized use is discussed. Since intruders could enter the network and try to use services they have no right to access, the host implementing the service (or server) has to check the user's identity and access rights by searching in the relevant database. The author presents a method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The computational completeness of extended database query languages

    Publication Year: 1989, Page(s):632 - 638
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    The computational completeness is demonstrated of certain extended database query languages, namely, POSTGRES and GENESIS, and a language defined by A. Aho and J. Ullman (1979). The method used is to implement a Turing machine interpreter in each of the languages. These query languages were defined as extensions to traditional database languages in order to encompass certain specific new applicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Molecule: a language construct for layered development of parallel programs

    Publication Year: 1989, Page(s):587 - 599
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    A new language construct, called molecule, is described for the efficient implementation of algorithms on parallel computers. A molecule can be considered a procedure associated with a molecule type. Each molecule type characterizes a particular computation mode (sequential, pipelining, array processing, dataflow, multiprocessing, etc.). Basic concepts of molecule are introduced with a procedural ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient distributed protocol for finding shortest paths in networks with negative weights

    Publication Year: 1989, Page(s):639 - 644
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The design is discussed of distributed algorithms for the single-source shortest-path problem to run on an asynchronous directed network in which some of the edges may be associated with negative weights, and thus in which a cycle of negative total weight may also exist. The only existing solution in the literature for this problem is due to K.M. Chandy and J. Misra (1982), and it has, in the wors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical operations on a relational database

    Publication Year: 1989, Page(s):600 - 610
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The problem is discussed of defining numerical operations on a relational database to accommodate the statistical analyses associated with a bivariate frequency table. An attempt has been made to extend Codd's relational algebra to include simple bivariate statistical operations preserving the closure of Codd's algebra. This extended algebra is applied to bivariate relational data structures neede... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient distributed knot detection algorithm

    Publication Year: 1989, Page(s):644 - 649
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    A distributed knot detection algorithm for general graphs is presented. The knot detection algorithm uses at most O(n log n+m) messages and O(m+n log n) bits of memory to detect all knots' nodes in the network (where n is the number of nodes and m is the number of links). This is compared to O(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal methods applied to a floating-point number system

    Publication Year: 1989, Page(s):611 - 621
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A formalization of the IEEE standard for binary floating-point arithmetic (ANSI/IEEE Std. 754-1985) is presented in the set-theoretic specification language Z. The formal specification is refined into four sequential components, which unpack the operands, perform the arithmetic, and pack and round the result. This refinement follows proven rules and so demonstrates a mathematically rigorous method... 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