Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Formal Methods”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

T/BEST: Technology Benefit Estimator for Composites and Applications to Engine Structures

Progress in the field of aerospace propulsion has heightened the need to combine advanced technologies. These benefits will provide guidelines for identifying and prioritizing high-payoff research areas, will help manage research with limited resources, and will show the link between advanced and basic concepts. An effort was undertaken at the NASA Lewis Research Center to develop a formal computational method, T/BEST (Technology Benefit Estimator), to assess advanced aerospace technologies, such as fibrous composites, and credibly communicate the benefits of research. Fibrous composites are ideal for structural applications such as high-performance aircraft engine blades where high strength-to-weight and stiffness-to-weight ratios are required. These factors - along with the flexibility to select the composite system and layup, and to favorably orient fiber directions - reduce the displacements and stresses caused by large rotational speeds in aircraft engines.

Chamis, Christos↗
NASA NTRS2005

Autonomous and Autonomic Swarms

A watershed in systems engineering is represented by the advent of swarm-based systems that accomplish missions through cooperative action by a (large) group of autonomous individuals each having simple capabilities and no global knowledge of the group s objective. Such systems, with individuals capable of surviving in hostile environments, pose unprecedented challenges to system developers. Design and testing and verification at much higher levels will be required, together with the corresponding tools, to bring such systems to fruition. Concepts for possible future NASA space exploration missions include autonomous, autonomic swarms. Engineering swarm-based missions begins with understanding autonomy and autonomicity and how to design, test, and verify systems that have those properties and, simultaneously, the capability to accomplish prescribed mission goals. Formal methods-based technologies, both projected and in development, are described in terms of their potential utility to swarm-based system developers.

Hinchey, Michael G.↗
NASA NTRS2006

Electron-He(+) P-wave Elastic Scattering and Photoabsorption in Two-electron Systems

In a previous paper [Bhatia, Phys. Rev. A 69,032714 (2004)], electron-hydrogen P-wave scattering phase shifts were calculated using the optical potential approach based on the Feshbach projection operator formalism. This method is now extended to the singlet and triplet electron-He(+) P-wave scattering in the elastic region. Phase shifts are calculated using Hylleraas-type correlation functions with up to 220 terms. Results are rigorous lower bounds to the exact phase shifts and they are compared to phase shifts obtained from the method of polarized orbitals and close-coupling calculations. The continuum functions calculated here are used to calculate photoabsorption cross sections. Photoionization cross sections of He and photodetachment cross sections of H(-) are calculated in the elastic region, i.e. leaving He(+) and H in their respective ground states, and compared with previous calculations. Radiative attachment rates are also calculated.

Bhatia, A. K.↗
NASA NTRS2003

Model checking for software security properties

This paper describes the use of the Flexible Modeling Framework (FMF) for model checking (MC) to perform and search for vulnerabilities in the Secure Socket Layer (SSL) communication protocol.

model checking formal methods software security↗
NASA NTRS2001

Cost model validation: a technical and cultural approach

This paper summarizes how JPL's parametric mission cost model (PMCM) has been validated using both formal statistical methods and a variety of peer and management reviews in order to establish organizational acceptance of the cost model estimates.

cost model validation↗
NASA NTRS2004

Using software security analysis to verify the secure socket layer (SSL) protocol

nal Aeronautics and Space Administration (NASA) have tens of thousands of networked computer systems and applications. Software Security vulnerabilities present risks such as lost or corrupted data, information the3, and unavailability of critical systems. These risks represent potentially enormous costs to NASA. The NASA Code Q research initiative 'Reducing Software Security Risk (RSSR) Trough an Integrated Approach '' offers, among its capabilities, formal verification of software security properties, through the use of model based verification (MBV) to address software security risks. [1,2,3,4,5,6] MBV is a formal approach to software assurance that combines analysis of software, via abstract models, with technology, such as model checkers, that provide automation of the mechanical portions of the analysis process. This paper will discuss: The need for formal analysis to assure software systems with respect to software and why testing alone cannot provide it. The means by which MBV with a Flexible Modeling Framework (FMF) accomplishes the necessary analysis task. An example of FMF style MBV in the verification of properties over the Secure Socket Layer (SSL) communication protocol as a demonstration.

software↗
NASA NTRS2003

Reducing software security risk through an integrated approach research initiative model based verification of the Secure Socket Layer (SSL) Protocol

This document discusses the verification of the Secure Socket Layer (SSL) communication protocol as a demonstration of the Model Based Verification (MBV) portion of the verification instrument set being developed under the Reducing Software Security Risk (RSSR) Trough an Integrated Approach research initiative. Code Q of the National Aeronautics and Space Administration (NASA) funds this project. The NASA Goddard Independent Verification and Validation (IV&V) facility manages this research program at the NASA agency level and the Assurance Technology Program Office (ATPO) manages the research locally at the Jet Propulsion Laboratory (California institute of Technology) where the research is being carried out.

software security↗
NASA NTRS2003

Addressing software security and mitigations in the life cycle

Traditionally, security is viewed as an organizational and Information Technology (IIJ systems function comprising of Firewalls, intrusion detection systems (IDS), system security settings and patches to the operating system (OS) and applications running on it. Until recently, little thought has been given to the importance of security as a formal approach in the software life cycle. The Jet Propulsion Laboratory has approached the problem through the development of an integrated formal Software Security Assessment Instrument (SSAI) with six foci for the software life cycle.

formal methods↗
NASA NTRS2013

A Semantic Basis for Proof Queries and Transformations

We extend the query language PrQL, designed for inspecting machine representations of proofs, to also allow transformation of proofs. PrQL natively supports hiproofs which express proof structure using hierarchically nested labelled trees, which we claim is a natural way of taming the complexity of huge proofs. Query-driven transformations enable manipulation of this structure, in particular, to transform proofs produced by interactive theorem provers into forms that assist their understanding, or that could be consumed by other tools. In this paper we motivate and define basic transformation operations, using an abstract denotational semantics of hiproofs and queries. This extends our previous semantics for queries based on syntactic tree representations.We define update operations that add and remove sub-proofs, and manipulate the hierarchy to group and ungroup nodes. We show that

Proof Queries↗