Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “software bug detection”

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.

FPDetect: Efficient Reasoning About Stencil Programs Using Selective Direct Evaluation

We present FPDetect, a low-overhead approach for detecting logical errors and soft errors affecting stencil computations without generating false positives. We develop an offline analysis that tightly estimates the number of floating-point bits preserved across stencil applications. This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. FPDetect helps synthesize error detectors customized for user-specified levels of accuracy and coverage. FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach.

97 MATHEMATICS AND COMPUTING↗

Overcoming Challenges to Continuous Integration in HPC

Continuous integration (CI) has become a ubiquitous practice in modern software development, with major code hosting services offering free automation on popular platforms. CI offers major benefits, as it enables detecting bugs in code prior to committing changes. While high-performance computing (HPC) research relies heavily on software, HPC machines are not considered “common” platforms. This presents several challenges that hinder the adoption of CI in HPC environments, making it difficult to maintain bug-free HPC projects, and resulting in adverse effects on the research community. Here we explore the challenges that impede HPC CI, such as hardware diversity, security, isolation, administrative policies, and non-standard authentication, environments, and job submission mechanisms. We propose several solutions that could enhance the quality of HPC software and the experience of developers. Implementing these solutions would require significant changes at HPC centers, but if these changes are made, it would ultimately enable faster and better science.

97 MATHEMATICS AND COMPUTING↗

Automated Vulnerability Detection for Compiled Smart Grid Software

While testing performed with proper experimental controls can provide scientifically quantifiable evidence that software does not contain unintentional vulnerabilities (bugs), it is insufficient to show that intentional vulnerabilities exist, and impractical to certify devices for the expected long lifetimes of use. For both of these needs, rigorous analysis of the software itself is essential. Automated software behavior computation applies rigorous static software analysis methods based on function extraction (FX) to compiled software to detect vulnerabilities, intentional or unintentional, and to verify critical functionality. This analysis is based on the compiled firmware, takes into account machine precision, and does not rely on heuristics or approximations early in the analysis.

99 GENERAL AND MISCELLANEOUS↗

Detecting Data-Races in High-Performance Computing

High-performance computing is susceptible to data-race bugs. Data races occur when sequences of computed events do not happen in the intended order, a significant barrier to the integrity of parallel programs using shared-memory architectures. Many approaches to data-race detection are based on traditional static-analysis techniques that typically execute on a program’s source code or control-flow graph (the graphical representation of all possible orders of events in the execution of a program). Similar to classical data-flow analyses, such tools can produce false alarms that report spurious race conditions on error free programs. We have developed a software verification technique that requires as input only a program’s source code and can automatically detect a data-race bug which definitely exists, determine that a program is definitely data-race free, or report that it cannot determine either of the two cases.

97 MATHEMATICS AND COMPUTING↗

Preventing Run-Time Bugs at Compile-Time Using Advanced C++

When writing software, we develop algorithms that tell the computer what to do at run-time. Our solutions are easier to understand and debug when they are properly modeled using class hierarchies, enumerations, and a well-factored API. Unfortunately, even with these design tools, we end up having to debug our programs at run-time. Worse still, debugging an embedded system changes its dynamics, making it tough to find and fix concurrency issues. This paper describes techniques using C++ to detect run-time bugs *at compile time*. A concurrency library, developed at Fermilab, is used for examples in illustrating these techniques.

43 PARTICLE ACCELERATORS↗

Lazy Shadowing - An Adaptive, Power-Aware, Resiliency Framework for Extreme Scale Computing

The major goal of the project was to examine the problem of resilience in exascale systems via mechanisms that minimize the impact of server crashes resulting from both permanent faults and transient errors or subtle time-dependent bugs in hardware or software. Shadowing was proposed as the main technique for accomplishing this in the proposal, wherein some replicas of the application are run at much lower power and opportunistically speeded up during periods of low activity of the main or when the main fails. A related goal of the project was to detect the errors early so that program crashes could be avoided or the scope of the rollbacks could be limited.

97 MATHEMATICS AND COMPUTING↗

IoT Firmware Emulation and Its Security Application in Fuzzing: A Critical Revisit

As IoT devices with microcontroller (MCU)-based firmware become more common in our lives, memory corruption vulnerabilities in their firmware are increasingly targeted by adversaries. Fuzzing is a powerful method for detecting these vulnerabilities, but it poses unique challenges when applied to IoT devices. Direct fuzzing on these devices is inefficient, and recent efforts have shifted towards creating emulation environments for dynamic firmware testing. However, unlike traditional software, firmware interactions with peripherals that are significantly more diverse presents new challenges for achieving scalable full-system emulation and effective fuzzing. This paper reviews 27 state-of-the-art works in MCU-based firmware emulation and its applications in fuzzing. Instead of classifying existing techniques based on their capabilities and features, we first identify the fundamental challenges faced by firmware emulation and fuzzing. We then revisit recent studies, organizing them according to the specific challenges they address, and discussing how each specific challenge is addressed. We compare the emulation fidelity and bug detection capabilities of various techniques to clearly demonstrate their strengths and weaknesses, aiding users in selecting or combining tools to meet their needs. Finally, we highlight the remaining technical gaps and point out important future research directions in firmware emulation and fuzzing.

Zhou, Wei (ORCID:0000000178340839)↗

StructuredFuzzer: Fuzzing Structured Text-Based Control Logic Applications

Rigorous testing methods are essential for ensuring the security and reliability of industrial controller software. Fuzzing, a technique that automatically discovers software bugs, has also proven effective in finding software vulnerabilities. Unsurprisingly, fuzzing has been applied to a wide range of platforms, including programmable logic controllers (PLCs). However, current approaches, such as coverage-guided evolutionary fuzzing implemented in the popular fuzzer American Fuzzy Lop Plus Plus (AFL++), are often inadequate for finding logical errors and bugs in PLC control logic applications. They primarily target generic programming languages like C/C++, Java, and Python, and do not consider the unique characteristics and behaviors of PLCs, which are often programmed using specialized programming languages like Structured Text (ST). Furthermore, these fuzzers are ill suited to deal with complex input structures encapsulated in ST, as they are not specifically designed to generate appropriate input sequences. This renders the application of traditional fuzzing techniques less efficient on these platforms. To address this issue, this paper presents a fuzzing framework designed explicitly for PLC software to discover logic bugs in applications written in ST specified by the IEC 61131-3 standard. The proposed framework incorporates a custom-tailored PLC runtime and a fuzzer designed for the purpose. We demonstrate its effectiveness by fuzzing a collection of ST programs that were crafted for evaluation purposes. We compare the performance against a popular fuzzer, namely, AFL++. The proposed fuzzing framework demonstrated its capabilities in our experiments, successfully detecting logic bugs in the tested PLC control logic applications written in ST. On average, it was at least 83 times faster than AFL++, and in certain cases, for example, it was more than 23,000 times faster.

47 OTHER INSTRUMENTATION↗

The Configuration Space Toolkit (C-Space Toolkit or CSTK) Ver. 2.5 beta

The C-Space Toolkit provides a software library that makes it easier to program motion planning, simulation, robotics, and virtual reality codes using the Configuration Space abstraction. Key functionality (1) enables the user to special create representations of movable and stationary rigid geometric objects, and (2) perform fast distance, interference (clash) detection, collision detection, closest-feature pairs, and contact queries in terms of object configuration. Not only can queries be computed at any given point in configuration space, but they can be done exactly over linear-translational path segments and approximately for rotational path segments. Interference detection and distance computations can be done with respect to the Minkowski sum of the original geometry and a piece of convex geometry. The Toolkit takes as raw model input (1) collections of convex polygons that form the boundaries of models and (2) convex polyhedra, cones, cylinders, and discs that are models and model components. Configurations are given in terms of homogeneous transforms. A simple OpenGL-based system for displaying and animating the geometric objects is included in the implementation. This version, 2.5 Beta, incorporates feature additions and enhancements, improvements in algorithms, improved robustness, bug fixes and cleaned-up source code, better compliance with standards and recent programming convention, changes to the build process for the software, support for more recent hardware and software platforms, and improvements to documentation and source-code comments.

Chen, Pang-Chieh↗

Using Eye-Tracking to Quantify Reverse Engineering Expertise

Software reverse engineering (RE) requires analysts to closely read and make decisions about code. Little is known about what makes an analyst successful, making it difficult to train new analysts or design tools to augment existing ones. The goal of this project was to quantify the eye movement behaviors supporting RE and code comprehension more generally. We applied eye-tracking methods from the language comprehension literature to understand where analysts direct their attention over time when completing tasks (e.g., function identification, bug detection). Across three studies, we manipulated aspects of code hypothesized to impact comprehension (e.g., variable name meaningfulness, code complexity) and presentation methods (e.g., line-by-line, free viewing, gaze-contingent moving window) to understand effects on accuracy and gaze patterns. Results showed clear benefits of meaningful variable names, and effects of expertise on global and line-specific viewing patterns. Findings could inspire empirically-supported tool or analytic adaptations that help to reduce analyst workload.

97 MATHEMATICS AND COMPUTING↗

pysrim: Automation, Analysis, and Plotting of SRIM Calculations

The behavior of ions traveling through a material is of great interest to many fields. For instance, radiation damage in nuclear materials and ion beam modification of materials are most concerned with understanding the formation and evolution of defects along the ion path (Was 2016). Some of the important properties that can be gleaned from investigating the initial damage from the ion include: numbers of interstitials and vacancies produced, energy deposited per unit length to electrons and atomic nuclei, track diameter, and implanted ion profile. These properties enable further simulations and allow computing a common unit of radiation damage dose, displacements per atom (dpa), which can be used to compare irradiation experiments with different ions (Backman et al. 2013) (Stoller et al. 2013). Additionally, the ejection of materials near the surface due to incident ions is important to sputtering and ion-beam analysis techniques, such as elastic recoil detection analysis (ERDA) and secondary ion mass spectrometry (SIMS) (Vickerman and Gilmore 2011). The interaction of ions within a material can be broken into two parts: electronic and nuclear stopping. Electronic stopping is the energy lost from the ion due to inelastic collisions with electrons along its path. Nuclear stopping is the energy lost due to elastic collisions between the ion and atomic nuclei within the material. The Stopping and Range of Ions in Matter (SRIM) code is a well known software in the radiation damage and ion-beam communities that allows the simulation, via Monte Carlo, of ions through a material by modeling the energy transfer through electronic and nuclear stopping (J. F. Ziegler, Ziegler, and Biersack 2010). SRIM was originally developed in 1985 and has had numerous updates on the electronic stopping powers since then, with the nuclear stopping well explained by the ZBL potential (J. F. Ziegler 1988). The executable SRIM is free to use for non-commercial use but the source code is not available to the community despite requests. While SRIM is a scientifically accurate code it does not get updated frequently and has many bugs from a usability standpoint.

97 MATHEMATICS AND COMPUTING↗

High Energy Yield Distributed Architecture for Large Commercial and Utility-Scale PV Systems

Photovoltaic energy has come a long way from its early days when small cells were fabricated in the labs in the early 50s. While it took a long time for PV modules to mature into what we now see in the market and in rooftops across the world, the power electronics has been lagging behind & was always the weakest point in the PV plant, being responsible for the majority of failures & robbing the PV plants of their full potential by losing precious Watts in the process of converting power from DC to AC. Since the early days of PV power, it has been recognized that the modules need to operate at their maximum power point in order to extract as much power as is available from the PV modules at a given time of day and year. Numerous maximum power point devices were developed to do just this. While effective at extracting as much power as they can, soon after there was a realization that in a PV installation where a central inverter is used, many losses occur, hence energy yield losses. This has led to thinking about alternative architectures where the maximum power point tracking (MPPT) is performed much closer to the modules rather than at a central inverter. Several architectures were proposed ranging from a microinverter, microconverter, string inverter, string optimizer, and to a multi-string inverter or optimizer. While these architectures promise to increase the energy yield by 5% to 25% (depending where MPPT is located), & recovering losses due to shading, soiling, mismatch … there were no real studies and implementations in the field to corroborate these numbers. The program that GE Global Research proposed & received funding for is aimed at a type of distributed architectures, namely the dc architectures where only the MPPT function is distributed across the PV plant. Further, the project is concerned with choosing the right architecture for large scale commercial & utility scale plants but not residential installations. Findings from Task 1- Define Requirements & Develop Architecture- showed that for large scale commercial & utility PV plants, locating the MPPT at the string level with a string size of >3kW is the most cost effective solution & that the increase in energy yield of 6% to 8% is more than enough to make up for the increased cost due to additional power electronics. Our study also shows that in addition to an increase in energy yield, having a dc/dc converter at the string level brings additional benefits such as increased array visibility, allowing for increased monitoring and diagnostics; high and constant dc bus voltage which allows for reducing losses further and optimizing the inverter; and ability to detect ground and arc faults. Task 2 focused on designing a suitable dc/dc converter that meets the requirements defined in Task 1: Efficiency, Cost, & Reliability. For this task, we surveyed and simulated all candidate topologies known by the practitioners in the field. We also generated a novel topology, simulated it, & compared it to existing topologies. Our novel topology being a partial power processing converter came out on top due to its simplicity (fewer parts), it high efficiency, its reliability, and its lower cost. In the remaining tasks of the project, we built the hardware, tested it first in the lab, then in the field and once we worked out all the bugs and issues and were confident our system was robust, we installed it on the rooftop and started collecting the data by mid-Q3 2012. We shared our work with the scientific community in the form of conference & Journal papers, hence contributing to the general understanding of this technology area. The methods, techniques, and hardware developed under this project have all been tested in the field over long periods of time, and under many conditions and have been shown to be robust and reliable. The converters built and developed under this program have been in operation in the field since mid-June 2012, and no hardware failures have been recorded. While some software issues have been seen, none have been showstoppers. The cost analysis of the hardware showed that it meets the cost target set in the requirement document developed in the trade-off study. Improving the performance of solar installations for commercial and utility scale plants contributes to reducing their cost of ownership, hence spreading them to a larger section of the society and making them affordable. Our project contributed to the understanding of the distributed architectures, showed that PV plants’ cost of electricity can be reduced through additional power electronics which allows for harvesting more energy from the plant. When the project started in 2009, the cost of PV energy was still high, hence there was a real need to increase the energy yield, hence reduce the levelized cost of electricity (LCOE). While costs have come down significantly, the need for increasing the energy yield is still relevant, hence the project results, hardware, and techniques developed are still pertinent today. By taking this project from concept to rooftop demonstration, we showed that the technology is mature enough, robust enough, and has the potential to be used by many more customers, hence benefiting the public in general through the spread of PV energy, which ultimately contributes to reducing our dependency on fossil fuel, improving the environment, and creating more jobs.

14 SOLAR ENERGY↗