Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “compiler optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Self-Directed Cooperative Planetary Rovers

The project is concerned with the development of decision-theoretic techniques to optimize the scientific return of planetary rovers. Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such resources as operation time, power, storage capacity, and communication bandwidth. Moreover, the limited computational resources of the rover limit the complexity of on-line planning and scheduling. We have developed a comprehensive solution to this problem that involves high-level tools to describe a mission; a compiler that maps a mission description and additional probabilistic models of the components of the rover into a Markov decision problem; and algorithms for solving the rover control problem that are sensitive to the limited computational resources and high-level of uncertainty in this domain.

Zilberstein, Shlomo↗
NASA NTRS1991

Branch strategies - Modeling and optimization

The authors provide a common platform for modeling different schemes for reducing the branch-delay penalty in pipelined processors as well as evaluating the associated increased instruction bandwidth. Their objective is twofold: to develop a model for different approaches to the branch problem and to help select an optimal strategy after taking into account additional i-traffic generated by branch strategies. The model presented provides a flexible tool for comparing different branch strategies in terms of the reduction it offers in average branch delay and also in terms of the associated cost of wasted instruction fetches. This additional criterion turns out to be a valuable consideration in choosing between two strategies that perform almost equally. More importantly, it provides a better insight into the expected overall system performance. Simple compiler-support-based low-implementation-cost strategies can be very effective under certain conditions. An active branch prediction scheme based on loop buffers can be as competitive as a branch-target-buffer based strategy.

Dubey, Pradeep K.↗
DOE OSTI2025

A Synthesis Methodology for Intelligent Memory Interfaces in Accelerator Systems

Domain-specific systems improve the performance of a specific set of applications compared to general-purpose processing systems by deploying custom hardware accelerators. These hardware accelerators are generated using high-level synthesis (HLS) tools. The HLS tools enable a comprehensive design space exploration to optimize the compute performance of the generated accelerators. However, they often ignore the challenges of implementing the accelerators in a system-on-chip, particularly how the accelerators access memory. Our work introduces a buffering system design that improves accelerators' memory accesses by intelligently employing burst transactions to prefetch useful data from external memory to on-chip local buffers. Our design is dynamic, parametric, and transparent to the accelerators generated by HLS tools. We derive the buffering system parameters using appropriate compiler-based analysis passes and memory channel latency constraints. The proposed buffering system design results in, on average, 8.8x performance improvements while lowering memory channel utilization on average by 53.2% for a set of PolyBench kernels.

Limaye, Ankur M. (ORCID:0000000194062584)↗
DOE OSTI2023

Usability and Optimization Improvements in MOOSE

The Multiphysics Object-Oriented Simulation Environment (MOOSE) framework is a foundational capability used by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program to create over 15 different simulation tools for advanced nuclear reactors. Due to MOOSE’s broad use, improvements to the framework in support of modeling and simulation goals are critical to the program. Such improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work described in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities were implemented in the same order as they are covered in this report: multiple nonlinear systems in the same input file, implementation of generic field transfers and other transfer system enhancements, support for stateful material property redistribution for adaptivity and distributed meshes, and dynamic linking and loading of individually compiled applications. These four additions are fundamental capabilities that will be leveraged by many NEAMS applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Mapping Spiking Neural Networks to Heterogeneous Crossbar Architectures using Integer Linear Programming

Advances in novel hardware devices and architectures allow Spiking Neural Network (SNN) evaluation using ultra-low power, mixed-signal, memristor crossbar arrays. As individual network sizes quickly scale beyond the dimensional capabilities of single crossbars, networks must be mapped onto multiple crossbars. Crossbar sizes within modern Memristor Crossbar Architectures (MCAs) are determined predominately not by device technology but by network topology; more, smaller crossbars consume less area thanks to the high structural sparsity found in larger, brain-inspired SNNs. Motivated by continuing increases in SNN sparsity due to improvements in training methods, we propose utilizing heterogeneous crossbar sizes to further reduce area consumption. This approach was previously unachievable as prior compiler studies only explored solutions targeting homogeneous MCAs. Our work improves on the state-of-the-art by providing Integer Linear Programming (ILP) formulations supporting arbitrarily heterogeneous architectures. By modeling axonal interactions between neurons, our methods produce better mappings while removing inhibitive a priori knowledge requirements. We first show a 16.7-27.6% reduction in area consumption for square-crossbar homogeneous architectures. Then, we demonstrate 66.9-72.7% further reduction when using a reasonable configuration of heterogeneous crossbar dimensions. Next, we present a new optimization formulation capable of minimizing the number of inter-crossbar routes. When applied to solutions already near-optimal in area, an 11.9-26.4% routing reduction is observed without impacting area consumption. Finally, we present a profile-guided optimization capable of minimizing the number of runtime spikes between crossbars. Compared to the best-area-then-route optimized solutions, we observe a further 0.5-14.8% inter-crossbar spike reduction while requiring 1–3 orders of magnitude less solver time.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗
DOE OSTI2024

Cross-Feature Transfer Learning for Efficient Tensor Program Generation

Tuning tensor program generation involves navigating a vast search space to find optimal program transformations and measurements for a program on the target hardware. The complexity of this process is further amplified by the exponential combinations of transformations, especially in heterogeneous environments. This research addresses these challenges by introducing a novel approach that learns the joint neural network and hardware features space, facilitating knowledge transfer to new, unseen target hardware. A comprehensive analysis is conducted on the existing state-of-the-art dataset, TenSet, including a thorough examination of test split strategies and the proposal of methodologies for dataset pruning. Leveraging an attention-inspired technique, we tailor the tuning of tensor programs to embed both neural network and hardware-specific features. Notably, our approach substantially reduces the dataset size by up to 53% compared to the baseline without compromising Pairwise Comparison Accuracy (PCA). Furthermore, our proposed methodology demonstrates competitive or improved mean inference times with only 25–40% of the baseline tuning time across various networks and target hardware. The attention-based tuner can effectively utilize schedules learned from previous hardware program measurements to optimize tensor program tuning on previously unseen hardware, achieving a top-5 accuracy exceeding 90%. This research introduces a significant advancement in autotuning tensor program generation, addressing the complexities associated with heterogeneous environments and showcasing promising results regarding efficiency and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Extending JuTrack’s capabilities to the FRIB accelerator to enhance online modeling

JuTrack is a Julia-based accelerator modeling and tracking package that utilizes compiler-level automatic differentiation (AD) to enable fast and accurate derivative calculations. While JuTrack provides a solid foundation for beam dynamics simulations, its capabilities must be extended to support the Facility for Rare Isotopes (FRIB) linac. This includes modeling heavy-ion linac accelerator components such as the liquid-lithium charge stripper, which facilitates efficient acceleration by remove electrons from heavy isotopes, and incorporating multi-charge state acceleration tracking, which allows for charge-dependent beam dynamics. These extensions address challenges such as the beam matching and optimization of multi charge state through various accelerating structures and beam-material interaction modeling while maintaining the auto differentiation capability. This work focuses on adapting JuTrack to incorporate these elements, enhancing its online modeling abilities. We present modifications to JuTrack’s framework and demonstrate their performance in FRIB simulations.

Accelerator Physics↗
NASA NTRS2020

Characterization of International Space Station Crew Members' Workload Contributing to Fatigue, Sleep Disruption and Circadian De-synchronization

The focus of this paper is to characterize how the International Space Station (ISS) crewmembers’ workload may be contributing to sleep loss, circadian misalignment and fatigue. Both sleep quantity and subjective sleep quality are reduced in ISS crewmembers (Barger, Flynn-Evans, Kubey, Walsh, Ronda, Wang, Wright, & Czeisler, 2014). Evidence indicates that the use of hypnotic drugs does not appear to promote extended sleep duration. Because sleep is often driven by psychosocial as well as somatic attributes, traditional therapies may only partially moderate the problem for some individuals. Accordingly, searching for additional abatement tactics is a sensible plan. Scientific studies have shown that sleep can be disrupted from work-related stressors. On the ISS, to optimize their time, the crewmembers follow prescribed, ambitious and rigorous schedules with shared deadlines. Here it will be argued that these human capital leveraging techniques may be undermining the astronaut’s sleep, which could negatively impact performance. Along with half of the Earth-bound working population (Paoli & Merllié, 2001), ISS crewmembers may not be adequately recovering from their workload. This paper begins with a characterization of the working conditions of ISS crewmembers, describes the development of rigorous schedules and portrays a typical workday. Terrestrially-based research is compiled to describe how full and partial sleep deprivation affect physical and cognitive performance and how ISS work characteristics may disrupt sleep and subsequent performance. The literature points toward potential solutions to astronaut fatigue that is related to their workload. Finally, throughout the text, evidence is provided from semi-structured interviews, biographies and textual databases to support the argument that astronaut workload is contributing to their sleep loss and fatigue and that research, development and mitigation strategies should focus on enhancing the restorative process.

fatigue↗
NASA NTRS2004

The Role of Ontologies in Schema-based Program Synthesis

Program synthesis is the process of automatically deriving executable code from (non-executable) high-level specifications. It is more flexible and powerful than conventional code generation techniques that simply translate algorithmic specifications into lower-level code or only create code skeletons from structural specifications (such as UML class diagrams). Key to building a successful synthesis system is specializing to an appropriate application domain. The AUTOBAYES and AUTOFILTER systems, under development at NASA Ames, operate in the two domains of data analysis and state estimation, respectively. The central concept of both systems is the schema, a representation of reusable computational knowledge. This can take various forms, including high-level algorithm templates, code optimizations, datatype refinements, or architectural information. A schema also contains applicability conditions that are used to determine when it can be applied safely. These conditions can refer to the initial specification, to intermediate results, or to elements of the partially-instantiated code. Schema-based synthesis uses AI technology to recursively apply schemas to gradually refine a specification into executable code. This process proceeds in two main phases. A front-end gradually transforms the problem specification into a program represented in an abstract intermediate code. A backend then compiles this further down into a concrete target programming language of choice. A core engine applies schemas on the initial problem specification, then uses the output of those schemas as the input for other schemas, until the full implementation is generated. Since there might be different schemas that implement different solutions to the same problem this process can generate an entire solution tree. AUTOBAYES and AUTOFILTER have reached the level of maturity where they enable users to solve interesting application problems, e.g., the analysis of Hubble Space Telescope images. They are large (in total around 100kLoC Prolog), knowledge intensive systems that employ complex symbolic reasoning to generate a wide range of non-trivial programs for complex application do- mains. Their schemas can have complex interactions, which make it hard to change them in isolation or even understand what an existing schema actually does. Adding more capabilities by increasing the number of schemas will only worsen this situation, ultimately leading to the entropy death of the synthesis system. The root came of this problem is that the domain knowledge is scattered throughout the entire system and only represented implicitly in the schema implementations. In our current work, we are addressing this problem by making explicit the knowledge from Merent parts of the synthesis system. Here; we discuss how Gruber's definition of an ontology as an explicit specification of a conceptualization matches our efforts in identifying and explicating the domain-specific concepts. We outline the dual role ontologies play in schema-based synthesis and argue that they address different audiences and serve different purposes. Their first role is descriptive: they serve as explicit documentation, and help to understand the internal structure of the system. Their second role is prescriptive: they provide the formal basis against which the other parts of the system (e.g., schemas) can be checked. Their final role is referential: ontologies also provide semantically meaningful "hooks" which allow schemas and tools to access the internal state of the program derivation process (e.g., fragments of the generated code) in domain-specific rather than language-specific terms, and thus to modify it in a controlled fashion. For discussion purposes we use AUTOLINEAR, a small synthesis system we are currently experimenting with, which can generate code for solving a system of linear equations, Az = b.

Bures, Tomas↗
DOE OSTI2023

Numerical Circuit Synthesis and Compilation for Multi-State Preparation

Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given state from a fixed input state, called 'state preparation'; and circuits to implement a given unitary operation, for example by 'unitary synthesis'. In this paper we solve a more general problem: the transformation of a set of m states to another set of m states, which we call 'multi-state preparation'. State preparation and unitary synthesis are special cases; for state preparation, m=1, while for unitary synthesis, m is the dimension of the full Hilbert space. We generate and optimize circuits for multi-state preparation numerically. In cases where a top-down approach based on matrix decompositions is also possible, our method finds circuits with substantially (up to 40 %) fewer two-qubit gates. We discuss possible applications, including efficient preparation of macroscopic superposition ('cat') states and synthesis of quantum channels.

Szasz, Aaron↗
NASA NTRS2021

Performance of JAXA’s SGLI standard ocean color products for oceanic to coastal waters: chlorophyll a concentration and light absorption coefficients of colored dissolved organic matter

We present the performance of JAXA’s SGLI standard algorithms for estimating chlorophyll a (chl a) concentration and the light absorption coefcients of colored dissolved organic matter (CDOM) using recently compiled high-quality data obtained from oceanic to coastal waters. Prior to the evaluation of the algorithms, we frst compare two forward models (Gordon et al. in J Geophys Res 93(D9):10909-10924, 1988: G88 and Park and Ruddick in Appl Opt 44(7):1236–1249, 2005: PR05) using a wide range of inherent optical properties (IOPs) to (1) examine if the water refectance is appropriately reproduced and (2) correct measured refectance in terms of its bidirectionality. Based on a good reproducibility of water refectance using the PR05, the optimized IOPs are further used for explaining errors in estimates of chl a concentration and CDOM absorption when using the SGLI, the GSM (Maritorena et al. in Appl Opt 41:2705–2714, 2002), and the QAA (Lee et al. in Appl Opt 41:5755, 2002) inversion algorithms. Results show that the mean error for estimating chl a concentration using the SGLI algorithm is 110% for our dataset. Although this error is lower than that of the GSM and the QAA algorithms, a signifcant underestimate at chl a higher than 2.0 mg m−3 is observed, which is further shown by independent match-up analyses. Another SGLI CDOM product includes the mean error of 50% and shows deviation at high CDOM range (>1.0 per m). A similar trend is observed for the GSM but not for the QAA when a global relationship of CDOM to colored detrital matter is applied. The sources of errors are discussed for potentially improving the retrievals

Second-generation GLobal Imager (SGLI)↗
DOE OSTI2020

Use of the Manuela 3D/Radiation Scanning Tool at Nuclear Facilities - 20437

Licensees, facility operators and decommissioning contractors have a need for comprehensive, accurate and precise radiological and topographical data to plan and execute safe and efficient Decontamination and Decommissioning (D and D) projects. Traditional approaches rely greatly upon labor and administratively intensive data collection methods that require considerable time and effort to glean the relevant data to plan and perform work in a radiological work area. Orano Decommissioning Services has developed and utilized at French nuclear facilities a lightweight portable scanning instrument called MANUELA (Mobile Apparatus for Nuclear Expertise Localization Assistance). Recently Orano conducted demonstrations at two United States nuclear facilities using MANUELA that may prove useful in areas of the fuel cycle including: - ALARA (As Low As Reasonably Achievable) planning during facility operations; - Scoping and site characterization during the D and D planning phase; - Remedial action support during active decommissioning work; - Radiation and modeling planning for plant modifications; - Support Final Status Survey and demonstration of 'end state' compliance for license termination. MANUELA is currently being evaluated for use during decommissioning of nuclear facilities and could aide in demonstrating compliance with end state criteria after decommissioning. Of particular interest are decommissioning projects planned for various sites across the United States. Most of these sites present unique challenges and opportunities to safely and efficiently decommission in a regulatory compliant manner. The two demonstration site's current conditions of relatively low radiation levels inside containment proved to be ideal platforms to deploy the MANUELA instrument for evaluation of the complex geometries typically found in a nuclear facility. The MANUELA instrument was able to precisely identify local hot spots of the reactor system's primary equipment and was able to simultaneously overlay the dose information onto the scanned 3D images. Using data like this, a licensee would be able to make informed technical and personnel decisions on methods to remediate, shield or properly dispose of the radioactive source term. MANUELA can be used throughout the decommissioning process to validate progress and continue to refine the work activities to optimize the efforts of the crew which reduces downtime waiting for survey results, whereas traditional survey methodology relies on a physical survey to be performed and the data transcribed onto survey maps that are only two dimensional. The traditional format tends to be inaccurate and difficult to interpret the precise location(s) of hot spots or generalized dose rates. The resultant scan also allows the user to know the exact extent of the survey versus transposing information onto a map with only a portion of the map area scanned. MANUELA also compiles all of the relevant survey data into a downloadable table format which includes the measurement identification number, time stamp, point space location on the XYZ plane, and the dose rate value. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS1996

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗
NASA NTRS2016

High-Performance Reaction Wheel Optimization for Fine-Pointing Space Platforms: Minimizing Induced Vibration Effects on Jitter Performance plus Lessons Learned from Hubble Space Telescope for Current and Future Spacecraft Applications

The Hubble Space Telescope (HST) applies large-diameter optics (2.5-m primary mirror) for diffraction-limited resolution spanning an extended wavelength range (approx. 100-2500 nm). Its Pointing Control System (PCS) Reaction Wheel Assemblies (RWAs), in the Support Systems Module (SSM), acquired an unprecedented set of high-sensitivity Induced Vibration (IV) data for 5 flight-certified RWAs: dwelling at set rotation rates. Focused on 4 key ratios, force and moment harmonic values (in 3 local principal directions) are extracted in the RWA operating range (0-3000 RPM). The IV test data, obtained under ambient lab conditions, are investigated in detail, evaluated, compiled, and curve-fitted; variational trends, core causes, and unforeseen anomalies are addressed. In aggregate, these values constitute a statistically-valid basis to quantify ground test-to-test variations and facilitate extrapolations to on-orbit conditions. Accumulated knowledge of bearing-rotor vibrational sources, corresponding harmonic contributions, and salient elements of IV key variability factors are discussed. An evolved methodology is presented for absolute assessments and relative comparisons of macro-level IV signal magnitude due to micro-level construction-assembly geometric details/imperfections stemming from both electrical drive and primary bearing design parameters. Based upon studies of same-size/similar-design momentum wheels' IV changes, upper estimates due to transitions from ground tests to orbital conditions are derived. Recommended HST RWA choices are discussed relative to system optimization/tradeoffs of Line-Of-Sight (LOS) vector-pointing focal-plane error driven by higher IV transmissibilities through low-damped structural dynamics that stimulate optical elements. Unique analytical disturbance results for orbital HST accelerations are described applicable to microgravity efforts. Conclusions, lessons learned, historical context/insights, and perspectives on future applications are given; these previously unpublished data and findings represents a valuable resource for fine-pointing spacecraft or space-based platforms using RWAs, Control Moment Gyros (CMGs), Momentum Wheels, or other ball-bearing-based rotational units.

Hasha, Martin D.↗
DOE OSTI2023

Enabling Fortran Standard Parallelism in GAMESS for Accelerated Quantum Chemistry Calculations

The performance of Fortran 2008 DO CONCURRENT (DC) relative to OpenACC and OpenMP target offloading (OTO) with different compilers is studied for the GAMESS quantum chemistry application. Specifically, DC and OTO are used to offload the Fock build, which is a computational bottleneck in most quantum chemistry codes, to GPUs. The DC Fock build performance is studied on NVIDIA A100 and V100 accelerators and compared with the OTO versions compiled by the NVIDIA HPC, IBM XL, and Cray Fortran compilers. The results show that DC can speed up the Fock build by 3.0× compared with that of the OTO model. Finally, with similar offloading efforts, DC is a compelling programming model for offloading Fortran applications to GPUs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2025

Code Migration and Optimization for Calculating Atmospheric Attenuation in RF Link Budgets Within Glenn Research Center Communication Analysis Suite

This technical report encompasses development completed on the Glenn Research Center Communication Analysis Suite (GCAS) as it relates to converting code from the original MATLAB® (The MathWorks, Inc.) GCAS code base to C++. It focuses on a majority of the functions, structures, and intermediate code developed for radiofrequency (RF) links calculations. The report serves as a comprehensive record of the current progress and outlines the technical challenges overcome during this research. Throughout this project, numerous functions and structures were migrated end to end, with validation test cases conducted in accordance with NASA’s verification and validation efforts for standard models and simulations. This report also provides high-level documentation of the completed work; detailed low-level documentation has been compiled to provide a line-by-line explanation in alignment with NASA’s goals. This development has largely been focused on atmospheric effects on calculating RF link budgets for both terrestrial and space links. Some developments outside of atmospheric functions are also covered throughout this report; these are largely related to mathematical operations and MATLAB® structure conversions.

Brady M. Phelps↗
DOE OSTI2021

Centrality determination with a forward detector in the RHIC Beam Energy Scan

Recently, Chatterjee et al [1] used a hadronic transport model to estimate the resolution with which various experimental quantities select the impact parameter of relativistic heavy ion collisions at collision energies relevant to the Beam Energy Scan (BES) program at the Relativistic Heavy Ion Collider (RHIC). Measures based on particle multiplicity at forward rapidity were found to be significantly worse than those based on midrapidity multiplicity. Using the same model, we show that a slightly more sophisticated measure greatly improves the resolution based on forward rapidity particles; this improvement persists even when the model is filtered through a realistic simulation of a recent upgrade detector to the STAR experiment. Furthermore, these results highlight the importance of optimizing centrality measures based on particles detected at forward rapidity, especially for experimental studies that search for a critical point in the QCD phase diagram. Such measurements usually focus on proton multiplicity fluctuations at midrapidity, hence selecting events based on multiplicity at midrapidity raises the possibility of nontrivial autocorrelations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1995

Formal methods in the design of Ada 1995

Formal, mathematical methods are most useful when applied early in the design and implementation of a software system--that, at least, is the familiar refrain. I will report on a modest effort to apply formal methods at the earliest possible stage, namely, in the design of the Ada 95 programming language itself. This talk is an 'experience report' that provides brief case studies illustrating the kinds of problems we worked on, how we approached them, and the extent (if any) to which the results proved useful. It also derives some lessons and suggestions for those undertaking future projects of this kind. Ada 95 is the first revision of the standard for the Ada programming language. The revision began in 1988, when the Ada Joint Programming Office first asked the Ada Board to recommend a plan for revising the Ada standard. The first step in the revision was to solicit criticisms of Ada 83. A set of requirements for the new language standard, based on those criticisms, was published in 1990. A small design team, the Mapping Revision Team (MRT), became exclusively responsible for revising the language standard to satisfy those requirements. The MRT, from Intermetrics, is led by S. Tucker Taft. The work of the MRT was regularly subject to independent review and criticism by a committee of distinguished Reviewers and by several advisory teams--for example, the two User/Implementor teams, each consisting of an industrial user (attempting to make significant use of the new language on a realistic application) and a compiler vendor (undertaking, experimentally, to modify its current implementation in order to provide the necessary new features). One novel decision established the Language Precision Team (LPT), which investigated language proposals from a mathematical point of view. The LPT applied formal mathematical analysis to help improve the design of Ada 95 (e.g., by clarifying the language proposals) and to help promote its acceptance (e.g., by identifying a verifiable subset that would meet the needs of safety-critical applications). The first LPT project, which ran from the fall of 1990 unti the end of 1992, produced studies of several language issues: optimization, sharing and storage, tasking and protected records, overload resolution, the floating point model, distribution, program erros, and object-oriented programming. The second LPT project, in 1994, formally modeled the dynamic semantics of a large part of the (almost) final language definition, looking especially for interactions between language features.

Guaspari, David↗