Search NASA⌕ Search

SEARCH · Search NASA

Results for “Abstract Interpretation”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Interpreting Abstract Interpretations in Membership Equational Logic

We present a logical framework in which abstract interpretations can be naturally specified and then verified. Our approach is based on membership equational logic which extends equational logics by membership axioms, asserting that a term has a certain sort. We represent an abstract interpretation as a membership equational logic specification, usually as an overloaded order-sorted signature with membership axioms. It turns out that, for any term, its least sort over this specification corresponds to its most concrete abstract value. Maude implements membership equational logic and provides mechanisms to calculate the least sort of a term efficiently. We first show how Maude can be used to get prototyping of abstract interpretations "for free." Building on the meta-logic facilities of Maude, we further develop a tool that automatically checks and abstract interpretation against a set of user-defined properties. This can be used to select an appropriate abstract interpretation, to characterize the specified loss of information during abstraction, and to compare different abstractions with each other.

Fischer, Bernd↗
NASA NTRS2019

Static Analysis Using Abstract Interpretation

Lecture about abstract interpretation. This lecture starts with a brief introduction to validation and verification using formal methods. It then demonstrates IKOS (Inference Kernel for Open Static Analyzers), a static analyzer for C/C++ based on Abstract Interpretation. Then, it describes in details the theory of Abstract Interpretation, a mathematical framework to over-approximate the reachable states of a program.

Arthaud, Maxime↗
NASA NTRS1991

On the Power of Abstract Interpretation

Increasingly sophisticated applications of static analysis place increased burden on the reliability of the analysis techniques. Often, the failure of the analysis technique to detect some information my mean that the time or space complexity of the generated code would be altered. Thus, it is important to precisely characterize the power of static analysis techniques. We follow the approach of Selur et. al. who studied the power of strictness analysis techniques. Their result can be summarized by saying 'strictness analysis is perfect up to variations in constants.' In other words, strictness analysis is as good as it could be, short of actually distinguishing between concrete values. We use this approach to characterize a broad class of analysis techniques based on abstract interpretation including, but not limited to, strictness analysis. For the first-order case, we consider abstract interpretations where the abstract domain for data values is totally ordered. This condition is satisfied by Mycroft's strictness analysis that of Sekar et. al. and Wadler's analysis of list-strictness. For such abstract interpretations, we show that the analysis is complete in the sense that, short of actually distinguishing between concrete values with the same abstraction, it gives the best possible information. We further generalize these results to typed lambda calculus with pairs and higher-order functions. Note that products and function spaces over totally ordered domains are not totally ordered. In fact, the notion of completeness used in the first-order case fails if product domains or function spaces are added. We formulate a weaker notion of completeness based on observability of values. Two values (including pairs and functions) are considered indistinguishable if their observable components are indistinguishable. We show that abstract interpretation of typed lambda calculus programs is complete up to this notion of indistinguishability. We use denotationally-oriented arguments instead of the detailed operational arguments used by Selur et. al.. Hence, our proofs are much simpler. They should be useful for further future improvements.

Reddy, Uday S.↗
NASA NTRS2017

Static Analysis Using Abstract Interpretation

Short presentation about static analysis and most particularly abstract interpretation. It starts with a brief explanation on why static analysis is used at NASA. Then, it describes the IKOS (Inference Kernel for Open Static Analyzers) tool chain. Results on NASA projects are shown. Several well known algorithms from the static analysis literature are then explained (such as pointer analyses, memory analyses, weak relational abstract domains, function summarization, etc.). It ends with interesting problems we encountered (such as C++ analysis with exception handling, or the detection of integer overflow).

Static Analysis↗
NASA NTRS2018

An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs

This paper presents an abstract interpretation framework for the round-off error analysis of floating-point programs. This framework defines a parametric abstract analysis that computes, for each combination of ideal and floating-point execution path of the program, a sound over-approximation of the accumulated floating-point round-off error that may occur. In addition, a Boolean expression that characterizes the input values leading to the computed error approximation is also computed. An abstraction on the control flow of the program is proposed to mitigate the explosion of the number of elements generated by the analysis. Additionally, a widening operator is defined to ensure the convergence of recursive functions and loops. An instantiation of this framework is implemented in the prototype tool PRECiSA that generates formal proof certificates stating the correctness of the computed round-off errors.

Titolo, Laura↗
NASA NTRS2014

IKOS: A Framework for Static Analysis based on Abstract Interpretation (Tool Paper)

The RTCA standard (DO-178C) for developing avionic software and getting certification credits includes an extension (DO-333) that describes how developers can use static analysis in certification. In this paper, we give an overview of the IKOS static analysis framework that helps developing static analyses that are both precise and scalable. IKOS harnesses the power of Abstract Interpretation and makes it accessible to a larger class of static analysis developers by separating concerns such as code parsing, model development, abstract domain management, results management, and analysis strategy. The benefits of the approach is demonstrated by a buffer overflow analysis applied to flight control systems.

Abstract Interpretation↗
DOE OSTI2023

Sterol methyltransferases in uncultured bacteria complicate eukaryotic biomarker interpretations

Abstract Sterane molecular fossils are broadly interpreted as eukaryotic biomarkers, although diverse bacteria also produce sterols. Steranes with side-chain methylations can act as more specific biomarkers if their sterol precursors are limited to particular eukaryotes and are absent in bacteria. One such sterane, 24-isopropylcholestane, has been attributed to demosponges and potentially represents the earliest evidence for animals on Earth, but enzymes that methylate sterols to give the 24-isopropyl side-chain remain undiscovered. Here, we show that sterol methyltransferases from both sponges and yet-uncultured bacteria function in vitro and identify three methyltransferases from symbiotic bacteria each capable of sequential methylations resulting in the 24-isopropyl sterol side-chain. We demonstrate that bacteria have the genomic capacity to synthesize side-chain alkylated sterols, and that bacterial symbionts may contribute to 24-isopropyl sterol biosynthesis in demosponges. Together, our results suggest bacteria should not be dismissed as potential contributing sources of side-chain alkylated sterane biomarkers in the rock record.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

A robust estimator of mutual information for deep learning interpretability

Abstract We develop the use of mutual information (MI), a well-established metric in information theory, to interpret the inner workings of deep learning (DL) models. To accurately estimate MI from a finite number of samples, we present GMM-MI (pronounced ‘Jimmie’), an algorithm based on Gaussian mixture models that can be applied to both discrete and continuous settings. GMM-MI is computationally efficient, robust to the choice of hyperparameters and provides the uncertainty on the MI estimate due to the finite sample size. We extensively validate GMM-MI on toy data for which the ground truth MI is known, comparing its performance against established MI estimators. We then demonstrate the use of our MI estimator in the context of representation learning, working with synthetic data and physical datasets describing highly non-linear processes. We train DL models to encode high-dimensional data within a meaningful compressed (latent) representation, and use GMM-MI to quantify both the level of disentanglement between the latent variables, and their association with relevant physical quantities, thus unlocking the interpretability of the latent representation. We make GMM-MI publicly available in this GitHub repository.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

The Andromeda gamma-ray excess: background systematics of the millisecond pulsars and dark matter interpretations

ABSTRACT Since the discovery of an excess in gamma rays in the direction of M31, its cause has been unclear. Published interpretations focus on dark matter or stellar related origins. Studies of a similar excess in the Milky Way centre motivate a correlation of the spatial morphology of the signal with the distribution of stellar mass in M31. However, a robust determination of the best theory for the observed excess emission is challenging due to uncertainties in the astrophysical gamma-ray foreground model. We perform a spectro-morphological analysis of the M31 gamma-ray excess using state-of-the-art templates for the distribution of stellar mass in M31 and novel astrophysical foreground models for its sky region. We construct maps for the old stellar populations of M31 based on data from the PAndAS survey and carefully remove the foreground stars. We also produce improved astrophysical foreground models via novel image inpainting techniques based on machine learning methods. Our stellar maps, mimicking the location of a population of millisecond pulsars in the bulge of M31, reach a 5.4σ significance, making them as strongly favoured as the simple phenomenological models usually considered in the literature, e.g. disc-like templates. This detection is robust to generous variations of the astrophysical foreground model. Once the stellar templates are included in the astrophysical model, we show that the dark matter annihilation interpretation of the signal is unwarranted. We demonstrate that about one million unresolved millisecond pulsars naturally explain the observed gamma-ray luminosity per stellar mass, energy spectrum, and stellar bulge-to-disc flux ratio.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Knowledge-guided learning with curated prior genetic biomarkers for robust model interpretation

Abstract Motivation Knowledge-guided learning offers effective and robust model training strategies in data-scarce settings by incorporating established domain knowledge, thereby enhancing generalization, robustness, and interpretability. By contrast, conventional deep learning approaches rely purely on data-driven learning, which can limit robust model interpretability, particularly in high-dimensional settings with limited size samples. In computational biology, knowledge-guided learning has primarily leveraged network- and structural-based knowledge, leading to biologically interpretable representations and enhanced predictive performance compared to conventional approaches. However, curated biomarkers, one of the most accessible forms of biological knowledge, remain largely unexplored within knowledge-guided paradigms. Results In this study, we propose a model-agnostic training paradigm, Biomarker-driven Explainable Prior-guided Learning (BioExPL), that can be applied to any neural networks that incorporates curated prior knowledge. BioExPL enforces neural networks to reflect curated biomarker priors in their latent representations through a novel knowledge-alignment loss. BioExPL consistently demonstrated significantly improved predictive performance and enhanced model interpretability with minimized computational overhead in simulation studies and intensive experiments on multiple cancer datasets. BioExPL not only integrates prior curated knowledge into the model but also accurately identifies unknown associated signals additionally. BioExPL is model-agnostic and domain-independent, enabling its integration into diverse neural network architectures. Availability and implementation The open-source is publicly available at: https://github.com/datax-lab/BioExPL.

Baek, Beomsu [Department of Computer Science, Univ↗
DOE OSTI2021

Identifying Key Drivers of Wildfires in the Contiguous US Using Machine Learning and Game Theory Interpretation

Abstract Understanding the complex interrelationships between wildfire and its environmental and anthropogenic controls is crucial for wildfire modeling and management. Although machine learning (ML) models have yielded significant improvements in wildfire predictions, their limited interpretability has been an obstacle for their use in advancing understanding of wildfires. This study builds an ML model incorporating predictors of local meteorology, land‐surface characteristics, and socioeconomic variables to predict monthly burned area at grid cells of 0.25° × 0.25° resolution over the contiguous United States. Besides these predictors, we construct and include predictors representing the large‐scale circulation patterns conducive to wildfires, which largely improves the temporal correlations in several regions by 14%–44%. The Shapley additive explanation is introduced to quantify the contributions of the predictors to burned area. Results show a key role of longitude and latitude in delineating fire regimes with different temporal patterns of burned area. The model captures the physical relationship between burned area and vapor pressure deficit, relative humidity (RH), and energy release component (ERC), in agreement with the prior findings. Aggregating the contribution of predictor variables of all the grids by region, analyses show that ERC is the major contributor accounting for 14%–27% to large burned areas in the western US. In contrast, there is no leading factor contributing to large burned areas in the eastern US, although large‐scale circulation patterns featuring less active upper‐level ridge‐trough and low RH two months earlier in winter contribute relatively more to large burned areas in spring in the southeastern US.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1991

Head-Strictness is Not a Monotonic Abstract Property

A property P of a language is said to be definable by abstract interpretation if there is a monotonic map abs from the domain of standard semantics to an abstract domain A of finite height, and a partition of the abstract domain into two parts A(sub p) and A(sub non p), such that any value has property P if and only if abs maps it to an element of A(sub p). Head-strictness is a property of functions over lists which asserts, roughly speaking, that whenever the function looks at the tail of a list, it looks at the head of the tail. We prove that head-strictness is not definable by abstract interpretation. We then present a non-monotonic abstract interpretation for head-strictness and prove its safety.

Kamin, Samuel↗
DOE OSTI2024

Constrained HRT Surfaces and their Entropic Interpretation

Abstract Consider two boundary subregionsAandBthat lie in a common boundary Cauchy surface, and consider also the associated HRT surfaceγ B forB. In that context, the constrained HRT surfaceγ A:B can be defined as the codimension-2 bulk surface anchored toAthat is obtained by a maximin construction restricted to Cauchy slices containingγ B . As a result,γ A:B is the union of two pieces,$$ {\gamma}_{A:B}^B $$ γ A : B B and$$ {\gamma}_{A:B}^{\overline{B}} $$ γ A : B B ¯ lying respectively in the entanglement wedges ofBand its complement$$ \overline{B} $$ B ¯ . Unlike the area$$ \mathcal{A}\left({\gamma}_A\right) $$ A γ A of the HRT surfaceγ A , at least in the semiclassical limit, the area$$ \mathcal{A}\left({\gamma}_{A:B}\right) $$ A γ A : B ofγ A:B commutes with the area$$ \mathcal{A}\left({\gamma}_B\right) $$ A γ B ofγ B . To study the entropic interpretation of$$ \mathcal{A}\left({\gamma}_{A:B}\right) $$ A γ A : B , we analyze the Rényi entropies of subregionAin a fixed-area state of subregionB. We use the gravitational path integral to show that then ≈1 Rényi entropies are then computed by minimizing$$ \mathcal{A}\left({\gamma}_A\right) $$ A γ A over spacetimes defined by a boost angle conjugate to$$ \mathcal{A}\left({\gamma}_B\right) $$ A γ B . In the case where the pieces$$ {\gamma}_{A:B}^B $$ γ A : B B and$$ {\gamma}_{A:B}^{\overline{B}} $$ γ A : B B ¯ intersect at a constant boost angle, a geometric argument shows that then ≈1 Rényi entropy is then given by$$ \frac{\mathcal{A}\left({\gamma}_{A:B}\right)}{4G} $$ A γ A : B 4 G . We discuss how then ≈1 Rényi entropy differs from the von Neumann entropy due to a lack of commutativity of then→ 1 andG →0 limits. We also discuss how the behaviour changes as a function of the width of the fixed-area state. Our results are relevant to some of the issues associated with attempts to use standard random tensor networks to describe time dependent geometries.

Physics↗
NASA NTRS2009

Proof Compression and the Mobius PCC Architecture for Embedded Devices

The EU Mobius project has been concerned with the security of Java applications, and of mobile devices such as smart phones that execute such applications. In this talk, I'll give a brief overview of the results obtained on on-device checking of various security-related program properties. I'll then describe in more detail how the concept of certified abstract interpretation and abstraction-carrying code can be applied to polyhedral-based analysis of Java byte code in order to verify properties pertaining to the usage of resources of a down-loaded application. Particular emphasis has been on finding ways of reducing the size of the certificates that accompany a piece of code.

Jensen, Thomas↗