Search NASA⌕ Search

SEARCH · Search NASA

Results for “Proving”

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 37 records · Page 2

Building Collaborative Proving Grounds for R2O2R – NASA/CCMC - NOAA/Space Weather Prediction Testbed (SWPT) Partnership

In 2016 and 2019, Executive Orders were signed by the President to prepare the Nation for Space Weather Events. At the forefront of being able to achieve this goal is the necessity to accelerate and enhance R2O2R. To drive this initiative, the Space Weather R2O2R Framework, initially led by NOAA and NASA, was developed. At the very center of the framework is the Space Weather Proving Grounds effort that will allow various institutions to collaborate, share, and advance their space weather modeling and simulation capabilities. The first of these Proving Grounds is the Architecture for Collaborative Evaluation (ACE) environment shared between the Community Coordinated Modeling Center (CCMC) at NASA and the Space Weather Prediction Testbed (SWPT) at NOAA. Since 2019, the ACE environment has been set up on the AWS cloud where it utilizes AWS cloud services and Docker containerization technology.

T. Tsui↗

Overview of Primitive Volatile Explorer (PrOVE) Cubesat or Smallsat Concept

Here we describe the Primitive Object Volatile Explorer (PrOVE), a smallsat mission concept to study the surface structure and volatile inventory of comets in their perihelion passage phase when volatile activity is near peak. CubeSat infrastructure imposes limits on propulsion systems, which are compounded by sensitivity to the spacecraft disposal state from the launch platform and potential launch delays. We propose circumventing launch platform complications by using waypoints in space to park a deep space SmallSat or CubeSat while awaiting the opportunity to enter a trajectory to flyby a suitable target. In our Planetary Science Deep Space SmallSat Studies (PSDS3) project, we investigated scientific goals, waypoint options, potential concept of operations (ConOps) for periodic and new comets, spacecraft bus infrastructure requirements, launch platforms, and mission operations and phases. Our payload would include two low-risk instruments: a visible image (VisCAM) for 5-10 m resolution surface maps; and a highly versatile multispectral Comet CAMera (ComCAM) will measure 1) H2O, CO2, CO, and organics non-thermal fluorescence signatures in the 2-5 µm MWIR, and 2) 7-10 and 8-14 µm thermal (LWIR) emission. This payload would return unique data not obtainable from ground-based telescopes and complement data from Earth-orbiting observatories. Thus, the PrOVE mission would (1) acquire visible surface maps, (2) investigate chemical heterogeneity of a comet nucleus by quantifying volatile species abundance and changes with solar insolation, (3) map the spatial distribution of volatiles and determine any variations, and (4) determine the frequency and distribution of outbursts.

Zucherman, Aaron↗

Enhancing Local Grid Resilience with Small Hydropower Hybrids: Proving the concept through demonstration, simulation, and analysis with Idaho Falls Power

Large hydropower, connected to the transmission system and typically possessing significant ability to balance grid frequency, has long been central to black start plans in regions where it is present. Small hydropower possesses most of the attributes required for black start but is often connected to distribution or sub-transmission systems and has less ability to balance grid frequency. Integrating energy storage such as batteries or ultracapacitors increases the combined asset’s ability to balance frequency. This asset integration enables a bottom-up grid restoration paradigm in which critical electric loads on the local distribution system can be powered even when the regional transmission system is down. This report presents a field demonstration conducted with Idaho Falls Power that proved this concept. The contribution of energy storage in restoring the small hydro-dominated distribution grid and its operational sensitivity across different control settings are further analyzed using high-fidelity simulations. Readers will learn about technical details on the field demonstration setup, energy storage contribution to black start, detailed simulation steps of islanded distribution grid restoration, and usage of field demonstration measurements for transient model refinements. Collectively this report points to a great opportunity for small hydropower to enhance resilience of local electric grids.

13 HYDRO ENERGY↗

Research in advanced formal theorem-proving techniques

The present status is summarized of a continuing research program aimed at the design and implementation of a language for expressing problem-solving procedures in several areas of artificial intelligence, including program synthesis, robot planning, and theorem proving. Notations, concepts, and procedures common to the representation and solution of many of these problems were abstracted and incorporated as features into the language. The areas of research covered are described, and abstracts of six papers that contain extensive description and technical detail of the work are presented.

Rulifson, J. F.↗

Reasoning by analogy as an aid to heuristic theorem proving.

When heuristic problem-solving programs are faced with large data bases that contain numbers of facts far in excess of those needed to solve any particular problem, their performance rapidly deteriorates. In this paper, the correspondence between a new unsolved problem and a previously solved analogous problem is computed and invoked to tailor large data bases to manageable sizes. This paper outlines the design of an algorithm for generating and exploiting analogies between theorems posed to a resolution-logic system. These algorithms are believed to be the first computationally feasible development of reasoning by analogy to be applied to heuristic theorem proving.

Kling, R. E.↗

Research in advanced formal theorem-proving techniques

The results are summarised of a project aimed at the design and implementation of computer languages to aid in expressing problem solving procedures in several areas of artificial intelligence including automatic programming, theorem proving, and robot planning. The principal results of the project were the design and implementation of two complete systems, QA4 and QLISP, and their preliminary experimental use. The various applications of both QA4 and QLISP are given.

Raphael, B.↗

Proving the correctness of the flight director program EADIFD, volume 1

EADIFD is written in symbolic assembly language for execution on the C4000 airborne computer. It is a subprogram of an aircraft navigation and guidance program and is used to generate pitch and roll command signals for use in terminal airspace. The proof of EADIFD was carried out by an inductive assertion method consisting of two parts, a verification condition generator and a source language independent proof checker. With the specifications provided by NASA, EADIFD was proved correct. The termination of the program is guaranteed and the program contains no instructions that can modify it under any conditions.

Lee, F. J.↗

Proving the correctness of a flight-director program for an airborne minicomputer

Program verification procedures are described and used to determine the correctness of a program written for an airborne computer. The basic method relies on the inductive assertion method of Floyd (1967), modified and extended for application to a machine-language situation. Correctness considerations in the flight director program include self-modification, system correctness, executable instructions, overflow, approximate calculations with fractional quantities, and fixed point scaling. An example proof of correctness, which proceeds by proving the correctness of a certain subroutine, is provided.

Maurer, W. D.↗

Three Lectures on Theorem-proving and Program Verification

Topics concerning theorem proving and program verification are discussed with particlar emphasis on the Boyer/Moore theorem prover, and approaches to program verification such as the functional and interpreter methods and the inductive assertion approach. A history of the discipline and specific program examples are included.

Moore, J. S.↗

Automated Theorem Proving in High-Quality Software Design

The amount and complexity of software developed during the last few years has increased tremendously. In particular, programs are being used more and more in embedded systems (from car-brakes to plant-control). Many of these applications are safety-relevant, i.e. a malfunction of hardware or software can cause severe damage or loss. Tremendous risks are typically present in the area of aviation, (nuclear) power plants or (chemical) plant control. Here, even small problems can lead to thousands of casualties and huge financial losses. Large financial risks also exist when computer systems are used in the area of telecommunication (telephone, electronic commerce) or space exploration. Computer applications in this area are not only subject to safety considerations, but also security issues are important. All these systems must be designed and developed to guarantee high quality with respect to safety and security. Even in an industrial setting which is (or at least should be) aware of the high requirements in Software Engineering, many incidents occur. For example, the Warshaw Airbus crash, was caused by an incomplete requirements specification. Uncontrolled reuse of an Ariane 4 software module was the reason for the Ariane 5 disaster. Some recent incidents in the telecommunication area, like illegal "cloning" of smart-cards of D2GSM handies, or the extraction of (secret) passwords from German T-online users show that also in this area serious flaws can happen. Due to the inherent complexity of computer systems, most authors claim that only a rigorous application of formal methods in all stages of the software life cycle can ensure high quality of the software and lead to real safe and secure systems. In this paper, we will have a look, in how far automated theorem proving can contribute to a more widespread application of formal methods and their tools, and what automated theorem provers (ATPs) must provide in order to be useful.

Schumann, Johann↗

Strategy-Enhanced Interactive Proving and Arithmetic Simplification for PVS

We describe an approach to strategy-based proving for improved interactive deduction in specialized domains. An experimental package of strategies (tactics) and support functions called Manip has been developed for PVS to reduce the tedium of arithmetic manipulation. Included are strategies aimed at algebraic simplification of real-valued expressions. A general deduction architecture is described in which domain-specific strategies, such as those for algebraic manipulation, are supported by more generic features, such as term-access techniques applicable in arbitrary settings. An extended expression language provides access to subterms within a sequent.

diVito, Ben L.↗

Strategy-Enhanced Interactive Proving and Arithmetic Simplification for PVS

We describe an approach to strategy-based proving for improved interactive deduction in specialized domains. An experimental package of strategies (tactics) and support functions called Manip has been developed for PVS to reduce the tedium of arithmetic manipulation. Included are strategies aimed at algebraic simplification of real-valued expressions. A general deduction architecture is described in which domain-specific strategies, such as those for algebraic manipulation, are supported by more generic features, such as term-access techniques applicable in arbitrary settings. An extended expression language provides access to subterms within a sequent.

DiVito, Ben L.↗

Model Checking Failed Conjectures in Theorem Proving: A Case Study

Interactive mechanical theorem proving can provide high assurance of correct design, but it can also be a slow iterative process. Much time is spent determining why a proof of a conjecture is not forthcoming. In some cases, the conjecture is false and in others, the attempted proof is insufficient. In this case study, we use the SAL family of model checkers to generate a concrete counterexample to an unproven conjecture specified in the mechanical theorem prover, PVS. The focus of our case study is the ROBUS Interactive Consistency Protocol. We combine the use of a mechanical theorem prover and a model checker to expose a subtle flaw in the protocol that occurs under a particular scenario of faults and processor states. Uncovering the flaw allows us to mend the protocol and complete its general verification in PVS.

Pike, Lee↗

Theorem Proving in Intel Hardware Design

For the past decade, a framework combining model checking (symbolic trajectory evaluation) and higher-order logic theorem proving has been in production use at Intel. Our tools and methodology have been used to formally verify execution cluster functionality (including floating-point operations) for a number of Intel products, including the Pentium(Registered TradeMark)4 and Core(TradeMark)i7 processors. Hardware verification in 2009 is much more challenging than it was in 1999 - today s CPU chip designs contain many processor cores and significant firmware content. This talk will attempt to distill the lessons learned over the past ten years, discuss how they apply to today s problems, outline some future directions.

O'Leary, John↗

Operational use of the AIRS Total Column Ozone Retrievals along with the RGB Airmass Product as Part of the GOES-R Proving Ground

The Red, Green, Blue (RGB) Air Mass product has been demonstrated in the GOES ]R Proving Ground as a possible decision aid. Forecasters have been trained on the usefulness of identifying stratospheric intrusions and potential vorticity (PV) anomalies that can lead to explosive cyclogenesis, genesis of mesoscale convective systems (MCSs), or the transition of tropical cyclones to extratropical cyclones. It has also been demonstrated to distinguish different air mass types from warm, low ozone air masses to cool, high ozone air masses and the various interactions with the PV anomalies. To assist the forecasters in understanding the stratospheric contribution to high impact weather systems, the Atmospheric Infrared Sounder (AIRS) Total Column Ozone Retrievals have been made available as an operational tool. These AIRS retrievals provide additional information on the amount of ozone that is associated with the red coloring seen in the RGB Air Mass product. This paper discusses how the AIRS retrievals can be used to quantify the red coloring in RGB Air Mass product. These retrievals can be used to diagnose the depth of the stratospheric intrusions associated with different types of weather systems and provide the forecasters decision aid tools that can improve the quality of forecast products.

Folmer, M.↗

Potential Cislunar and Interplanetary Proving Ground Excursion Trajectory Concepts

NASA has been investigating potential translunar excursion concepts to take place in the 2020s that would be used to test and demonstrate long duration life support and other systems needed for eventual Mars missions in the 2030s. These potential trajectory concepts could be conducted in the proving ground, a region of cislunar and near-Earth interplanetary space where international space agencies could cooperate to develop the technologies needed for interplanetary spaceflight. Enabled by high power Solar Electric Propulsion (SEP) technologies, the excursion trajectory concepts studied are grouped into three classes of increasing distance from the Earth and increasing technical difficulty: the first class of excursion trajectory concepts would represent a 90-120 day round trip trajectory with abort to Earth options throughout the entire length, the second class would be a 180-210 day round trip trajectory with periods in which aborts would not be available, and the third would be a 300-400 day round trip trajectory without aborts for most of the length of the trip. This paper provides a top-level summary of the trajectory and mission design of representative example missions of these three classes of excursion trajectory concepts.

asteroids↗

Proving Program Termination With Matrix Weighted Digraphs

Program termination analysis is an important task in logic and computer science. While determining if a program terminates is known to be undecidable in general, there has been a significant amount of attention given to finding sufficient and computationally practical conditions to prove termination. One such method takes a program and builds from it a matrix weighted digraph. These are directed graphs whose edges are labeled by square matrices with entries in {-1,0,1}, equipped with a nonstandard matrix multiplication. Certain properties of this digraph are known to imply the termination of the related program. In particular, termination of the program can be determined from the weights of the circuits in the digraph. In this talk, the motivation for addressing termination and how matrix weighted digraphs arise will be briefly discussed. The remainder of the talk will describe an efficient method for bounding the weights of a finite set of the circuits in a matrix weighted digraph, which allows termination of the related program to be deduced.

Dutle, Aaron↗