By Topic

IEEE Transactions on Software Engineering

Issue 9 • Date Sept. 1988

Filter Results

Displaying Results 1 - 14 of 14
  • A study of the applicability of complexity measures

    Publication Year: 1988, Page(s):1366 - 1372
    Cited by:  Papers (45)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (881 KB)

    A study of the predictive value of a variety of syntax-based problem complexity measures is reported. Experimentation with variants of chunk-oriented measures showed that one should judiciously select measurable software attributes as proper indicators of what one wishes to predict, rather than hoping for a single, all-purpose complexity measure. The authors have shown that it is possible for part... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User validation of information system requirements: some empirical results

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

    While validation of user requirements has become an important goal for information system designers, little empirical research has been done in this area. Many methodologies have been presented as the best procedures for achieving user validation of design. An attempt is made to consider four of these methodologies in four different experimental settings. In the four experiments, the following tre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to 'Protocol conversion'

    Publication Year: 1988
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (55 KB)

    In previously giving a summary of the theory of protocol projection (ibid., vol.14, no.3, p.353-62, Mar. 1988), an incorrect statement was made. A given statement is claimed to be false, and is corrected accordingly.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trace-driven simulation study of dynamic load balancing

    Publication Year: 1988, Page(s):1327 - 1341
    Cited by:  Papers (154)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    A trace-driven simulation study of dynamic load balancing in homogeneous distributed systems supporting broadcasting is presented. Information about job CPU and input/output (I/O) demands collected from production systems is used as input to a simulation model that includes a representative CPU scheduling policy and considers the message exchange and job transfer cost explicitly. Seven load-balanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing join queries in distributed databases

    Publication Year: 1988, Page(s):1319 - 1326
    Cited by:  Papers (31)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A reduced cover set of the set of full reducer semijoin programs for an acyclic query graph for a distributed database system is given. An algorithm is presented that determines the minimum cost full reducer program. The computational complexity of finding the optimal full reducer for a single relation is of the same order as that of finding the optimal full reducer for all relations. The optimiza... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating software complexity measures

    Publication Year: 1988, Page(s):1357 - 1365
    Cited by:  Papers (279)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    A set of properties of syntactic software complexity measures is proposed to serve as a basis for the evaluation of such measures. Four known complexity measures are evaluated and compared using these criteria. This formalized evaluation clarifies the strengths and weaknesses of the examined complexity measures, which include the statement count, cyclomatic number, effort measure, and data flow co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic transaction routing in distributed database systems

    Publication Year: 1988, Page(s):1307 - 1318
    Cited by:  Papers (13)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    The authors investigate dynamic transaction routing strategies for locally distributed database systems in which the database is partitioned and distributed among multiple transaction-processing systems, and the incoming transactions are routed by a common front-end processor. If a transaction issues a database request referencing a nonlocal database partition, the request has to be shipped to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program readability: procedures versus comments

    Publication Year: 1988, Page(s):1271 - 1279
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    A 3×2 factorial experiment was performed to compare the effects of procedure format (none, internal, or external) with those of comments (absent or present) on the readability of a PL/1 program. The readability of six editions of the program, each having a different combination of these factors, was inferred from the accuracy with which students could answer questions about the program after... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trace specifications: methodology and models

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

    The authors summarize the trace specification language and present the trace specification methodology: a set of heuristics designed to make the reading and writing of complex specifications manageable. Also described is a technique for constructing formal, executable models from specifications written using the methodology. These models are useful as proof of specification consistency and as exec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient branch-and-bound algorithms on a two-level memory system

    Publication Year: 1988, Page(s):1342 - 1356
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB)

    Branch-and-bound algorithms in a system with a two-level memory hierarchy were evaluated. An efficient implementation depends on the disparities in the numbers of subproblems expanded between the depth-first and best-first searches as well as the relative speeds of the main and secondary memories. A best-first search should be used when it expands a much smaller number of subproblems than that of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functional development of database applications

    Publication Year: 1988, Page(s):1280 - 1292
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    A highly modular and uniformly functional development methodology for database applications is introduced. An event-oriented view of the database is adopted recording the observed events directly and treating the state of the environment as derived data. The relationship between the observed events and the derived state of the system is expressed using a purely functional language. The application... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PELAS-program error-locating assistant system

    Publication Year: 1988, Page(s):1253 - 1260
    Cited by:  Papers (39)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Error localization in program debugging is the process of identifying program statements which cause incorrect behavior. A prototype of the error localization assistant system which guides a programmer during debugging of Pascal programs is described. The system is interactive: it queries the programmer for the correctness of the program behavior and uses answers to focus the programmer's attentio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automatic physical designer for network model databases

    Publication Year: 1988, Page(s):1293 - 1306
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1280 KB)

    Systems EROS is a physical design tool for CODASYL database systems which covers a large spectrum of decision variables, notably location mode, set implementation, set order, and search keys. System EROS is based on a model where the CODASYL physical database design problem is formulated as an extension of the index selection problem in the relational database environment. Optimization algorithms ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of several software defect models

    Publication Year: 1988, Page(s):1261 - 1270
    Cited by:  Papers (34)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Results are presented of an analysis of several defect models using data collected from two large commercial projects. Traditional models typically use either program matrices (i.e. measurements from software products) or testing time or combinations of these as independent variables. The limitations of such models have been well-documented. The models considered use the number of defects detected... 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