Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computing methodologies”

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 703 records · Page 39

Optimization of a Lattice Boltzmann Computation on State-of-the-Art Multicore Platforms

We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of search-based performance optimizations, popular in linear algebra and FFT libraries, to application-specific computational kernels. Our work applies this strategy to a lattice Boltzmann application (LBMHD) that historically has made poor use of scalar microprocessors due to its complex data structures and memory access patterns. We explore one of the broadest sets of multicore architectures in the HPC literature, including the Intel Xeon E5345 (Clovertown), AMD Opteron 2214 (Santa Rosa), AMD Opteron 2356 (Barcelona), Sun T5140 T2+ (Victoria Falls), as well as a QS20 IBM Cell Blade. Rather than hand-tuning LBMHD for each system, we develop a code generator that allows us to identify a highly optimized version for each platform, while amortizing the human programming effort. Results show that our auto-tuned LBMHD application achieves up to a 15x improvement compared with the original code at a given concurrency. Additionally, we present detailed analysis of each optimization, which reveal surprising hardware bottlenecks and software challenges for future multicore systems and applications.

97 MATHEMATICS AND COMPUTING↗

Pulse superimposition calculational methodology for estimating the subcriticality level of nuclear fuel assemblies.

One of the most reliable experimental methods for measuring the subcriticality level of a nuclear fuel assembly is the Sjoestrand method applied to the reaction rate generated from a pulsed neutron source. This study developed a new analytical methodology simulating the Sjoestrand method, which allows comparing the experimental and analytical reaction rates and the obtained subcriticality levels. In this methodology, the reaction rate is calculated due to a single neutron pulse using MCNP/MCNPX computer code or any other neutron transport code that explicitly simulates the delayed fission neutrons. The calculation simulates a single neutron pulse over a long time period until the delayed neutron contribution to the reaction rate is vanished. The obtained reaction rate is then superimposed to itself, with respect to the time, to simulate the repeated pulse operation until the asymptotic level of the reaction rate, set by the delayed neutrons, is achieved. The superimposition of the pulse to itself was calculated by a simple C computer program. A parallel version of the C program is used due to the large amount of data being processed, e.g., by the Message Passing Interface (MPI). The analytical results of this new calculation methodology have shown an excellent agreement with the experimental data available from the YALINA-Booster facility of Belarus. This methodology can be used to calculate Bell and Glasstone spatial correction factor.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Flux stabilization in neutron problems with fixed sources

Although critical core calculations are the most common in design and safety analysis, fixed source calculations are needed for specific applications, e.g. to compute ex-core detector response functions, to develop new methodologies for dilution and reload error accidents and more in general for all situations involving sub-critical shut-down states. It is well known that the source problem becomes difficult to be solved with core configuration close to criticality, i.e. with the multiplication factor approaching unity, for the occurrence of numerical ill-conditioning and very high number of iterations, possibly leading to failure in the flux convergence. In this work, the Wielandt Eigen-shift technique used in iterative methods of critical problems is developed for source problems too, in order to stabilize the solution. The mathematical basis and the proof of the convergence are discussed. Compared to the existing methods, this technique allows also more control to avoid singular behavior at inner iterations. Numerical tests with a 1D analytical benchmark are reported to prove the robustness of the technique. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

PhytoPET, PhytoBeta and PhytoSPECT: Radioisotope Imaging Systems Being Developed for Plant Biology Research

The Radiation Detector and Imaging Group at Thomas Jefferson National Accelerator Facility (Jefferson Lab) is developing radioisotope imaging systems designed and constructed to facilitate plant biology studies at the Duke University Phytotron. The imaging systems utilize nuclear medicine imaging methodologies used in positron emission tomography (PET) and single photon emission computed tomography (SPECT) but designed specifically for plant biology. The range of plant shapes and the environmental conditions in plant growth chambers pose a technological challenge. Description: Jefferson Lab is collaborating with the Duke University Phytotron and the Triangle Universities Nuclear Laboratory (TUNL) in the construction and operation of PhytoPET and PhytoBeta (for direct beta particle detection) for plant and/or microbe imaging. The TUNL tandem Van de Graaff accelerator (maximum terminal voltage of 10 MV) has been used to generate 11C and 13N for plant biology research. The PhytoPET and PhytoBeta have been used with 11C as a 11CO2 tracer for plant ecophysiology imaging with corn, poplar, oak and barley utilizing technologies developed for nuclear physics research and nuclear medicine. The imaging detectors are based on position sensitive photomultiplier tubes coupled to scintillators. Additionally, the collaboration is investigating a methodology using single photon emitting radioisotope tracers for imaging the distribution of molecular compounds of interest in the rhizosphere, the interface between root and soil, without disturbing the root or soil habitat. Plans are underway to develop a single photon emission computed tomography (SPECT) system (PhytoSPECT) to image the bio-distribution of fungi in association with a host plant's roots. In addition to a description of the technology an overview will be given of the application of PhytoPET, PhytBeta and PhytoSPECT to plant biology research at Duke University. Conclusions: We have developed and used radioisotope imaging technologies based on PET and SPECT to visualize plant function in changing environments. There are many opportunities to provide radioisotope based imaging tools for plant ecophysiology imaging. Keywords: radioisotope detection, plant biology, carbon-11, accelerator produced isotopes

Weisenberger, Andrew↗

Scaling methodologies and similarity analysis for thermal hydraulics test facility development for water-cooled small modular reactor

Small modular reactors (SMRs) represent a promising option for providing clean and sustainable energy due to their potential for enhanced safety, reduced capital costs, and increased siting flexibility. However, new reactor systems require the development and operation of representative scaled-down test facilities to support the verification and validation of system computer codes and models. Here this study reviews the research on scaling methodologies and similarity principles pivotal in developing non-nuclear integral effects test and separate effects test facilities for water-cooled SMRs. The study focuses on a review of the scaling methods, similarity approaches, and possible challenges posed by the unique and compact design features of integral-pressurized water reactor-type SMRs, and their representative test facilities. This study also reviews previous research related to scaling and similarity methodologies and provides insights into design considerations for achieving prototypic conditions in test facilities. The findings and recommendations emphasize the broader impact of appropriate scaling and similarity principles to ensure meaningful and transferable results from non-nuclear test facilities to accelerate the safe and efficient deployment of next-generation water-cooled SMRs.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Efficient Computation of Info-Gap Robustness for Finite Element Models

A recent research effort at LANL proposed info-gap decision theory as a framework by which to measure the predictive maturity of numerical models. Info-gap theory explores the trade-offs between accuracy, that is, the extent to which predictions reproduce the physical measurements, and robustness, that is, the extent to which predictions are insensitive to modeling assumptions. Both accuracy and robustness are necessary to demonstrate predictive maturity. However, conducting an info-gap analysis can present a formidable challenge, from the standpoint of the required computational resources. This is because a robustness function requires the resolution of multiple optimization problems. This report offers an alternative, adjoint methodology to assess the info-gap robustness of Ax = b-like numerical models solved for a solution x. Two situations that can arise in structural analysis and design are briefly described and contextualized within the info-gap decision theory framework. The treatments of the info-gap problems, using the adjoint methodology are outlined in detail, and the latter problem is solved for four separate finite element models. As compared to statistical sampling, the proposed methodology offers highly accurate approximations of info-gap robustness functions for the finite element models considered in the report, at a small fraction of the computational cost. It is noted that this report considers only linear systems; a natural follow-on study would extend the methodologies described herein to include nonlinear systems.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

AREVA NP's industrial CFD single-phase methodology and applications for nuclear fuel

During the course of the last decade, AREVA NP has developed Computational Fluid Dynamics (CFD) methods capable of accurately predicting flow fields and thermal mixing within fuel bundles, as well as pressure losses and hydrodynamic forces on fuel assembly components such as spacer grids, lower and upper nozzles. The present work summarizes the evolution of AREVA NP's single-phase CFD methodology and the extensive validation efforts, with focus on improving confidence level in CFD results. Currently, it is possible to produce models for large sections of a fuel assembly and produce CFD simulation results with an uncertainty proven to be similar to the corresponding measurement uncertainty. Extensive validation has been conducted against in-house data obtained for a wide range of geometries representative of actual hardware, in multiple test facilities, with various measurement techniques. In addition to in-house validation data, AREVA NP has also exercised its best-practices against international benchmarks; blind test results were in very good agreement with the data. The current high level of confidence in single-phase CFD predictions allows investigating a wide variety of physics in Pressurized Water Reactor (PWR) as well as Boiling Water Reactor (BWR) fuel assemblies. CFD is used as a design and optimization tool as well as a supplement to regular testing to improve the quality of tests and optimize hardware design features for specific targets. CFD played a major role in the design of AREVA NP's latest fuel assembly designs (ATRIUM{sup TM1} 11 and GAIA). In this paper we first illustrate AREVA NP's comprehensive validation database for single-phase CFD (pressure drop, flow field), then provide several examples of applications: virtual testing for parts optimization and support of core operation. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A frequentist approach to computer model calibration

The paper considers the computer model calibration problem and provides a general frequentist solution. Under the framework proposed, the data model is semiparametric with a non-parametric discrepancy function which accounts for any discrepancy between physical reality and the computer model. In an attempt to solve a fundamentally important (but often ignored) identifiability issue between the computer model parameters and the discrepancy function, the paper proposes a new and identifiable parameterization of the calibration problem. It also develops a two-step procedure for estimating all the relevant quantities under the new parameterization. This estimation procedure is shown to enjoy excellent rates of convergence and can be straightforwardly implemented with existing software. For uncertainty quantification, bootstrapping is adopted to construct confidence regions for the quantities of interest. As a result, the practical performance of the methodology is illustrated through simulation examples and an application to a computational fluid dynamics model.

97 MATHEMATICS AND COMPUTING↗

Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model

The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.

42 ENGINEERING↗

The MCNP6 Analytic Criticality Benchmark Suite

Analytical benchmarks provide an invaluable tool for verifying computer codes used to simulate neutron transport. Several collections of analytical benchmark problems [1-4] are used routinely in the verification of production Monte Carlo codes such as MCNP® [5,6]. Verification of a computer code is a necessary prerequisite to the more complex validation process. The verification process confirms that a code performs its intended functions correctly. The validation process involves determining the absolute accuracy of code results vs. nature. In typical validations, results are computed for a set of benchmark experiments using a particular methodology (code, cross-section data with uncertainties, and modeling) and compared to the measured results from the set of benchmark experiments. The validation process determines bias, bias uncertainty, and possibly additional margins. Verification is generally performed by the code developers, while validation is generally performed by code users for a particular application space. The VERIFICATION_KEFF suite of criticality problems [1,2] was originally a set of 75 criticality problems found in the literature for which exact analytical solutions are available. Even though the spatial and energy detail is necessarily limited in analytical benchmarks, typically to a few regions or energy groups, the exact solutions obtained can be used to verify that the basic algorithms, mathematics, and methods used in complex production codes perform correctly. The present work has focused on revisiting this benchmark suite. A thorough review of the problems resulted in discarding some of them as not suitable for MCNP benchmarking. For the remaining problems, many of them were reformulated to permit execution in either multigroup mode or in the normal continuous-energy mode for MCNP. Execution of the benchmarks in continuous-energy mode provides a significant advance to MCNP verification methods.

97 MATHEMATICS AND COMPUTING↗

GPU Acceleration of Kernel Density Estimators in Monte Carlo Neutron Transport Simulations

Kernel Density Estimators (KDEs) have recently been explored for use in Monte Carlo radiation transport simulations as an alternative to histogram tallies for capturing spatially-resolved quantities such as neutron flux and reaction rates. Histogram tallies suffer from large uncertainties when detailed spatial resolution of the quantity of interest is required; increasing the resolution of the underlying mesh increases the uncertainty in each histogram bin. KDEs obtain estimates of underlying densities on user-defined points, with the uncertainty at those points being independent of the spatial resolution desired since collisions and particle-track segments are allowed to contribute to the score at multiple tally points. Thus, KDEs show potential for obtaining estimates of a smoother spatially-resolved with reduced variance when compared to a histogram. However, this ability that enables KDEs to obtain lower uncertainties per particle history is more computationally expensive than using a traditional histogram bins on a structured mesh. While KDEs are capable of producing lower tally uncertainties compared to histogram binning for a given number of histories, their increased computational cost may make them less efficient. Even so, it is possible to reduce this additional cost by exporting the KDE tally routines onto Graphics Processing Units (GPUs). GPUs are commonly found on high-performance computing machines as a means of increasing performance without adding additional compute nodes. While it is difficult for existing Monte Carlo radiation transport codes to take advantage of GPUs without rewriting large portions of the code, it is possible to leverage GPUs through heterogeneous computing. This work uses a modified version of OpenMC and exports the KDE tally routines onto a GPU to obtain problem-dependent speedups ranging between 1.6 and 5.0 for the problem studied in this paper. While this methodology is applied to KDEs, the same ideas can be applied to other computationally expensive vectorizable portions of Monte Carlo algorithms. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

New Version of the MCNP Analytic Criticality Benchmark Suite

Analytical benchmarks provide an invaluable tool for verifying computer codes used to simulate neutron transport. Several collections of analytical benchmark problems are used routinely in the verification of production Monte Carlo codes such as MCNP{sup R}. Verification of a computer code is a necessary prerequisite to the more complex validation process. The verification process confirms that a code performs its intended functions correctly. The validation process involves determining the absolute accuracy of code results vs. nature. In typical validations, results are computed for a set of benchmark experiments using a particular methodology (code, cross-section data with uncertainties, and modeling) and compared to the measured results from the set of benchmark experiments. The validation process determines bias, bias uncertainty, and possibly additional margins. Verification is generally performed by the code developers, while validation is generally performed by code users for a particular application space. The VERIFICATION-KEFF suite of criticality problems was originally a set of 75 criticality problems found in the literature for which exact analytical solutions are available. Even though the spatial and energy detail is necessarily limited in analytical benchmarks, typically to a few regions or energy groups, the exact solutions obtained can be used to verify that the basic algorithms, mathematics, and methods used in complex production codes perform correctly. The present work has focused on revisiting this benchmark suite. A thorough review of the problems resulted in discarding some of them as not suitable for MCNP benchmarking. For the remaining problems, many of them were reformulated to permit execution in either multigroup mode or in the normal continuous-energy mode for MCNP. Execution of the benchmarks in continuous-energy mode provides a significant advance to MCNP verification methods. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

On‐site surrogates for large‐scale calibration

Abstract Motivated by a computer model calibration problem from the oil and gas industry, involving the design of a honeycomb seal, we develop a new Bayesian methodology to cope with limitations in the canonical apparatus stemming from several factors. We propose a new strategy of on‐site design and surrogate modeling for a computer simulator acting on a high‐dimensional input space that, although relatively speedy, is prone to numerical instabilities, missing data, and nonstationary dynamics. Our aim is to strike a balance between data‐faithful modeling and computational tractability in a calibration framework—tailoring the computer model to a limited field experiment. Situating our on‐site surrogates within the canonical calibration apparatus requires updates to that framework. We describe a novel yet intuitive Bayesian setup that carefully decomposes otherwise prohibitively large matrices by exploiting the sparse blockwise structure. Empirical illustrations demonstrate that this approach performs well on toy data and our motivating honeycomb example.

Huang, Jiangeng↗

Computer usage and national energy consumption: Results from a field-metering study

The electricity consumption of miscellaneous electronic loads (MELs) in the home has grown in recent years, and is expected to continue rising. Consumer electronics, in particular, are characterized by swift technological innovation, with varying impacts on energy use. Desktop and laptop computers make up a significant share of MELs electricity consumption, but their national energy use is difficult to estimate, given uncertainties around shifting user behavior. This report analyzes usage data from 64 computers (45 desktop, 11 laptop, and 8 unknown) collected in 2012 as part of a larger field monitoring effort of 880 households in the San Francisco Bay Area, and compares our results to recent values from the literature. We find that desktop computers are used for an average of 7.3 hours per day (median = 4.2 h/d), while laptops are used for a mean 4.8 hours per day (median = 2.1 h/d). The results for laptops are likely underestimated since they can be charged in other, unmetered outlets. Average unit annual energy consumption (AEC) for desktops is estimated to be 194 kWh/yr (median = 125 kWh/yr), and for laptops 75 kWh/yr (median = 31 kWh/yr). We estimate national annual energy consumption for desktop computers to be 20 TWh. National annual energy use for laptops is estimated to be 11 TWh, markedly higher than previous estimates, likely reflective of laptops drawing more power in On mode in addition to greater market penetration. This result for laptops, however, carries relatively higher uncertainty compared to desktops. Different study methodologies and definitions, changing usage patterns, and uncertainty about how consumers use computers must be considered when interpreting our results with respect to existing analyses. Finally, as energy consumption in On mode is predominant, we outline several energy savings opportunities: improved power management (defaulting to low-power modes after periods of inactivity as well as power scaling), matching the rated power of power supplies to computing needs, and improving the efficiency of individual components.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Current Capabilities at SNL for the Integration of Small Modular Reactors onto Smart Microgrids Using Sandia's Smart Microgrid Technology High Performance Computing and Advanced Manufacturing.

Smart grids are a crucial component for enabling the nation’s future energy needs, as part of a modernization effort led by the Department of Energy. Smart grids and smart microgrids are being considered in niche applications, and as part of a comprehensive energy strategy to help manage the nation’s growing energy demands, for critical infrastructures, military installations, small rural communities, and large populations with limited water supplies. As part of a far-reaching strategic initiative, Sandia National Laboratories (SNL) presents herein a unique, three-pronged approach to integrate small modular reactors (SMRs) into microgrids, with the goal of providing economically-competitive, reliable, and secure energy to meet the nation’s needs. SNL’s triad methodology involves an innovative blend of smart microgrid technology, high performance computing (HPC), and advanced manufacturing (AM). In this report, Sandia’s current capabilities in those areas are summarized, as well as paths forward that will enable DOE to achieve its energy goals. In the area of smart grid/microgrid technology, Sandia’s current computational capabilities can model the entire grid, including temporal aspects and cyber security issues. Our tools include system development, integration, testing and evaluation, monitoring, and sustainment.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Design Load Analysis for Wave Energy Converters: Preprint

This study demonstrates a systematic methodology for establishing the design loads of a wave energy converter (WEC). The proposed design load methodology incorporates existing design guidelines, where they exist, and follows a typical design progression; namely, advancing from many, quick, order-of-magnitude accurate, conceptual stage design computations to a few, computationally intensive, high-fidelity, design validation simulations. The goal of the study is to streamline and document this process based on quantitative evaluations of the design loads' accuracy at each design step and consideration for the computational efficiency of the entire design process. For the WEC, loads, and site conditions considered, this study demonstrates an efficient and accurate methodology of evaluating the design loads.

16 TIDAL AND WAVE POWER↗

Adapting Code Verification Methodology to Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗

Petascale Computing Enabling Technologies Project Final Report

The Petascale Computing Enabling Technologies (PCET) project addressed challenges arising from current trends in computer architecture that will lead to large-scale systems with many more nodes, each of which uses multicore chips. These factors will soon lead to systems that have over one million processors. Also, the use of multicore chips will lead to less memory and less memory bandwidth per core. We need fundamentally new algorithmic approaches to cope with these memory constraints and the huge number of processors. Further, correct, efficient code development is difficult even with the number of processors in current systems; more processors will only make it harder. The goal of PCET was to overcome these challenges by developing the computer science and mathematical underpinnings needed to realize the full potential of our future large-scale systems. Our research results will significantly increase the scientific output obtained from LLNL large-scale computing resources by improving application scientist productivity and system utilization. Our successes include scalable mathematical algorithms that adapt to these emerging architecture trends and through code correctness and performance methodologies that automate critical aspects of application development as well as the foundations for application-level fault tolerance techniques. PCET's scope encompassed several research thrusts in computer science and mathematics: code correctness and performance methodologies, scalable mathematics algorithms appropriate for multicore systems, and application-level fault tolerance techniques. Due to funding limitations, we focused primarily on the first three thrusts although our work also lays the foundation for the needed advances in fault tolerance. In the area of scalable mathematics algorithms, our preliminary work established that OpenMP performance of the AMG linear solver benchmark and important individual kernels on Atlas did not match the predictions of our simple initial model. Our investigations demonstrated that a poor default memory allocation mechanism degraded performance. We developed a prototype NUMA library to provide generic mechanisms to overcome these issues, resulting in significantly improved OpenMP performance. After additional testing, we will make this library available to all users, providing a simple means to improve threading on LLNL's production Linux platforms. We also made progress on developing new scalable algorithms that target multicore nodes. We designed and implemented a new AMG interpolation operator with improved convergence properties for very low complexity coarsening schemes. This implementation will also soon be available to LLNL's application teams as part of the hypre library. We presented results for both topics in an invited plenary talk entitled 'Efficient Sparse Linear Solvers for Multi-Core Architectures' at the 2009 HPCMP Institutes Annual Meeting/CREATE Annual All-Hands Meeting. The interpolation work was summarized in a talk entitled 'Improving Interpolation for Aggressive Coarsening' at the 14th Copper Mountain Conference on Multigrid Methods and in a research paper that will appear in Numerical Linear Algebra with Applications. In the area of code correctness, we significantly extended our behavior equivalence class identification mechanism. Specifically, we not only demonstrated it works well at very large scales but we also added the ability to classify MPI tasks not only by function call traces, but also by specific call sites (source code line numbers) being executed by tasks. More importantly, we developed a new technique to determine relative logical execution progress of tasks in the equivalence classes by combining static analysis with our original dynamic approach. We applied this technique to a correctness issue that arose at 4096 tasks during the development of the new AMG interpolation operator discussed above. This scale isat the limit of effectiveness of production tools, but our technique quickly located the erroneous source code, demonstrating the power of understanding relationships between behavioral equivalence classes. This work is the subject of a paper recently accepted to SC09, as well as a presentation entitled 'Providing Order to Extreme Scale Debugging Chaos' given at the ParaDyn Week annual conference in College Park, MD. In addition to this theoretical extension, we have made significant progress in developing a front end for this tool set, and the front-end is now available on several of LLNL's largescale computing resources. In addition, we explored mechanisms to identify exact locations of erroneous MPI usage in application source code. In this work, we developed a new model that led to a highly efficient algorithm for detecting deadlock during dynamic software testing. This work was the subject of a well-received paper at ICS 2009 [4].

99 GENERAL AND MISCELLANEOUS↗