By Topic

System Sciences, 1988. Vol.II. Software Track, Proceedings of the Twenty-First Annual Hawaii International Conference on

Date 5-8 Jan. 1988

Filter Results

Displaying Results 1 - 25 of 88
  • Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Vol.II. Software Track (Cat. No.88TH0212-1)

    Publication Year: 1988
    Save to Project icon | Request Permissions | PDF file iconPDF (378 KB)  
    Freely Available from IEEE
  • Programming environments for reusability

    Publication Year: 1988 , Page(s): 1 - 10
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (802 KB)  

    The standard techniques for the obstacles to software reuse are reviewed, and some emerging techniques that may makes a larger fraction of system software reusable are discussed. The main characteristics of five categories of programming environments are briefly examined. The categories are: structure-oriented environments, language environments, toolkit environments, software development methodol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated conceptual schema restructuring

    Publication Year: 1988 , Page(s): 12 - 20
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (533 KB)  

    The development of a conceptual model in database design is considered. An approach is described that borrows the AI (artificial intelligence) technique of plan generation to build a computer aid for conceptual schema restructuring in the context of view integration. Also investigated are the use of heuristic search strategies and problem simplification techniques for improving the efficiency of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and synthesis of abstract data types through generalization from examples

    Publication Year: 1988 , Page(s): 21 - 29
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (588 KB)  

    The discovery of general patterns of behavior from a set of input/output examples can be a useful technique in the automated analysis and synthesis of software systems. These generalized descriptions of the behavior form a set of assertions that can be used for validation, program synthesis, program testing, and run-time monitoring. Describing the behavior is characterized as a learning process in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of uniform semantic constraints in defining model-based editing operations

    Publication Year: 1988 , Page(s): 30 - 39
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (572 KB)  

    Problems arising from editing specifications at the level of desired behaviors (model-based editing) are addressed. Such editing operations can be designed on the basis of frequent patterns of desired behavior changes, and formalized semantic constraints can be utilized to guide the modifications to specifications. Consequently, the editing can be partially automated, and the changes can more like... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating explanations from program code: two new approaches

    Publication Year: 1988 , Page(s): 40 - 47
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (486 KB)  

    A central issue in help and documentation systems is the task of gaining the information needed for that purpose. Two approaches are provided for generating explanations from the representation that is used for running a program. One of them introduces a novel representation for editor operations that can be used for executing and explaining operations, for searching operations, and for active hel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The software engineering of systems with expert components

    Publication Year: 1988 , Page(s): 48 - 53
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (522 KB)  

    Integrating expert system components into production software can be difficult because expert system development environments are typically incompatible with traditional software engineering technology. In an effort to deal with this problem, the authors are developing CEST, a C expert system toolset. CEST is a library of inference engines implemented as C functions callable from C programs, and a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of a knowledge-based programming environment

    Publication Year: 1988 , Page(s): 54 - 63
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (743 KB)  

    MARVEL is a knowledge-based programming environment that assists its users during the implementation, testing, and maintenance phases of software projects. Solutions to the pragmatic problems of MARVELs implementation are discussed. MARVELs knowledge is supplied as strategies, where each strategy consists of classes that define the structure of objects, relations that define the semantic interconn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A planner for the automation of programming environment tasks

    Publication Year: 1988 , Page(s): 64 - 72
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (680 KB)  

    The authors have developed an approach that significantly reduces the time to develop heterogeneous parallel systems. Current, state-of-the-art environments provide most of the necessary tools but leave to the user the task of coordinating the invocation of the tools. They describe a tool, implemented in the Unix environment, that transforms a set of goals and constraints specified by a user into ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shadow: a system for capturing software design information in a browsable form

    Publication Year: 1988 , Page(s): 72 - 82
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (695 KB)  

    A description is given of Shadow, a tool for obtaining, recording, and graphically presenting system design information for systems that are developed incrementally. Shadow addresses the task of aiding a programmer's understanding of complex systems for the purpose of performing system enhancements. The central concept of Shadow is that system models integrated with system development tools can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge based configuration management

    Publication Year: 1988 , Page(s): 83 - 92
    Cited by:  Papers (2)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (655 KB)  

    Advanced configuration management systems require explicit representations of various kinds of knowledge. Besides the classical requirements of keeping track of which component versions have been used to build a system, the knowledge that has led to the selection of these versions and the knowledge of compatibility rules between versions are essential to perform many configuration management funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Developing multitasking applications programs

    Publication Year: 1988 , Page(s): 94 - 102
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (635 KB)  

    The current state-of-the-art tools for developing numerical/scientific multitasking applications programs are examined. An integrated toolkit is proposed that is necessary before reliable multitasking applications can be effectively developed. A prototype of the proposed toolkit is being developed on the basis of a static-analysis tool that has been developed by the authors.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared memory multiprocessors and sequential programming languages: a case study

    Publication Year: 1988 , Page(s): 103 - 108
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (603 KB)  

    The Chrysalis operating system for the BBN Butterfly parallel processor provides a flexible, object-oriented, shared-memory environment for parallel programming. C++ is a safe, sequential, object-oriented programming language. The pairing of these environments is seen potentially as a natural fit. The development of Chrysalis++, and interface between C++ and Chrysalis, indicates that subtle assump... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical support for parallel programming

    Publication Year: 1988 , Page(s): 109 - 118
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (782 KB)  

    An approach is considered in which programs written within a higher-level parallel model are automatically transformed for execution on a particular (parallel) processor. It is based on an improved version of large-grain data-flow (LGDF) techniques. The model is described, along with a scheduler implementation strategy for shared-memory multiprocessors. Performance measurements of a specific imple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grain determination for parallel processing systems

    Publication Year: 1988 , Page(s): 119 - 128
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (594 KB)  

    A method of parallel-program optimization called grain packing is introduced that reduces total execution time of a parallel program by balancing execution time and communication time. The new method is applicable to both extended serial and concurrent programming languages, and can be used in languages such as OCCAM, Fortran, and Pascal. It is shown by example that two misconceptions common among... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying Ada tasking using patterns of behavior

    Publication Year: 1988 , Page(s): 129 - 134
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (479 KB)  

    TLS-1 is a language for specifying sequences of tasking events occurring in the execution of concurrent Ada programs. Such specifications are intended primarily for testing and debugging of Ada tasking programs. They can also be applied in the design of programs. TSL-1 specifications are included in Ada programs as formal comments. They express constraints to be satisfied by the sequences of actua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applicative parallelism on a shared memory multiprocessor

    Publication Year: 1988 , Page(s): 135 - 144
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (588 KB)  

    The authors discuss how software for applicative language programs can automatically detect and exploit parallelism to take advantage of current and future parallel processing systems. They use an applicative language, SISAL, to show the sources of parallelism. A prototype SISAL system is available to execute some sample programs and help examine how well the implementation uses potential parallel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed Prolog system with AND-parallelism

    Publication Year: 1988 , Page(s): 145 - 154
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (796 KB)  

    A description is given of the design and implementation of a distributed version of a Prolog interpreter running on a network of Sun workstations. The system easily takes advantage of AND-parallelism using fork and join primitives implemented by message passing. The design decisions and tradeoffs are explained in detail. The design is simple and yet powerful enough to achieve practical speedups on... View full abstract»

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

    Publication Year: 1988 , Page(s): 155 - 165
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (671 KB)  

    The use of continuations in the BBN Butterfly Lisp multiprocessor is examined. In Butterfly Lisp, continuations are first class objects, much like vectors or numbers, and are used to implement its parallel computing extensions. Continuations can also be used as a way of modeling parallelism in general. While they may be encoded, certain information remains invariant even as the model of parallelis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global events and global breakpoints in distributed systems

    Publication Year: 1988 , Page(s): 166 - 175
    Cited by:  Papers (19)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (806 KB)  

    A solution to the problem of setting breakpoints in distributed systems is described. It is shown what kind of breakpoints are possible, how to detect those breakpoints, and how to halt the system in a consistent state. The communication among the processes may be asynchronous with an arbitrary ordering of messages. The algorithms select between simultaneous events and those ordered according to L... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communications in the Mercury system

    Publication Year: 1988 , Page(s): 178 - 187
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (740 KB)  

    A high-level communication mechanism that combined blocking and nonblocking calls in a clean and uniform way is proposed. The mechanism allows a server to provide a uniform interface based on remote calls; a client can optimize its use of the server of low latency or high throughput. When it is optimized for low latency, the mechanism is competitive with other remote-procedure-call mechanisms. Whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured message passing on a shared-memory multiprocessor

    Publication Year: 1988 , Page(s): 188 - 194
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (657 KB)  

    A shared-memory multiprocessor can efficiently support many different programming paradigms. In particular, shared-memory multiprocessors need not be programmed using the shared-memory model. SMP is a structured message-passing software library developed for the BBN Butterfly parallel processor that provides an alternative to the shared-memory model of the BBN uniform system package, SMP supports ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general approach to solving arbitrarily large problems in a fixed size systolic array

    Publication Year: 1988 , Page(s): 195 - 204
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (532 KB)  

    Solving large problems in a small systolic array is considered difficult because the data arrays that pipeline through the array have to meet at the right place at the right time. Thus, partitioning and scheduling of data arrays for systolic computation is generally performed ad hoc. A general partitioning and scheduling method for solving large problems in a small systolic array is presented. Giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Commutativity-based concurrency control for abstract data types

    Publication Year: 1988 , Page(s): 205 - 214
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (843 KB)  

    Two novel concurrency control algorithms for abstract data types are presented. The algorithms ensure serializability of transactions by using conflict relations based on the commutativity of operations. It is proved that both algorithms ensure a local atomicity property called dynamic atomicity. This means that the algorithms can be used in combination with any other algorithms that also ensure d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recoverable object store

    Publication Year: 1988 , Page(s): 215 - 221
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (498 KB)  

    A design is presented for the storage component of a self-recovering distributed operating system. This component consists of an object manager, which maintains objects on main memory and on the disk, and a recovery layer, which incorporates a collection of highly optimized algorithms based on optimistic recovery. With optimistic recovery it is possible for a machine (or collection of machines) to... View full abstract»

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