This note describes a Mathematica interface for Fortran code generated by Form-Calc. The interfacing code is set up automatically so that only minuscule changes in the driver files are required. The interface makes a function to compute the cross-section or decay rate available in Mathematica. This function depends on the model parameters chosen for interfacing in the Fortran code.

Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output a HPF (High Performance Fortran) program with data distribution and parallel ($HPF! INDEPENDENT) loops. This paper explains how the HPF program is built from some scheduling and allocation functions automatically generated by Bouclettes.

REC (Regular Expression Compiler) is a concise programming language which allows students to write programs without knowledge of the complicated syntax of languages like FORTRAN and ALGOL. The language is recursive and contains only four elements for control. This paper describes an interpreter of REC written in FORTRAN.

We announce publicly available Fortran software for the initial value problem IVP in ordinary di erential equations ODEs We describe the interfaces and how Fortran language features a ord the opportunity both to address di erent types and structures of variables and to provide functionality not usually directly associated with IVP solvers

Bouclettes is a source to source loop nest parallelizer It takes as input Fortran uniform perfectly nested loops and gives as output an HPF High Performance Fortran program with data distribution and parallel HPF INDEPENDENT loops This paper presents the tool and the underlying parallelization methodology

We present a collection of C/C++ and Fortran programs with OpenMP directives that were designed to validate the correctness of an OpenMP implementation. The validation methodology and implemented tests are presented. We also discuss the differences between the Fortran and C validation suite and extensions made possible by the clarifications introduced by OpenMP 2.5.

A novel indexing structure, join index hierarchy, is proposed to handle the \goto's on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index le, and thus accelerates navigation in object-oriented databases. The method extends the join index str...