Parallel machine architecture and compiler design facilities

The objective is to provide an integrated simulation environment for studying and evaluating various issues in designing parallel systems, including machine architectures, parallelizing compiler techniques, and parallel algorithms. The status of Delta project (which objective is to provide a facility to allow rapid prototyping of parallelized compilers that can target toward different machine architectures) is summarized. Included are the surveys of the program manipulation tools developed, the environmental software supporting Delta, and the compiler research projects in which Delta has played a role

The HIRM+ Flight Dynamics Model

The major objective of the GARTEUR Action Group on Analysis Techniques for Clearance of Flight Control Laws FM(AG-11) is the improvement of the flight clearance process by increased automation of the tools used for modelbased analysis of the aircraft’s dynamical behaviour. What is finally needed are techniques for faster detection of the worst case combination of parameter values and manoeuvre cases, from which the flight clearance restrictions are be derived. The basis for such an analysis are accurate mathematical models of the controlled aircraft. In this chapter the HIRM+ flight dynamics model is described as one of the benchmark military aircraft models used within FM(AG-11). HIRM+ originates from the HIRM (High Incidence Research Model) developed within the GARTEUR Action Group on Robust Flight Control M(AG-08). In building the HIRM+, additional emphasis has been put on realistic modelling of parametric uncertainties

ConSIT: A conditioned program slicer

Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including reuse, reengineering and program comprehension. However there has been relatively little work on the implementation of conditioned slicing. Algorithms for implementing conditioned slicing necessarily involve reasoning about the values of program predicates in certain sets of states derived from the conditioned slicing criterion, making implementation particularly demanding. The paper introduces ConSIT, a conditioned slicing system which is based upon conventional static slicing, symbolic execution and theorem proving. ConSIT is the first fully automated implementation of conditioned slicing. An implementation of ConSIT is available for experimentation at &http://www.mcs.gold.ac.uk/tilde/~mas01sd/consit.htm

IAC-DIDAS-N: A Dynamic Interactive Decision Analysis and Support System for Multicriteria Analysis of Nonlinear Models with Nonlinear Model Generator Supporting Model Analysis

This paper is one of the series of 11 Working Papers presenting the software for interactive decision support and software tools for developing decision support systems. These products constitute the outcome of the contracted study agreement between the System and Decision Sciences Program at IIASA and several Polish scientific institutions. The theoretical part of these results is presented in the IIASA Working Paper WP-88-071 entitled "Theory, Software and Testing Examples in Decision Support Systems". This volume contains the theoretical and methodological backgrounds of the software systems developed within the project. This paper presents the user documentation for decision analysis and support systems of DIDAS family designed for supporting decision problems when the model of the system under study can be formulated in terms of set of nonlinear equations. The program presented in the paper, called IAC-DIDAS-N is provided with a nonlinear model generator and editor that support definition, edition and symbolic differentiation of nonlinear models for multiobjective decision analysis. A specially introduced standard of defining nonlinear programming models for multiobjective optimization helps to connect the model generator with other parts of the system. Optimization runs involved in interactive, multiobjective decision analysis are performed by a new version of nonlinear programming algorithm specially adapted for multiobjective problems. This algorithm is based on shifted penalty functions and projected conjugate directions techniques. An attachment to this paper presents user documentation for a pilot version of a nonlinear model generator with facilities for symbolic differentiation and other means of fundamental model analysis

Multi-Objective Modeling and Simulation for Decision Report

Modeling and simulation of various physical, environmental or socioeconomic processes is often a preliminary step for using the resulting models in decision support. With the advancements of computing technology and the methodology of decision support, it is now necessary to revise basic approaches to modeling and simulation: from the very beginning of model construction, they should aim at multi-objective analysis of the model while taking into account various optimization, sensitivity analysis and symbolic manipulation techniques treated as tools of such an analysis, not as goals. The paper illustrates how such an approach could increase the opportunities of comprehensive analysis of a model from a selected class -- as an example, the class of nonlinear dynamic discrete-time models was chosen. A user-friendly format of formulating such models is discussed together with related problems of inverse, constrained and multi-objective simulation as well as structural differentiation and sensitivity analysis, fuzzy set processing and other related issues. As a new tool for the analysis of boundaries of sets generated by such models -- for example. the a-level sets of fuzzy membership functions -- an interactive method of using an elastic "electronic pencil" is proposed

On-stack replacement, distilled

On-stack replacement (OSR) is essential technology for adaptive optimization, allowing changes to code actively executing in a managed runtime. The engineering aspects of OSR are well-known among VM architects, with several implementations available to date. However, OSR is yet to be explored as a general means to transfer execution between related program versions, which can pave the road to unprecedented applications that stretch beyond VMs. We aim at filling this gap with a constructive and provably correct OSR framework, allowing a class of general-purpose transformation functions to yield a special-purpose replacement. We describe and evaluate an implementation of our technique in LLVM. As a novel application of OSR, we present a feasibility study on debugging of optimized code, showing how our techniques can be used to fix variables holding incorrect values at breakpoints due to optimizations