By Topic

Software Engineering, IEEE Transactions on

Issue 5 • Date May 1986

Filter Results

Displaying Results 1 - 9 of 9
  • Editorial

    Page(s): 589
    Save to Project icon | Request Permissions | PDF file iconPDF (147 KB)  
    Freely Available from IEEE
  • The automatic inversion of attribute grammars

    Page(s): 590 - 599
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2238 KB)  

    Attribute grammars constitute a formal mechanism for specifying translations between languages; from a formal description of the translation, a translator can be automatically constructed. This process is taken one step further; given an attribute grammar specifying the translation from language L1 to language L2, the question of whether the inverse attribute grammar specifying the inverse translation from L2 to L1 can be automatically generated is addressed. It is shown how to solve this problem for a restricted subset of attribute grammars. This inversion process allows compatible two-way translators to be generated from a single description. To show the practical feasibility of attribute grammar inversion, experience in inverting an attribute grammar used as an interface for a formal database accessing language, SQL, is related. The attributed grammar is used to paraphrase SQL database queries in English. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient decentralized consensus protocols

    Page(s): 600 - 607
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1856 KB)  

    Decentralized consensus protocols are characterized by successive rounds of message interchanges. Protocols which achieve a consensus in one round of message interchange require O(N2) messages, where N is the number of participants. A communication scheme based on finite projective planes is presented which requires only O(NN) messages for each round. Using this communication scheme, decentralized consensus protocols which achieve a consensus within two rounds of message interchange are developed. The protocols are symmetric, and the communication scheme does not impose any hierarchical structure. The scheme is illustrated using blocking and nonblocking commit protocols, decentralized extrema finding, and computation of the sum function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cloze procedure and software comprehensibility measurement

    Page(s): 608 - 623
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3474 KB)  

    Cloze tests (i.e. fill-in-missing-parts tests) have been a long-standing measure of prose comprehension. Through human-subject experimentation, evidence was gathered to support the practical advantages of using the cloze procedure for measuring software comprehension. Cloze tests were found to be easy to construct, administer, and score and to be capable of discriminating between programs of varying comprehensibility. However, discrepancies between multiple-choice comprehension quiz results and some cloze test results for the same software suggested that certain forms of software cloze tests may not be valid. A model of software cloze tests was developed to identify a software cloze test characteristic that may produce invalid results. The test characteristic was concerned with the relative proportion of `program-dependent' and `program-independent' cloze items within a test. The developed model was shown to be consistent with software cloze test results of another researcher and led to suggestions for improving software cloze testing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ARES: A relational database with the capability of performing flexible interpretation of queries

    Page(s): 624 - 634
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (5538 KB)  

    In ARES, relational operations have been functionally augmented with an additional comparison operator. This operator implies `approximately equal to' or `similar to' for cases in which the user expects the system to perform a flexible interpretation of the query conditions. The functional augmentation is simply achieved by a combination of conventional relational operations. ARES is now in actual operation in a research environment, and will contribute to the next step of research toward implementation of highly intelligent data processing facilities beyond the present scope of database technology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privilege transfer and revocation in a port-based system

    Page(s): 635 - 648
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3636 KB)  

    Gutenberg is a port-based operating system being designed to study protection issues in distributed systems. All shared resources are viewed as protected objects and hence can be assessed only via specific operations defined on them. Processes communicate and access objects through the use of ports. Each port is associated with an abstract data type operation and can be created by a process only if the process has the capability to execute the operation on the type. Thus, a port represents the privilege of the port's client process to request a service. Capabilities to create ports for requesting operations are contained in a capability directory, which is navigated by processes to gain these capabilities. Privilege transfer is a means of providing servers access to the resources they need to perform their services. In Gutenberg, privilege transfer is accomplished by allowing access to subdirectories of the capability directory and by passing capabilities, including port access capabilities, to processes via ports. It should be possible to revoke transferred privileges when breaches of trust are detected or suspected, when a period of time has passed beyond which the distributor of a privilege does not want the privilege shared, or when an error has been detected. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct implementation of abstract data types from abstract specifications

    Page(s): 649 - 661
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2549 KB)  

    The development of correct specifications is a critical task in the software development process. An alternative approach for the development of specifications is described. The approach relies on a specification language for abstract data types and synthesis system. The system is capable of translating in abstract data type specification into an executable program. This process defines an alternative methodology that provides the necessary tools for the early testing of the specifications and for the development of prototypes and implementation models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive load sharing in homogeneous distributed systems

    Page(s): 662 - 675
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (669 KB)  

    Rather than proposing a specific load sharing policy for implementation, the authors address the more fundamental question of the appropriate level of complexity for load sharing policies. It is shown that extremely simple adaptive load sharing policies, which collect very small amounts of system state information and which use this information in very simple ways, yield dramatic performance improvements. These policies in fact yield performance close to that expected from more complex policies whose viability is questionable. It is concluded that simple policies offer the greatest promise in practice, because of their combination of nearly optimal performance and inherent stability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for papers

    Page(s): 676
    Save to Project icon | Request Permissions | PDF file iconPDF (40 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
tseeicdwyer@computer.org