Proceedings., Fourteenth Annual International Computer Software and Applications Conference

Oct. 31 1990-Nov. 2 1990

Filter Results

Displaying Results 1 - 25 of 114
  • The software engineering of extensible database systems

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (28 KB)

    Summary form only given. Extensible DBMS (database management system) technology is aimed at simplifying the customization of DBMSs for specialized applications. Customization may involve the introduction of new data types and operators, support for new data languages and data models, new storage structures, and new relational operators. It is pointed out that to achieve these ambitious goals, an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software productivity metrics-new initiatives in making it work (panel)

    Publication Year: 1990, Page(s):253 - 254
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (98 KB)

    The software productivity activities in The IEEE Computer Society, the Software Productivity Consortium, and the Software Engineering Institute are addressed. Particular emphasis is placed on the metrics work of the Software Productivity Consortium, which includes the development of definitions of quantifiable aspects of the process and the products it generates and the establishment of means to o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings. Fourteenth Annual International Computer Software and Applications Conference (Cat. No.90CH2923-1)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (136 KB)
    Freely Available from IEEE
  • Panel: transferring object-oriented technology into a corporation

    Publication Year: 1990, Page(s):647 - 651
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    A panel session is reported in which issues related to organizing and accelerating the transfer of object-oriented technology into the development organizations of large corporations are addressed. Particular attention is given to an N-party interaction model for technology transfer from a research consortium to industry and to object-oriented curriculum development at Hewlett-Packard View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Petri net-based distributed debugger

    Publication Year: 1990, Page(s):639 - 646
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    A distributed debugger based on the Petri net model is designed and implemented. The major functions supported are distributed breakpoints, step-by-step execution, and replay. The debugger consists of a preprocessor which inserts control functions into the source code, and a parser which generates a Petri net model of the distributed program for graphical monitoring and program simulation. The deb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A set and mapping-based detection and solution method for structure clash between program input and output data

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

    Structure clash is one of the main concerns in JSP (Jackson Structured Programming). Structure clash is a program implementation issue rather than a program specification issue. Furthermore, structure clash must be accurately detected and solved in order to produce an efficient program. Therefore, there is a very important non-procedural language class in which a programmer need not think about th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling execution time of multi-stage N-version fault-tolerant software

    Publication Year: 1990, Page(s):505 - 511
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    The timing performance of N-version multi-stage software is analyzed for a strategy called expedient voting. In expedient voting the voting takes place as soon as an adequate number of components have finished the stage. The concept of a `runahead' is introduced: the faster versions are allowed to run ahead of the rest of the slower versions by one or more stages, with synchronized re-sta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An inversion capability for the PRESTIGE workbench: some basic issues

    Publication Year: 1990, Page(s):623 - 628
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The PRESTIGE workbench is an integrated CASE (computer-aided software environment) intended to provide full implementation support for Jackson System Development (JSD). JSD is an operational software development method, and thus implementation in JSD is essentially a transformational process. The main objective is to offer a generalized transformational facility that the JSD implementor can apply ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration-a multi-faceted challenge [hospital systems]

    Publication Year: 1990, Page(s):501 - 502
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    It is pointed out that many hospitals are faced with the challenge of integrating application systems that have been installed in recent years. However, it takes more than just a single solution to meet the requirements of an integrated system environment. Several levels of integration effort are required: network, workstation, system, application, and data. It is noted that, in most cases, the ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture and functionality of a specification environment for distributed software

    Publication Year: 1990, Page(s):617 - 622
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    A description is given of Graspin, a workstation-based prototype environment that aids in the incremental construction, verification, and prototyping of specifications for concurrent and distributed software systems. It includes a Petri net-based specification formalism, an editor generator with graphical capabilities, and tools for static semantics checking, automated verification of static and d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Major technical issues in medical informatics computer technology systems and applications

    Publication Year: 1990, Page(s):498 - 499
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Technical issues in medical informatics are addressed, with emphasis on tools for medical practitioners to willingly and effectively use computers to capture data and to access information; the conversion of paper records to electronic data to facilitate automation; and system and application integration based on patient medical documents and information. It is pointed out that the computer and co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Industrial experience in automating software re-engineering

    Publication Year: 1990, Page(s):611 - 616
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    The special problems of software re-engineering and technologies and approaches that specifically address these re-engineering problems are considered. Particular attention is given to approaches for analyzing and abstracting the functionality of old code, converting software to work with new languages or dialects, translating large systems, defining appropriate roles for the user of highly automa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A methodology for formal specification and implementation of Ada packages

    Publication Year: 1990, Page(s):491 - 496
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    The authors present a methodology for formal specification and prototype implementation of Ada packages using the Anna specification language. Given the formal specification of a package resulting from the methodology for package specifications, the methodology allows implementors of packages to follow a few simple steps to implement the package. The implementation is meant to be a prototype. This... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MCFS: a multiple criteria reasoning fuzzy expert systems building tool

    Publication Year: 1990, Page(s):605 - 610
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The authors present the design principles of MCFS, an expert system building tool based on the idea of combining multiple criteria reasoning with the concepts of fuzzy logic. An important feature of MCFS is its ability to handle multiple criteria reasoning by structuring the deduction process into a hierarchy of logical levels. Within each level, the rules are organized into sets of rules and rule... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling linear recursive Prolog programs with list structure into procedural language

    Publication Year: 1990, Page(s):391 - 398
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The authors present an algorithm for transforming a linear recursive program in Prolog which contains the list data structure as a term of the predicate into an iterative program using a while loop in a procedural language like Pascal. This algorithm obtains the same result as Prolog without unification and backtracking. In this algorithm, the recursive programs are classified into two cases, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bi-level object-oriented data model for GIS applications

    Publication Year: 1990, Page(s):238 - 244
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A bi-level object-oriented data model together with a user query language called OFQL is designed which can support applications like GIS (geographic information systems). The data model is divided into two layers, the higher-level data model and the lower-level data model. The higher-level data model or the geographic object data model primarily consists of the geographic objects and a set of sem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forms interfaces and their view supportability properties

    Publication Year: 1990, Page(s):448 - 452
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The authors propose a multi-level and multi-degree form interface which can effectively overcome the ambiguity problems existing in current form interfaces. They also describe a theoretical framework which enables a system to assist designers in the construction of forms. The concept of hierarchical relational views is presented as a conceptual basis for the discussion of updatability in the form ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FOREST: a systematic testing environment based on standardized formal description techniques

    Publication Year: 1990, Page(s):483 - 490
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The testing environment FOREST (formal environment for systematic testing), which uses formal description techniques systematically, has been developed. FOREST generates the TTCN format test sequence from the specification described in SDL. Furthermore, FOREST generates the test data from the protocol data definition described in ASN.1. By using the FOREST system, the test specification and test e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent query mechanism for expert systems

    Publication Year: 1990, Page(s):599 - 604
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    The authors describe a set of query techniques which helps to improve the efficiency of the query mechanism of expert systems. They discuss a number of algorithms and formulae for identifying a key feature set and deriving an ideal query sequence. The proposed algorithms aim to cut down the consultation time so as to increase the efficiency of the expert system. The query mechanism can be further ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear versus linear recursion: a perspective from computing transitive closures of a binary relation by the join domain nested loops approach

    Publication Year: 1990, Page(s):382 - 390
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The author considers a more general class of transitive closure of a binary relation by relaxing the linear variable binding of the original transitive closure. A syntactical (i.e. grammatical) approach is used to analyze the properties of this class of recursive rules. The existing directed algorithms for computing the (standard) transitive closure of a binary relation actually compute a nonlinea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graphical interface for an object-oriented query language

    Publication Year: 1990, Page(s):231 - 237
    Cited by:  Papers (1)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A graphical user interface for an object-oriented query language, GOQL, is presented, GOQL is a part of a prototype knowledge base management system which is based on an object-oriented semantic association model, OSAM. GOQL consists of a graphical browser and a graphical querying module. The browser allows a user to browse through a complex knowledge-base schema graphically and prune it into a de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient model of dynamic task scheduling for distributed systems

    Publication Year: 1990, Page(s):442 - 447
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The authors propose a distributed task scheduling model using a simple processor architecture and a heuristic scheduling algorithm based on small message exchanges between nearest neighbors. An extensive simulation study was used to analyze the proposed model by taking into account a wide range of practical issues. Comparison with other schemes reported in the literature reveals the superiority of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool specification language for software maintenance

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

    A modified attribute-grammar language, to be used for specifying tools in a software maintenance environment, is proposed. This language is called Tool Specification Language (TSL). TSL allows an orderly sharing of specifications between different tools. It also allows the sharing of computed attribute values between different tools. For a suite of related tools that would support the maintenance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundancy detection in logic programs is undecidable

    Publication Year: 1990, Page(s):593 - 598
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The authors study the decidability of redundancy detection in logic programs which are composed of inference rules with functions in their arguments. They formally define redundancies based on the solution sets in logic programs, and represent solution sets in well-defined domains. They prove that redundancy detection in inference rules with functions is undecidable. The theoretical results obtain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benchmarking two types of restricted transitive closure algorithms

    Publication Year: 1990, Page(s):375 - 381
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    The authors present and evaluate two algorithms-one linear and one logarithmic-for the computation of the restricted transitive closure of a binary database relation. The algorithms are implemented in a relational database management system (Ingres), and on equipment which is fairly common in today's database application environments. The performance evaluation reveals three important points. Firs... View full abstract»

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