Search NASA⌕ Search

SEARCH · Search NASA

Results for “Theorem 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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

Liapunov functions for non-linear difference equation stability analysis.

Liapunov functions to determine the stability of non-linear autonomous difference equations can be developed through the use of auxiliary exact difference equations. For this purpose definitions are introduced for the gradient of an implicit function of a discrete variable, a principal sum, a definite sum and an exact difference equation, and a theorem for exactness of a difference form is proved. Examples illustrate the procedure.

Park, K. E.↗
NASA NTRS1983

Hierarchical Design and Verification for VLSI

The specification and verification work is described in detail, and some of the problems and issues to be resolved in their application to Very Large Scale Integration VLSI systems are examined. The hierarchical design methodologies enable a system architect or design team to decompose a complex design into a formal hierarchy of levels of abstraction. The first step inprogram verification is tree formation. The next step after tree formation is the generation from the trees of the verification conditions themselves. The approach taken here is similar in spirit to the corresponding step in program verification but requires modeling of the semantics of circuit elements rather than program statements. The last step is that of proving the verification conditions using a mechanical theorem-prover.

Shostak, R. E.↗
NASA NTRS1992

Verifying the interactive convergence clock synchronization algorithm using the Boyer-Moore theorem prover

The application of formal methods to the analysis of computing systems promises to provide higher and higher levels of assurance as the sophistication of our tools and techniques increases. Improvements in tools and techniques come about as we pit the current state of the art against new and challenging problems. A promising area for the application of formal methods is in real-time and distributed computing. Some of the algorithms in this area are both subtle and important. In response to this challenge and as part of an ongoing attempt to verify an implementation of the Interactive Convergence Clock Synchronization Algorithm (ICCSA), we decided to undertake a proof of the correctness of the algorithm using the Boyer-Moore theorem prover. This paper describes our approach to proving the ICCSA using the Boyer-Moore prover.

Young, William D.↗
NASA NTRS2004

Formalization of the Integral Calculus in the PVS Theorem Prover

The PVS Theorem prover is a widely used formal verification tool used for the analysis of safety-critical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and Computer Science that is used in a verification. This is a formidable task, ultimately requiring the contributions of researchers and developers all over the world. This paper reports on the formalization of the integral calculus in the PVS theorem prover. All of the basic definitions and theorems covered in a first course on integral calculus have been completed.The theory and proofs were based on Rosenlicht's classic text on real analysis and follow the traditional epsilon-delta method. The goal of this work was to provide a practical set of PVS theories that could be used for verification of hybrid systems that arise in air traffic management systems and other aerospace applications. All of the basic linearity, integrability, boundedness, and continuity properties of the integral calculus were proved. The work culminated in the proof of the Fundamental Theorem Of Calculus. There is a brief discussion about why mechanically checked proofs are so much longer than standard mathematics textbook proofs.

Butler, Ricky W.↗
NASA NTRS1973

Continuous dependence of fixed points of condensing maps

Many problems in analysis are concerned with the dependence upon parameters of fixed points of maps. For contraction mappings, criteria are relatively easy to obtain and have been known for some time. In the study of solutions of functional differential equations, more general results were needed. It is the purpose of this paper to give a rather general fixed-point theorem for condensing maps depending on a parameter, to prove continuous dependence and to indicate how many of the previous results are special cases.

Hale, J. K.↗
NASA NTRS1975

On the Laplace transform for distributions

A new characterization of the Laplace transform for Schwartz distributions is developed, using sequences of linear transformations on the space of distributions. The standard theorems on analyticity, uniqueness and invertibility of the transform are proved, using the new characterization as the definition of the Laplace transform. It is shown that this sequential definition is equivalent to Schwartz's extension of the ordinary Laplace transform to distributions which he obtained from the Fourier transform.

Price, D. B.↗
NASA NTRS2001

Testing Linear Temporal Logic Formulae on Finite Execution Traces

We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL. theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications. Such tests correspond to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property. We then suggest an optimized algorithm based on transforming LTL formulae. The work is done using the Maude rewriting system. which turns out to provide a perfect notation and an efficient rewriting engine for performing these experiments.

Havelund, Klaus↗
NASA NTRS2001

Monitoring Programs Using Rewriting

We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) formulae on finite execution traces, The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive in most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications, corresponding to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property end then suggest an optimized algorithm based on transforming LTL formulae. We use the Maude rewriting logic, which turns out to be a good notation and being supported by an efficient rewriting engine for performing these experiments. The work constitutes part of the Java PathExplorer (JPAX) project, the purpose of which is to develop a flexible tool for monitoring Java program executions.

Havelund, Klaus↗
NASA NTRS1989

Ground-state energies of the nonlinear sigma model and the Heisenberg spin chains

A theorem on the O(3) nonlinear sigma model with the topological theta term is proved, which states that the ground-state energy at theta = pi is always higher than the ground-state energy at theta = 0, for the same value of the coupling constant g. Provided that the nonlinear sigma model gives the correct description for the Heisenberg spin chains in the large-s limit, this theorem makes a definite prediction relating the ground-state energies of the half-integer and the integer spin chains. The ground-state energies obtained from the exact Bethe ansatz solution for the spin-1/2 chain and the numerical diagonalization on the spin-1, spin-3/2, and spin-2 chains support this prediction.

Zhang, Shoucheng↗
NASA NTRS1992

Mechanically verified hardware implementing an 8-bit parallel IO Byzantine agreement processor

Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.

Moore, J. Strother↗
NASA NTRS1950

The reversibility theorem for thin airfoils in subsonic and supersonic flow

A method introduced by Munk is extended to prove that the light-curve slope of thin wings in either subsonic flow or supersonic flow is the same when the direction of flight of the wing is reversed. It is also shown that the wing reversal does not change the thickness drag, damping-in-roll parameter or the damping-in-pitch parameter.

Brown, Clinton E↗
NASA NTRS1979

Multiyear estimates for the LACIE sampling plans

An approach that may be useful in improving the estimates of the wheat acreages for the LACIE countries for each year by using the short-time series of estimates made in the sequence of consecutive years is presented. A simple 'synthesis' based method of variance component estimation is described. A general theorem concerning weighted least squares, referred to as the Aiken method, is proved.

Hartley, H. O.↗
NASA NTRS1992

Moving formal methods into practice. Verifying the FTPP Scoreboard: Results, phase 1

This report documents the Phase 1 results of an effort aimed at formally verifying a key hardware component, called Scoreboard, of a Fault-Tolerant Parallel Processor (FTPP) being built at Charles Stark Draper Laboratory (CSDL). The Scoreboard is part of the FTPP virtual bus that guarantees reliable communication between processors in the presence of Byzantine faults in the system. The Scoreboard implements a piece of control logic that approves and validates a message before it can be transmitted. The goal of Phase 1 was to lay the foundation of the Scoreboard verification. A formal specification of the functional requirements and a high-level hardware design for the Scoreboard were developed. The hardware design was based on a preliminary Scoreboard design developed at CSDL. A main correctness theorem, from which the functional requirements can be established as corollaries, was proved for the Scoreboard design. The goal of Phase 2 is to verify the final detailed design of Scoreboard. This task is being conducted as part of a NASA-sponsored effort to explore integration of formal methods in the development cycle of current fault-tolerant architectures being built in the aerospace industry.

Srivas, Mandayam↗
NASA NTRS2014

Automated Real Proving in PVS via MetiTarski

This paper reports the development of a proof strategy that integrates the MetiTarski theorem prover as a trusted external decision procedure into the PVS theorem prover. The strategy automatically discharges PVS sequents containing real-valued formulas, including transcendental and special functions, by translating the sequents into first order formulas and submitting them to MetiTarski. The new strategy is considerably faster and more powerful than other strategies for nonlinear arithmetic available to PVS.

Denman, William↗
DOE OSTI2025

Gravitational memory and Ward identities in the local detector frame

Gravitational memory, which describes the permanent shift in the strain after the passage of gravitational waves, is directly related to Weinberg’s soft graviton theorems and the Bondi-Metzner-Sachs (BMS) symmetry group of asymptotically flat space-times. In this work, we provide an equivalent description of the phenomenon in local coordinates around gravitational wave detectors, such as transverse-traceless (TT) gauge. We show that gravitational memory is encoded in large residual diffeomorphisms in this gauge, which include time-dependent anisotropic spatial rescalings, and prove their equivalence to BMS transformations when translated to TT gauge. We then derive the associated Ward identities and associated soft theorems, for both scattering amplitudes and equal-time (in-in) correlation functions, and explicitly check their validity for planar gravitational waves. Furthermore, the in-in identities are recognized as the flat-space analog of the well-known inflationary consistency relations.

General relativity↗
NASA NTRS1972

An innovative approach to compensator design

The primary goal is to present for a control system a computer-aided-compensator design technique from a frequency domain point of view. The thesis for developing this technique is to describe the open loop frequency response by n discrete frequency points which result in n functions of the compensator coefficients. Several of these functions are chosen so that the system specifications are properly portrayed; then mathematical programming is used to improve all of these functions which have values below minimum standards. In order to do this several definitions in regard to measuring the performance of a system in the frequency domain are given. Next, theorems which govern the number of compensator coefficients necessary to make improvements in a certain number of functions are proved. After this a mathematical programming tool for aiding in the solution of the problem is developed. Then for applying the constraint improvement algorithm generalized gradients for the constraints are derived. Finally, the necessary theory is incorporated in a computer program called CIP (compensator improvement program).

Mitchell, J. R.↗
NASA NTRS1973

An innovative approach to compensator design

The design is considered of a computer-aided-compensator for a control system from a frequency domain point of view. The design technique developed is based on describing the open loop frequency response by n discrete frequency points which result in n functions of the compensator coefficients. Several of these functions are chosen so that the system specifications are properly portrayed; then mathematical programming is used to improve all of these functions which have values below minimum standards. To do this, several definitions in regard to measuring the performance of a system in the frequency domain are given, e.g., relative stability, relative attenuation, proper phasing, etc. Next, theorems which govern the number of compensator coefficients necessary to make improvements in a certain number of functions are proved. After this a mathematical programming tool for aiding in the solution of the problem is developed. This tool is called the constraint improvement algorithm. Then for applying the constraint improvement algorithm generalized, gradients for the constraints are derived. Finally, the necessary theory is incorporated in a Computer program called CIP (compensator Improvement Program). The practical usefulness of CIP is demonstrated by two large system examples.

Mitchell, J. R.↗