Search NASA⌕ Search

SEARCH · Search NASA

Results for “Formal analysis”

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 163 records · Page 9

Formal verification of a fault tolerant clock synchronization algorithm

A formal specification and mechanically assisted verification of the interactive convergence clock synchronization algorithm of Lamport and Melliar-Smith is described. Several technical flaws in the analysis given by Lamport and Melliar-Smith were discovered, even though their presentation is unusally precise and detailed. It seems that these flaws were not detected by informal peer scrutiny. The flaws are discussed and a revised presentation of the analysis is given that not only corrects the flaws but is also more precise and easier to follow. Some of the corrections to the flaws require slight modifications to the original assumptions underlying the algorithm and to the constraints on its parameters, and thus change the external specifications of the algorithm. The formal analysis of the interactive convergence clock synchronization algorithm was performed using the Enhanced Hierarchical Development Methodology (EHDM) formal specification and verification environment. This application of EHDM provides a demonstration of some of the capabilities of the system.

Rushby, John↗

Why Engineers Should Consider Formal Methods

This paper presents a logical analysis of a typical argument favoring the use of formal methods for software development, and suggests an alternative argument that is simpler and stronger than the typical one.

Holloway, C. Michael↗

On a Formal Tool for Reasoning About Flight Software Cost Analysis

A report focuses on the development of flight software (FSW) cost estimates for 16 Discovery-class missions at JPL. The techniques and procedures developed enabled streamlining of the FSW analysis process, and provided instantaneous confirmation that the data and processes used for these estimates were consistent across all missions. The research provides direction as to how to build a prototype rule-based system for FSW cost estimation that would provide (1) FSW cost estimates, (2) explanation of how the estimates were arrived at, (3) mapping of costs, (4) mathematical trend charts with explanations of why the trends are what they are, (5) tables with ancillary FSW data of interest to analysts, (6) a facility for expert modification/enhancement of the rules, and (7) a basis for conceptually convenient expansion into more complex, useful, and general rule-based systems.

Spagnuolo, John N., Jr.↗

Certifying Auto-Generated Flight Code

Model-based design and automated code generation are being used increasingly at NASA. Many NASA projects now use MathWorks Simulink and Real-Time Workshop for at least some of their modeling and code development. However, there are substantial obstacles to more widespread adoption of code generators in safety-critical domains. Since code generators are typically not qualified, there is no guarantee that their output is correct, and consequently the generated code still needs to be fully tested and certified. Moreover, the regeneration of code can require complete recertification, which offsets many of the advantages of using a generator. Indeed, manual review of autocode can be more challenging than for hand-written code. Since the direct V&V of code generators is too laborious and complicated due to their complex (and often proprietary) nature, we have developed a generator plug-in to support the certification of the auto-generated code. Specifically, the AutoCert tool supports certification by formally verifying that the generated code is free of different safety violations, by constructing an independently verifiable certificate, and by explaining its analysis in a textual form suitable for code reviews. The generated documentation also contains substantial tracing information, allowing users to trace between model, code, documentation, and V&V artifacts. This enables missions to obtain assurance about the safety and reliability of the code without excessive manual V&V effort and, as a consequence, eases the acceptance of code generators in safety-critical contexts. The generation of explicit certificates and textual reports is particularly well-suited to supporting independent V&V. The primary contribution of this approach is the combination of human-friendly documentation with formal analysis. The key technical idea is to exploit the idiomatic nature of auto-generated code in order to automatically infer logical annotations. The annotation inference algorithm itself is generic, and parametrized with respect to a library of coding patterns that depend on the safety policies and the code generator. The patterns characterize the notions of definitions and uses that are specific to the given safety property. For example, for initialization safety, definitions correspond to variable initializations while uses are statements which read a variable, whereas for array bounds safety, definitions are the array declarations, while uses are statements which access an array variable. The inferred annotations are thus highly dependent on the actual program and the properties being proven. The annotations, themselves, need not be trusted, but are crucial to obtain the automatic formal verification of the safety properties without requiring access to the internals of the code generator. The approach has been applied to both in-house and commercial code generators, but is independent of the particular generator used. It is currently being adapted to flight code generated using MathWorks Real-Time Workshop, an automatic code generator that translates from Simulink/Stateflow models into embedded C code.

Denney, Ewen↗

Toward Synthesis, Analysis, and Certification of Security Protocols

Implemented security protocols are basically pieces of software which are used to (a) authenticate the other communication partners, (b) establish a secure communication channel between them (using insecure communication media), and (c) transfer data between the communication partners in such a way that these data only available to the desired receiver, but not to anyone else. Such an implementation usually consists of the following components: the protocol-engine, which controls in which sequence the messages of the protocol are sent over the network, and which controls the assembly/disassembly and processing (e.g., decryption) of the data. the cryptographic routines to actually encrypt or decrypt the data (using given keys), and t,he interface to the operating system and to the application. For a correct working of such a security protocol, all of these components must work flawlessly. Many formal-methods based techniques for the analysis of a security protocols have been developed. They range from using specific logics (e.g.: BAN-logic [4], or higher order logics [12] to model checking [2] approaches. In each approach, the analysis tries to prove that no (or at least not a modeled intruder) can get access to secret data. Otherwise, a scenario illustrating the &tack may be produced. Despite the seeming simplicity of security protocols ("only" a few messages are sent between the protocol partners in order to ensure a secure communication), many flaws have been detected. Unfortunately, even a perfect protocol engine does not guarantee flawless working of a security protocol, as incidents show. Many break-ins and security vulnerabilities are caused by exploiting errors in the implementation of the protocol engine or the underlying operating system. Attacks using buffer-overflows are a very common class of such attacks. Errors in the implementation of exception or error handling can open up additional vulnerabilities. For example, on a website with a log-in screen: multiple tries with invalid passwords caused the expected error message (too many retries). but let the user nevertheless pass. Finally, security can be compromised by silly implementation bugs or design decisions. In a commercial VPN software, all calls to the encryption routines were incidentally replaced by stubs, probably during factory testing. The product worked nicely. and the error (an open VPN) would have gone undetected, if a team member had not inspected the low-level traffic out of curiosity. Also, the use secret proprietary encryption routines can backfire, because such algorithms often exhibit weaknesses which can be exploited easily (see e.g., DVD encoding). Summarizing, there is large number of possibilities to make errors which can compromise the security of a protocol. In today s world with short time-to-market and the use of security protocols in open and hostile networks for safety-critical applications (e.g., power or air-traffic control), such slips could lead to catastrophic situations. Thus, formal methods and automatic reasoning techniques should not be used just for the formal proof of absence of an attack, but they ought to be used to provide an end-to-end tool-supported framework for security software. With such an approach all required artifacts (code, documentation, test cases) , formal analyses, and reliable certification will be generated automatically, given a single, high level specification. By a combination of program synthesis, formal protocol analysis, certification; and proof-carrying code, this goal is within practical reach, since all the important technologies for such an approach actually exist and only need to be assembled in the right way.

Schumann, Johann↗

Analysis of Three Body Decays in Quasi-Real Photoproduction

This thesis presents preliminary measurements of the moments of angular distribution for the K?K+ mesonic final state using a quasi-real, linearly polarised photon. Two of the main points of focus for this analysis were the development of the formalism for photoproduced vector-pseudoscalar decay and the tools by which the analysis was carried out. The formalism described how the moments of angular distribution could be extracted from the angular decay variables, and how they related to resonance decays in terms of partial waves. In extracting the moments, it was found that adapted Markov Chain Monte Carlo (MCMC) methods proved to be more effective in terms of extracting results from the data compared to the sole use of gradient descent based fitting algorithms. These measurements are complementary to other decay channels and production mechanisms, with the global aim of probing the existence of exotic mesons. Data from this analysis was taken by the CLAS collaboration at the Thomas Jefferson National Accelerator Facility (JLab) by scattering from a liquid hydrogen target using a 10.6 GeV electron. This work was done within the MesonEx program at CLAS12 that aims to map the spectrum of mesons, and in doing so, gain a greater understanding of Quantum ChromoDynamics (QCD) and the strong force.

Wishart, Robert↗

Automatic Estimation of Verified Floating-Point Round-Off Errors via Static Analysis

This paper introduces a static analysis technique for computing formally verified round-off error bounds of floating-point functional expressions. The technique is based on a denotational semantics that computes a symbolic estimation of floating-point round-o errors along with a proof certificate that ensures its correctness. The symbolic estimation can be evaluated on concrete inputs using rigorous enclosure methods to produce formally verified numerical error bounds. The proposed technique is implemented in the prototype research tool PRECiSA (Program Round-o Error Certifier via Static Analysis) and used in the verification of floating-point programs of interest to NASA.

Moscato, Mariano↗

Reuse of a Formal Model for Requirements Validation

This paper report experience from how a project engaged in the process of requirements analysis for evolutionary builds can reuse the formally specified design model produced for a similar, earlier project in the same domain.

requirements↗

Realizability Checking of Requirements in FRET

Requirements formalization has become increasingly popular in industrial settings as an effort to disambiguate designs and optimize development time and costs for critical system components. Formal requirements elicitation also enables the employment of analysis tools to prove important properties, such as consistency and realizability. In this report, we present the realizability analysis framework that we developed as part of the Formal Requirements Elicitation Tool (FRET). Our framework prioritizes usability, and employs state-of-the-art analysis algorithms that support infinite theories. We demonstrate the workflow for realizability checking, showcase the diagnosis process that supports visualization of conflicts between requirements and simulation of counterexamples, and discuss results from industrial-level case studies.

Formal Requirements Elicitation Tool↗

Long-Term Creep-Rupture Behavior of Alloy Inconel 740/740H

To explore potential application of Ni-based alloys for power generation at the higher temperatures and pressures needed to achieve high thermal to electrical-energy conversion efficiency, an extensive creep-rupture dataset covering up to 875 °C and almost 70,000 h for Inconel 740/740H was analyzed using Larson–Miller parameter and Wilshire approaches. The results were used to assess the relative effectiveness of the two analytical methods, both in describing the experimental data and, because of the breadth of the dataset, using analyses of its shorter-time data to make creep lifetime predictions for much more extended times, which were then directly compared to the measured rupture times. The respective methods were also used to predict creep-limited lifetimes relevant to power production (that is, 100,000 h or greater). Despite the complexity of the precipitation-strengthened Inconel 740/740H alloy and the generalized parametric approach of these methodologies, the predictions based on such were reasonably accurate when the entire dataset was analyzed. However, when the analysis was confined to only data for conditions yielding creep-rupture times < 5,000 h( about 65 % of the entire dataset), the Wilshire correlation yielded better prediction for longer time lifetimes due to the inherent instability of the specific Larson–Miller formalism used in this analysis when extrapolated significantly outside its analysis range.

36 MATERIALS SCIENCE↗

A systematic decision-making methodology to formalize the selection of degree of realism in screening analysis of probabilistic risk assessment

In the nuclear power domain, Probabilistic Risk Assessment (PRA) is used to inform decision-making for Nuclear Power Plants (NPPs). Recently, there has been an increase in the utilization of modeling and simulation (M&S) to support the estimation of PRA inputs. Risk analysts should carefully select the PRA items that require M&S and their degree of realism (DoR) with consideration of the required resources. To support this selection, this article formulates a systematic decision-making approach for the DoR selection. The DoR selection is made based on two predictive decision-making attributes: the predicted differences in safety risk estimate (ΔSaRi) and the cost of analysis (ΔCAN). This research also develops and quantifies causal models to estimate ΔSaRi and ΔCAN. The causal model-based prediction of ΔSaRi and ΔCAN helps reduce the trial-and-error nature of the DoR selection in the PRA screening analysis and provides insights for DoR selection and the gradual refinements of PRA realism. This approach is demonstrated for a case study on fire PRA of NPPs, where an adequate DoR is selected from two fire models: an engineering correlation and a zone model.

Alkhatib, Sari [Department of Nuclear, Plasma, and↗

The specification-based validation of reliable multicast protocol: Problem Report

Reliable Multicast Protocol (RMP) is a communication protocol that provides an atomic, totally ordered, reliable multicast service on top of unreliable IP multicasting. In this report, we develop formal models for RMP using existing automated verification systems, and perform validation on the formal RMP specifications. The validation analysis help identifies some minor specification and design problems. We also use the formal models of RMP to generate a test suite for conformance testing of the implementation. Throughout the process of RMP development, we follow an iterative, interactive approach that emphasizes concurrent and parallel progress of implementation and verification processes. Through this approach, we incorporate formal techniques into our development process, promote a common understanding for the protocol, increase the reliability of our software, and maintain high fidelity between the specifications of RMP and its implementation.

Wu, Yunqing↗

The Specification-Based Validation of Reliable Multicast Protocol

Reliable Multicast Protocol (RMP) is a communication protocol that provides an atomic, totally ordered, reliable multicast service on top of unreliable IP multicasting. In this report, we develop formal models for RMP using existing automated verification systems, and perform validation on the formal RMP specifications. The validation analysis help identifies some minor specification and design problems. We also use the formal models of RMP to generate a test suite for conformance testing of the implementation. Throughout the process of RMP development, we follow an iterative, interactive approach that emphasizes concurrent and parallel progress of the implementation and verification processes. Through this approach, we incorporate formal techniques into our development process, promote a common understanding for the protocol, increase the reliability of our software, and maintain high fidelity between the specifications of RMP and its implementation.

Wu, Yunqing↗

Formalizing New Navigation Requirements for NASA's Space Shuttle

We describe a recent NASA-sponsored pilot project intended to gauge the effectiveness of using formal methods in Space Shuttle software requirements analysis. Several Change Requests (CRs) were selected as promising targets to demonstrate the utility of formal methods in this demanding application domain. A CR to add new navigation capabilities to the Shuttle, based on Global Positioning System (GPS) technology, is the focus of this industrial usage report. Portions of the GPS CR were modeled using the language of SRI's Prototype Verification System (PVS). During a limited analysis conducted on the formal specifications, numerous requirements issues were discovered. We present a summary of these encouraging results and conclusions we have drawn from the pilot project.

DiVito, Ben L.↗

Runtime Verification: From Propositional to First-Order Temporal Logic

Runtime Verification is a branch of formal methods concerned with analysis of execution traces for the purpose of determining the state or general quality of the executing system. The field covers numerous approaches, one of which is specification-based runtime verification, where execution traces are checked against formal specifications. The paper presents syntax, semantics, and monitoring algorithms for respectively propositional and first-order temporal logics. In propositional logics the observed events in the execution trace are represented using atomic propositions, while first-order logic allows universal and existential quantification over data occurring as arguments in events. Monitoring of the first-order case is drastically more challenging than the propositional case, and we present a solution for this problem based on BDDs. We furthermore discuss monitorability of temporal properties by dividing them into different classes representing different degrees of monitorability.

Peled, Doron↗

Investigating Actuation Force Fight with Asynchronous and Synchronous Redundancy Management Techniques

Within distributed fault-tolerant systems the term force-fight is colloquially used to describe the level of command disagreement present at redundant actuation interfaces. This report details an investigation of force-fight using three distributed system case-study architectures. Each case study architecture is abstracted and formally modeled using the Symbolic Analysis Laboratory (SAL) tool chain from the Stanford Research Institute (SRI). We use the formal SAL models to produce k-induction based proofs of a bounded actuation agreement property. We also present a mathematically derived bound of redundant actuation agreement for sine-wave stimulus. The report documents our experiences and lessons learned developing the formal models and the associated proofs.

Hall, Brendan↗

Scatter in Carbon/Silicon Carbide (C/SiC) Composites Quantified

Carbon-fiber-reinforced silicon carbide matrix (C/SiC) composites processed by chemical vapor infiltration are candidate materials for aerospace thermal structures. Carbon fibers can retain properties at very high temperatures, but they are known to have poor oxidation resistance in adverse, high-temperature environments. Nevertheless, the combination of CVI-SiC matrix with higher stiffness and oxidation resistance, the interfacial coating, and additional surface-seal coating provides the necessary protection to the carbon fibers, and makes the material viable for high-temperature space applications operating under harsh environments. Furthermore, C/SiC composites, like other ceramic matrix composites (CMCs), exhibit graceful non-catastrophic failure because of various inherent energy dissipating mechanisms. The material exhibits nonlinearity in deformation even at very low stress levels. This is the result of the severe matrix microcracking present in the as processed composite because of large differences between the coefficients of thermal expansion of the fiber and the matrix. Utilization of these advanced composites in next generation space vehicles will require innovative structural configurations, updated materials, and refined analyses. Structural safety issues for these vehicles are in direct competition with performance and cost. One would have to quantify the uncertainties associated with the design using formal probabilistic methods. Specifically four fundamental aspects on which analyses are based-- (1) loading conditions, (2) material behavior, (3) geometrical configurations, and (4) structural connections between the composite components and baseline structure--are stochastic in nature. A direct way to formally account for uncertainties is to develop probabilistic structural analysis methods where all participating variables are described by appropriate probability density functions. The present work, however, focuses on analyzing the stochastic material behavior of these advanced composites using formal probabilistic analysis methods. Often, some of the desirable property characteristics that allow composites to offer advantages over conventional structural materials (like tailoring of composite properties) and the complexity are in fact responsible for their greater statistical variability and the requirements for more characterization tests. Composite properties are anisotropic as well, having different properties in different directions. This means that characterization of a property such as stiffness--which will vary greatly depending on the orientation of the fiber relative to the direction of the testing--must be repeated for several different directions and loading conditions. The fabrication process for composites also introduces statistical variations in properties and geometry. A composite part is produced in a number of steps, each of which introduces statistical variability. The matrix is usually produced from a combination of raw materials; and the fiber, which has its own set of properties, is often coated or surface treated, introducing yet another source of variability.

Murthy, Pappu L. N.↗

Beam dynamics in independent phased cavities

Linear accelerators containing the sequence of independently phased cavities with constant geometrical velocity along each structure are widely used in practice. The chain of cavities with identical cell lengths is utilized within a certain beam velocity range, with subsequent transformation to the next chain with higher cavity velocity. Design and analysis of beam dynamics in this type of accelerator are usually performed using numerical simulations. A full theoretical description of particle acceleration in an array of independent phased cavities has not been developed. In the present paper, we provide an analytical treatment of beam dynamics in such linacs employing Hamiltonian formalism. We begin our analysis with an examination of beam dynamics in an equivalent traveling wave of a single cavity, propagating within accelerating section with constant phase velocity. We then consider beam dynamics in arrays of cavities, utilizing an effective traveling wave propagating along with the whole accelerator with the velocity of synchronous (reference) particle. The analysis concluded with the determination of the matched beam conditions. Finally, we present a beam dynamics study in 805 MHz Coupled Cavity Linac of the LANSCE accelerator facility.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗