SEARCH · Search NASA

Results for “ABSTRACT”

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.

SourceResearch connectionFrom yearThrough year

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

At least 73 records · Page 4

All sources NASA NTRS DOE 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 NTRS2005

Concrete Model Checking with Abstract Matching and Refinement

We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed behaviors are feasible by definition. The method does not require an abstract transition relation to he generated, but instead executes the concrete transitions while storing abstract versions of the concrete states, as specified by a set of abstraction predicates. For each explored transition. the method checks, with the help of a theorem prover, whether there is any loss of precision introduced by abstraction. The results of these checks are used to decide termination or to refine the abstraction, by generating new abstraction predicates. If the (possibly infinite) concrete system under analysis has a finite bisimulation quotient, then the method is guaranteed to eventually explore an equivalent finite bisimilar structure. We illustrate the application of the approach for checking concurrent programs. We also show how a lightweight variant can be used for efficient software testing.

Pasareanu Corina S.↗

NASA NTRS1992

Generating effective project scheduling heuristics by abstraction and reconstitution

A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minimize project duration. This objective arises in nearly every large construction project--from software to hardware to buildings. Because such project scheduling problems are NP-hard, they are typically solved by branch-and-bound algorithms. In these algorithms, lower-bound duration estimates (admissible heuristics) are used to improve efficiency. One way to obtain an admissible heuristic is to remove (abstract) all resources and mutual exclusion constraints and then obtain the minimal project duration for the abstracted problem; this minimal duration is the admissible heuristic. Although such abstracted problems can be solved efficiently, they yield inaccurate admissible heuristics precisely because those constraints that are central to solving the original problem are abstracted. This paper describes a method to reconstitute the abstracted constraints back into the solution to the abstracted problem while maintaining efficiency, thereby generating better admissible heuristics. Our results suggest that reconstitution can make good admissible heuristics even better.

Janakiraman, Bhaskar↗

NASA NTRS1993

Generation and exploration of aggregation abstractions for scheduling and resource allocation

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Lowry, Michael R.↗

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 NTRS2002

Finding Feasible Abstract Counter-Examples

A strength of model checking is its ability to automate the detection of subtle system errors and produce traces that exhibit those errors. Given the high computational cost of model checking most researchers advocate the use of aggressive property-preserving abstractions. Unfortunately, the more aggressively a system is abstracted the more infeasible behavior it will have. Thus, while abstraction enables efficient model checking it also threatens the usefulness of model checking as a defect detection tool, since it may be difficult to determine whether a counter-example is feasible and hence worth developer time to analyze. We have explored several strategies for addressing this problem by extending an explicit-state model checker, Java PathFinder (JPF), to search for and analyze counter-examples in the presence of abstractions. We demonstrate that these techniques effectively preserve the defect detection ability of model checking in the presence of aggressive abstraction by applying them to check properties of several abstracted multi-threaded Java programs. These new capabilities are not specific to JPF and can be easily adapted to other model checking frameworks; we describe how this was done for the Bandera toolset.

Pasareanu, Corina S.↗

DOE OSTI2025

Abstraction of Hydride from Alkanes and Dihydrogen by the Perfluorotrityl Cation

Abstract Lewis acids play a central role in a large variety of chemical transformations. The reactivity of the strongest Lewis acids is typically studied in the context of affinity towards hard bases, such as fluoride or oxygenous species. Carbocations can be viewed as soft Lewis acids, possessing significant affinity for softer bases, such as hydride. This work presents the ambient‐temperature isolation of salts of the perfluorotrityl cation ((C 6 F 5 ) 3 C + or F 15 Tr + ) in combination with halogenated carborane anions. The F 15 Tr + cation exhibits remarkable hydride affinity, illustrated by the observation of hydride abstraction from dihydrogen, and of the rapid abstraction of hydride from −CH 2 −groups in alkanes. Theoretical studies support the favorability of hydride abstraction from dihydrogen, and indicate that the hydride abstraction from alkanes proceeds via a concerted hydride transfer process that is sensitive to steric effects.

Leong, Derek W. [Department of Chemistry Texas A&a↗

DOE OSTI2025

Abstraction of Hydride from Alkanes and Dihydrogen by the Perfluorotrityl Cation

Leong, Derek W. [Department of Chemistry Texas A&a↗

NASA NTRS1992

Generation and Exploitation of Aggregation Abstractions for Scheduling and Resource Allocation

Our research is investigating abstraction of computational theories for scheduling and resource allocation. These theories are represented in a variant of first order predicate calculus, parameterized multisorted logic, that facilitates specification of large problems. A particular problem is conceptually stated as a set of ground sentences that are consistent with a quantified theory. We are mainly investigating the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. We are also investigating the interaction of aggregation abstractions with the more thoroughly investigated abstractions of weakening operator preconditions. The purpose of the theories for aggregated demand/capacity is threefold: first, to answer queries about aggregate properties, such as gross feasibility; second, to reduce computational costs by using the solution of aggregate problems to guide the solution of detailed problems; and third, to facilitate reformulating theories to approximate problems for which there are efficient problem solving methods. We also describe novel methods for exploiting aggregation abstractions.

Linden, Theodore A.↗

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↗

NASA NTRS1997

Abstract Datatypes in PVS

PVS (Prototype Verification System) is a general-purpose environment for developing specifications and proofs. This document deals primarily with the abstract datatype mechanism in PVS which generates theories containing axioms and definitions for a class of recursive datatypes. The concepts underlying the abstract datatype mechanism are illustrated using ordered binary trees as an example. Binary trees are described by a PVS abstract datatype that is parametric in its value type. The type of ordered binary trees is then presented as a subtype of binary trees where the ordering relation is also taken as a parameter. We define the operations of inserting an element into, and searching for an element in an ordered binary tree; the bulk of the report is devoted to PVS proofs of some useful properties of these operations. These proofs illustrate various approaches to proving properties of abstract datatype operations. They also describe the built-in capabilities of the PVS proof checker for simplifying abstract datatype expressions.

Owre, Sam↗

NASA NTRS2001

NASA Patent Abstracts Bibliography: A Continuing Bibliography

This report lists reports, articles and other documents recently announced in the NASA STI Database. Several thousand inventions result each year from the aeronautical and space research supported by the National Aeronautics and Space Administration. The inventions having important use in government programs or significant commercial potential are usually patented by NASA. These inventions cover practically all fields of technology and include many that have useful and valuable commercial application. NASA inventions best serve the interests of the United States when their benefits are available to the public. In many instances, the granting of nonexclusive or exclusive licenses for the practice of these inventions may assist in the accomplishment of this objective. This bibliography is published as a service to companies, firms, and individuals seeking new, licensable products for the commercial market. The NASA Patent Abstracts Bibliography is a semiannual NASA publication containing comprehensive abstracts of NASA owned inventions covered by U.S. patents. The citations included in the bibliography arrangement of citations were originally published in NASA's Scientific and Technical Aerospace Reports (STAR) and cover STAR announcements made since May 1969. The citations published in this issue cover the period July 2000 through December 2000. This issue includes 10 major subject divisions separated into 76 specific categories and one general category/division. This scheme was devised in 1975 and revised in 1987 in lieu of the 34 category divisions which were utilized in supplements (01) through (06) covering STAR abstracts from May 1969 through January 1974. Each entry consists of a STAR citation accompanied by an abstract and, when appropriate, a key illustration taken from the patent or application for patent. Entries are arranged by subject category in ascending order. A typical citation and abstract presents the various data elements included in most records cited. This appears after the table of contents.

Source record↗

NASA NTRS2002

NASA Patent Abstracts Bibliography: A Continuing Bibliography

Several thousand inventions result each year from the aeronautical and space research supported by the National Aeronautics and Space Administration. The inventions having important use in government programs or significant commercial potential are usually patented by NASA. These inventions cover practically all fields of technology and include many that have useful and valuable commercial application. NASA inventions best serve the interests of the United States when their benefits are available to the public. In many instances, the granting of nonexclusive or exclusive licenses for the practice of these inventions may assist in the accomplishment of this objective. This bibliography is published as a service to companies, firms, and individuals seeking new, licensable products for the commercial market. The NASA Patent Abstracts Bibliography is a semiannual NASA publication containing comprehensive abstracts of NASA owned inventions covered by U.S. patents. The citations included in the bibliography arrangement of citations were originally published in NASA's Scientific and Technical Aerospace Reports (STAR) and cover STAR announcements made since May 1969. The citations published in this issue cover the period July 2001 through December 2001. This issue includes 10 major subject divisions separated into 76 specific categories and one general category/division. (See Table of Contents for the scope note of each category, under which are grouped appropriate NASA inventions.) This scheme was devised in 1975 and revised in 1987 in lieu of the 34 category divisions which were utilized in supplements (01) through (06) covering STAR abstracts from May 1969 through January 1974. Each entry consists of a STAR citation accompanied by an abstract and, when appropriate, a key illustration taken from the patent or application for patent. Entries are arranged by subject category in ascending order. A typical citation and abstract presents the various data elements included in most records cited. This appears after the table of contents.

Source record↗

NASA NTRS2003

NASA Patent Abstracts Bibliography: A Continuing Bibliography

Several thousand inventions result each year from research supported by the National Aeronautics and Space Administration. NASA seeks patent protection on inventions to which it has title if the invention has important use in government programs or significant commercial potential. These inventions cover a broad range of technologies and include many that have useful and valuable commercial application. NASA inventions best serve the interests of the United States when their benefits are available to the public. In many instances, the granting of nonexclusive or exclusive licenses for the practice of these inventions may assist in the accomplishment of this objective. This bibliography is published as a service to companies, firms, and individuals seeking new, licensable products for the commercial market. The NASA Patent Abstracts Bibliography is a semiannual NASA publication containing comprehensive abstracts of NASA owned inventions covered by U.S. patents. The citations included in the bibliography arrangement of citations were originally published in NASA's Scientific and Technical Aerospace Reports (STAR) and cover STAR announcements made since May 1969. The citations published in this issue cover the period July 2002 through. December 2002. This issue includes 10 major subject divisions separated into 76 specific categories and one general category/division. (See Table of Contents for the scope note of each category, under which are grouped appropriate NASA inventions.) This scheme was devised in 1975 and revised in 1987 in lieu of the 34 category divisions which were utilized in supplements (01) through (06) covering STAR abstracts from May 1969 through January 1974. Each entry consists of a STAR citation accompanied by an abstract and, when appropriate, a key illustration taken from the patent or application for patent. Entries are arranged by subject category in ascending order. A typical citation and abstract presents the various data elements included in most records cited. This appears after the table of contents.

Source record↗

NASA NTRS2004

Full Text Searching and Customization in the NASA ADS Abstract Service

The NASA-ADS Abstract Service provides a sophisticated search capability for the literature in Astronomy, Planetary Sciences, Physics/Geophysics, and Space Instrumentation. The ADS is funded by NASA and access to the ADS services is free to anybody worldwide without restrictions. It allows the user to search the literature by author, title, and abstract text. The ADS database contains over 3.6 million references, with 965,000 in the Astronomy/Planetary Sciences database, and 1.6 million in the Physics/Geophysics database. 2/3 of the records have full abstracts, the rest are table of contents entries (titles and author lists only). The coverage for the Astronomy literature is better than 95% from 1975. Before that we cover all major journals and many smaller ones. Most of the journal literature is covered back to volume 1. We now get abstracts on a regular basis from most journals. Over the last year we have entered basically all conference proceedings tables of contents that are available at the Harvard Smithsonian Center for Astrophysics library. This has greatly increased the coverage of conference proceedings in the ADS. The ADS also covers the ArXiv Preprints. We download these preprints every night and index all the preprints. They can be searched either together with the other abstracts or separately. There are currently about 260,000 preprints in that database. In January 2004 we have introduced two new services, full text searching and a personal notification service called "myADS". As all other ADS services, these are free to use for anybody.

Eichhorn, G.↗

NASA NTRS1976

NASA patent abstracts bibliography: A continuing bibliography. Section 2: Indexes (supplement 08)

This bibliography is issued in two sections: Section 1 - Abstracts, and Section 2 - Indexes. This issue of the Abstract Section cites 180 patents and applications for patents introduced into the NASA scientific and technical information system during the period July 1975 through December 1975. Each entry in the Abstract Section consists of a citation, an abstract, and, in most cases, a key illustration selected from the patent or application for patent. This issue of the Index Section contains entries for 2,905 patents and applications for patent citations covering the period May 1969 through December 1975. The Index Section contains five indexes -- subject, inventor, source, number, and accession number.

Source record↗

NASA NTRS1986

Intuitive reasoning about abstract and familiar physics problems

Previous research has demonstrated that many people have misconceptions about basic properties of motion. Two experiments examined whether people are more likely to produce dynamically correct predictions about basic motion problems involving situations with which they are familiar, and whether solving such problems enhances performance on a subsequent abstract problem. In experiment 1, college students were asked to predict the trajectories of objects exiting a curved tube. Subjects were more accurate on the familiar version of the problem, and there was no evidence of transfer to the abstract problem. In experiment 2, two familiar problems were provided in an attempt to enhance subjects' tendency to extract the general structure of the problems. Once again, they gave more correct responses to the familiar problems but failed to generalize to the abstract problem. Formal physics training was associated with correct predictions for the abstract problem but was unrelated to performance on the familiar problems.

Kaiser, Mary Kister↗

NASA NTRS1990

Masking failures of multidimensional sensors (extended abstract)

When a computer monitors a physical process, the computer uses sensors to determine the values of the physical variables that represent the state of the process. A sensor can sometimes fail, however, and in the worst case report a value completely unrelated to the true physical value. The work described is motivated by a methodology for transforming a process control program that can not tolerate sensor failure into one that can. In this methodology, a reliable abstract sensor is created by combining information from several real sensors that measure the same physical value. To be useful, an abstract sensor must deliver reasonably accurate information at reasonable computational cost. Sensors are considered that deliver multidimensional values (e.g., location or velocity in three dimensions, or both temperature and pressure). Geometric techniques are used to derive upper bounds on abstract sensor accuracy and to develop efficient algorithms for implementing abstract sensors.

Chew, Paul↗