Deductive tools of an algebraic programming system

A mathematical environment is a system of tools supporting interactive manipulation of knowledge represented in the form of (formalized) mathematical texts. A theoretical substantiation of a project proposed is the theory of interaction of agents and environments. At the present time, this theory is realized on the basis of a simulator of an action language developed in an algebraic programming system called APS. Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 17–34, January–February, 2000.     

XT: A bundle of program transformation tools system description

XT bundles existing and newly developed program transformation libraries and tools into an open framework that supports component-based development of program transformations. We discuss the roles of XT's constituents in the development process of program transformation tools, as well as some experiences with building program transformation systems with XT.     

Portable tools for Fortran parallel programming

This paper presents a survey of some of the tools, techniques, and constructs for the development of portable, multitasked Fortran programs. The study mainly focuses on existing software tools that implement different approaches to achieving portability of multitasked Fortran programs for local and shared memory multiprocessor computers. However, some proposed approaches are also included. It appears that while each approach enjoys some advantages and suffers some disadvantages, at present, the development and use of portable multitasking tools is in its infancy, and thus no one system is clearly superior. Indeed, we expect that, for the foreseeable future, these and perhaps other techniques will all be actively pursued.     

Linear programming software tools on UNIX System

Linear programming(LP) is one of the most widely used Operations Research/Management Science/Industrial Engineering techniques. Recently, multiple criteria decision making or multiple objective linear programming has been well established as a practical approach to seeking satisfactory solutions to real-world decision problems.

In this paper we develop software tools for solving various linear programming problems such as a traditional LP problem, bicriteria LP problem, and multi-criteria LP problem on UNIX system. In a phase for reading data of various LP problems, we define a BNF(Backus-Nauel form) of various LP problems and implement BNF rules by using the C programming language.

In a phase for computing various LP problems, we use efficient methods for solving LP problems, develop various software tools on UNIX system, and combine each LP tool corresponding to an user request in which the Shell programming is used.

We also demonstrate some real-world LP problems by using LP software tools developed here on an UNIX System. Sanyo MPS 020.     

Information transformation by virus-evolutionary genetic programming

This paper deals with genetic programming (GP) for information translation. The GP can generate a structured computer program, but it is difficult to define recursive functions automatically. Therefore, we propose a virus-evolutionary genetic programming (VE-GP) composed of two populations; host and virus. Here, a virus plays the role of an automatically defined function. First, the VE-GP is applied to a function approximation problem, and the simulation result shows that the VE-GP can generate a function to approximate the given function with small errors. Next, the VE-GP is applied to the information transformation for a classification task, and the simulation result shows that the VE-GP can generate a function to classify a given data set. This work was presented in part at the Fourth International Symposium on Artificial Life and Robotics, Oita, Japan, January 19–22, 1999     

Object-oriented parallel programming tools for structural engineering applications

The principal objective of this work is to develop portable and extensible programming tools for the development of object-oriented parallel finite element codes for structural engineering applications. An object-oriented parallel portability interface for message-passing operations has been designed and implemented. An existing object-oriented matrix library is currently being extended to support the management of distributed matrix data and parallel solution of linear systems of algebraic equations. By taking advantage of C++ object-oriented programming, both the class libraries provide clean and consistent user interfaces, which not only help to improve the clarity and expressiveness of the client parallel codes, but also hide implementation details and complexity from the user to ease parallel programming tasks. In this paper, the object-oriented design and implementation of the class libraries are discussed. The libraries were first developed and tested using a network of Sun SPARC 10 workstations. Application examples were then studied on two commercial parallel computers: the IBM SP1 and the Intel Paragon XP/S 10, for evaluation of the portability and efficiency of the present class libraries.     

Dear editor [programming tools of the trade]

In this article, we give some advices for the programmers for an efficient software design. Programmers are advised not to type what they can automate in the editor environment and don't use the editor feature where they can code.     

Analysis and transformation in an interactive parallel programming tool

The ParaScope Editor is a new kind of interactive parallel programming tool for developing scientific Fortran programs. It assists the knowledgeable user by displaying the results of sophisticated program analyses and by providing editing and a set of powerful interactive transformations. After an edit or parallelism-enhancing transformation, the ParaScope Editor incrementally updates both the analyses and source quickly. This paper describes the underlying implementation of the ParaScope Editor, paying particular attention to the analysis and representation of dependence information and its reconstruction after changes to the program.     

Automated programming the next wave of developer power tools

Today's research on automated programming tools, a class of up-and-coming technologies that aim to make development faster, better, and less expensive boasts a wide range of ideas. Automated programming is making its way into the commercial software world slowly now, in small pieces. Microsoft and a host of other companies have much to gain from the production speedups that automated programming technologies could deliver.     

Graph and model transformation tools for model migration

We describe the results of the Transformation Tool Contest 2010 workshop, in which nine graph and model transformation tools were compared for specifying model migration. The model migration problem—migration of UML activity diagrams from version 1.4 to version 2.2—is non-trivial and practically relevant. The solutions have been compared with respect to several criteria: correctness, conciseness, understandability, appropriateness, maturity and support for extensions to the core migration task. We describe in detail the comparison method, and discuss the strengths and weaknesses of the solutions with a special focus on the differences between graph and model transformation for model migration. The comparison results demonstrate tool and language features that strongly impact the efficacy of solutions, such as support for retyping of model elements. The results are used to motivate an agenda for future model migration research (including suggestions for areas in which the tools need to be further improved).     

Model transformation by example using inductive logic programming

Model transformation by example is a novel approach in model-driven software engineering to derive model transformation rules from an initial prototypical set of interrelated source and target models, which describe critical cases of the model transformation problem in a purely declarative way. In the current paper, we automate this approach using inductive logic programming (Muggleton and Raedt in J Logic Program 19-20:629–679, 1994) which aims at the inductive construction of first-order clausal theories from examples and background knowledge.

Synchronization barrier and related tools for shared memory parallel programming

The synchronization barrier is a point in the program where the processing elements (PEs) wait until all the PEs have arrived at this point. In a reduction computation, given a commutative and associative binary operationop, one needs to reduce valuesa ₀,...,a _N-1, stored in PEs 0,...,N-1 to a single valuea _*=a ₀ op a, op...op a _N -1 and then to broadcast the resulta _* to all PEs. This computation is often followed by a synchronization barrier. Routines to perform these functions are frequently required in parallel programs. Simple and efficient, workingC-language routines for the parallel barrier synchronization and reduction computations are presented. The codes are appropriate for a CREW (concurrent-read-exclusive-write) or EREW parallel random access shared memory MIMD computer. They require only shared memory read and write; no locks, semaphores etc. are needed. The running time of each of these routines isO(logN). The amount of shared memory required and the number of shared memory accesses generated are botO(N). These are the asymptotically minimum values for the three parameters. The algorithms employ the obvious computational scheme involving a binary tree. Examples of applications for these routines and results of performance testing on the Sequent Balance 21000 computer are presented.An abstract of this article appeared inProc. 1989 Int. Conf. Parallel Processing, p. II-175.     

From the theory to the tools: parallel dynamic programming

Dynamic programming is an important paradigm that has been widely used to solve problems in various areas such as control theory, operation research, biology and computer science. We generalize the finite automaton formal model for dynamic programming deriving pipeline parallel algorithms. The optimality of these algorithms is established for the new class of non‐decreasing finite automata. As an intermediate step for the construction of a skeleton for the automatic parallelization of dynamic programming, we have developed a tool for the implementation of pipeline algorithms. The tool maps the processes in the pipeline in the target architecture following a mix of block and cyclic policies adapted to the grain of the machine. Based on the former tool, the automatic parallelization of dynamic programming is straightforward. The use of the model and its associated tools is illustrated with the Single Resource Allocation Problem. The performance and portability of these tools is compared with specific ‘hand made’ code written by experienced programmers. The experimental results on distributed memory and shared distributed memory architectures prove the scalability of the proposed paradigm and its associated tools. Copyright © 2000 John Wiley & Sons, Ltd.     

Portable FORTRAN programming tools in the development of a structural analysis program

This work presents two groups of FORTRAN routines, comprising portable programming tools for the development of structural analysis programs. These tools were applied in the enhancement of the CALEB program for collapse analysis of offshore platforms and general framed structures. The RINCOM (COMmand INterpreter Routines) group of routines was employed to build a pre-processor for CALEB, allowing data to be input in the form of a problem-oriented language; the second group provides facilities for incore memory management. The text details the operations performed by these routines, with the help of the source code listings presented in the Appendices.