Consistent specification of interface suites in UML

The paper motivates and describes a model oriented approach for consistent specification of interface suites in UML. An interface suite is a coherent collection of interfaces defining interactions that transcend component boundaries. The specification of interface suites contains diagrammatic views and documentation, but it is extended with templates for structured specifications deriving from the ISpec approach. To guarantee that the specification views, documentation and templates are consistent, a specification model has been constructed. The model contains both structural and behavioural information, represented in the form of sequences of carefully designed tuples. The model provides the underlying structure for the tool supporting the design process. The tool directs the designer to specify all elements of the model in a consistent way. The specification is collected both by customized specification templates and by diagrams. The documentation and the diagram elements – both derived from the template information – are automatically generated. This prevents errors and provides specification consistency. Initial submission: 15 February 2002 / Revised submission: 20 September 2002 Published online: 2 December 2002 RID="*" ID="*"Supported by PROGRESS grant EES.5141 and ITEA DESS grant IT990211.     

Field analysis: A mathematical method of analysis for information handling processes

A general method of analysis, mathematical in nature, is proposed for the abstract study of information handling processes. The method is based on an extension of the field concept as used in physical sciences, and makes no reference to data processing considerations. Thus, theory and practice are neatly separated so that each can progress on its own, helped but unhindered by the other. The paper details the method proposed and illustrates it with a preliminary analysis of information processing for selective mailings of periodicals. The analysis leads to a set of equations from which the values of all the derived information fields can be rigorously calculated. The discussion at the end of the paper helps to relate the present work to research relevant to the specification, documentation, design, and implementation of computer-aided information processing systems.The views expressed are those of the author and do not necessaril' represent those of the Ministry of State for Urban Affairs.Since this article was submitted, the author's name has been changed to S. H. Talbert.     

用于化学专利标引的族性结构模板的设计与实现

对药物专利中族性结构进行标引是将专利文本信息转换成结构信息用于族性结构的匹配检索。本文根据国家知识产权局知识产权出版社数据研发中心提出的新的图形化标引语言GFL对近千余篇药物专利进行了标引。结合GFL的特点,统计分析药物专利中出现频率很高的结构片断,将这些结构片断的标引结果利用面向对象编程技术设计成一系列的族性模板,便于标引人员直接调用,有利于实现标引工作的半自动化。     

GDDT—A graphical design and documentation tool for software development

This paper describes “The Graphical Design and Documentation Tool” (GDDT), a general purpose support system for design and documentation. Self documentation and ease of use are presented as important criteria for such tools. Interactive graphics is introduced as a methodology for creating and maintaining hierarchical representations. The graphical representations of various requirements specification techniques and design tools are supported by an extended network model which supports hierarchical decomposition of structures. GDDT is proposed as a general purpose design tool which supports the most common logical constructions of both requirements specification and design methodologies and yet has a high level human interface which makes it easy to learn and use.     

A pure embedding of attribute grammars

Attribute grammars are a powerful specification paradigm for many language processing tasks, particularly semantic analysis of programming languages. Recent attribute grammar systems use dynamic scheduling algorithms to evaluate attributes on demand. In this paper, we show how to remove the need for a generator, by embedding a dynamic approach in a modern, object-oriented and functional programming language. The result is a small, lightweight attribute grammar library that is part of our larger Kiama language processing library. Kiama’s attribute grammar library supports a range of advanced features including cached, uncached, higher order, parameterised and circular attributes. Forwarding is available to modularise higher order attributes and decorators abstract away from the details of attribute value propagation. Kiama also implements new techniques for dynamic extension and variation of attribute equations. We use the Scala programming language because of its support for domain-specific notations and emphasis on scalability. Unlike generators with specialised notation, Kiama attribute grammars use standard Scala notations such as pattern-matching functions for equations, traits and mixins for composition and implicit parameters for forwarding. A benchmarking exercise shows that our approach is practical for realistic language processing.     

Calculational derivation of a counter with bounded response time and bounded power dissipation

Summary A counter is calculationally designed by applying a functional way of programming, in which a machine is conceived as a function from states to behaviours. The design exploits the fine-grained concurrency available in VLSI. It is obtained by applying a series of correctness-preserving transformations on an initial design, which satisfies the functional specification but does not meet the cost/performance requirements. The transformations are purely calculational, i.e. they are based on a few simple axioms. The design is generic in that it describes counters with all possible periods. An attractive property of the design is that all these counters have the same response time as well as the same power dissipation. Joep Kessels is a senior scientist at Philips Research Laboratories. He was involved in projects on applicative programming, distributed processing and local area networks. Currently he is engaged in a project on designing asynchronous VLSI circuits. His main research interests are design methodology and distributed processing.     

Formal program construction by transformations-computer-aided,intuition-guided programming

Formal program construction by transformations is a method of software development in which a program is derived from a formal problem specification by manageable, controlled transformation steps which guarantee that the final product meets the initial specification. This methodology has been investigated in the Munich project CIP (computer-aided intuition-guided programming). The research includes the design of a wide-spectrum language specifically tailored to the needs of transformational programming, the construction of a transformation system to support the methodology, and the study of transformation rules and other methodological issues. Particular emphasis has been laid on developing a sound theoretical basis for the overall approach     

VMW: a visualization-based microarchitecture workbench

Superscalar processor design requires increasingly sophisticated software tools. The visualization-based microarchitecture workbench described in the paper addresses weaknesses common to most performance simulators: the lack of retargetability, visualization support, and interactive control. VMW provides a multifunction workbench for aiding designers of modern superscalar processors. It facilitates rigorous machine specification by providing specification templates at both the architecture and microarchitecture levels     

The use of Nassi-Shneiderman charts and supporting tools in software engineering education

In 1973 Nassi and Shneiderman proposed a new form of flowchart which was advocated as being better suited to the practices of structured programming. It is argued that Nassi-Shneiderman charts (N-S charts) provide a convenient common framework for the communication and practice of other widely accepted ideas concerning software development. They can for example be used to promote top-down design, structured implementation, thorough testing and graphical documentation. This paper relates experiences using N-S charts in a University educational environment and describes some tools which have been developed to support use of the charts.     

Object-oriented implementation issues in an experimental CAD system

This case study of object-oriented program design illustrates two limitations of object-oriented programming languages. Existing object-oriented languages do not have good facilities to support two key program design problems: the definition of composite objects, or data structures that include sets of related subobjects; and the specification and run-time management of temporary data structures required to implement efficient algorithms. Both composite objects and temporary data structures are important to the construction of a wide variety of programs. We use the design and implementation of an interactive computer-aided design system to describe how the limitations of present object-oriented languages complicate the design of composite objects and temporary data structures.     

Softing software engineering system

An integrated production system covering the phases specification, design, programming, documentation, test and integration—as well as project and configuration management is described. The system is built upon a unified development methodology supported by interactive tools. It encompasses a quality assurance procedure based on the automatic control of all intermediate products. It also provides a development database for project planning and control. The system is presently under development in Budapest, Hungary. Three of the planned seven subsystems are already operating in West Germany.     

A FORTRAN 90 genetic algorithm module for composite laminate structure design

The design of the stacking sequence for a composite laminate involves a set of discrete variables (plymaterial and ply orientation), and is thus well-suited to genetic algorithms for design optimization. Such algorithms have typically been custom-designed in FORTRAN 77 to suit specific optimization problems. Fortran 90 is a modern, powerful language with features that support important programming concepts, including those used in object-oriented programming. The Fortran 90 genetic algorithm module is used to define genetic data types, the functions which use these data types, and to provide a general framework for solving composite laminate structure design problems. The language's support of abstract data types is used to build genetic structures such as populations, subpopulations, individuals, chromosomes, and genes, and these data types are combined and manipulated by module subroutines. The use of abstract data types and long variable names makes the code useful and easily understood, while dynamic memory allocation makes the module flexible enough to be used in design problems of varying size and specification.     

The design,development, documentation and support of a major finite element system

The paper discusses various aspects of large general purpose finite element systems which may be of interest both to prospective developers and practising engineers. Although many of the points discussed apply to any field in which the method has been used, attention is concentrated on the static stress analysis problem.The paper considers in detail the initial design decisions concerning program structure, language, usage of available core storage, and methods of accessing backing store. The various facilities which may be of use in such a general system are listed and discussed. The problems which may arise as the development of a system proceeds are considered in three phases; specification, programming and testing.The types of documentation relevant to large engineering systems are described and the importance of an efficient and well organised client support and updating procedure is stressed.     

Animation Using Temporal Constraints: An Overview of the Animus System

Algorithm animation has a growing role in computer-aided algorithm design, documentation, and debugging, because interactive graphics is a richer channel than text for communication. Most animation is currently done laboriously by hand, and it often has the character of canned demonstrations with restricted user interaction. Animus is a system that allows for easy construction of an animation with minimal concern for lower-level graphics programming. Constraints are used to describe the appearance and structure of a picture as well as how those pictures evolve in time. The implementation and support of temporal constraints are substantive extensions to previous constraint languages that had only allowed for the specification of a static state. Use of the Animus system is demonstrated in the creation of animations of dynamic mechanical and electrical circuit simulations, sorting algorithms, problems in operating systems, and geometric curve drawing algorithms.     

Integrating library modules into Pascal programs

We present the results of our experience in introducing modularity into the programming language Pascal in order to aid the creation and use of library modules. Our system performs the symbolic linking of source language modules producing a single Pascal text ready for compilation; performing the link phase before compilation anticipates interface consistency checks, and suggests a possible improvement of program development systems. Our extension is implemented in a preprocessor which ensures a complete compatibility with any standard Pascal compiler. In this paper we examine the main features of some high-level programming languages which support modularization and data abstraction and some experiences in introducing modularity into Pascal; on this basis we describe our choice in detail. The design and implementation details are discussed and some examples are presented.