Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “GENERIC formalism”

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 55 records · Page 3

Towards a Verifiable Domain-Specific Language for Hardware-Accelerated Stencils

Defining a domain-specific language (DSL) that supports vector-calculus abstractions eases the porting of partial differential equation (PDE) solvers to specialized architectures. Sufficiently high-level abstractions empower users to express universal laws with sufficient generality that the laws must always hold true within their domain of validity. A broad class of PDE solvers employs stencil-based algorithms, the target domain of Berkeley Lab's stencil accelerator chip co-design project. First released as open-source in January 2026, the Formal software framework lays a foundation for defining an embedded DSL based on composable operators that implement mimetic numerical methods -- stencil algorithms that guarantee satisfaction of discrete versions of important vector calculus theorems. The Formal DSL will be the frontend to a new class of stencil-PDE accelerators developed jointly by LBNL, UHCL, and UC Berkeley through the DOE Competitive Portfolios for Computer Science Project. This offers the potential of an order of magnitude acceleration for this important category of computational methods to serve the DOE mission. Future work on the Formal DSL will facilitate software verification via type-safe templates that enable problem-specific correctness proofs relying upon generic function theory and carefully crafted unit tests.

Rouson, Damian↗

Open architectures for formal reasoning and deductive technologies for software development

The objective of this project is to develop an open architecture for formal reasoning systems. One goal is to provide a framework with a clear semantic basis for specification and instantiation of generic components; construction of complex systems by interconnecting components; and for making incremental improvements and tailoring to specific applications. Another goal is to develop methods for specifying component interfaces and interactions to facilitate use of existing and newly built systems as 'off the shelf' components, thus helping bridge the gap between producers and consumers of reasoning systems. In this report we summarize results in several areas: our data base of reasoning systems; a theory of binding structures; a theory of components of open systems; a framework for specifying components of open reasoning system; and an analysis of the integration of rewriting and linear arithmetic modules in Boyer-Moore using the above framework.

Mccarthy, John↗

Hidden Sectors from Multiple Line Bundles for the B−L$B-L$ MSSM

Abstract We give a formalism for constructing hidden sector bundles as extensions of sums of line bundles in heterotic M‐theory. Although this construction is generic, we present it within the context of the specific Schoen threefold that leads to the physically realistic MSSM model. We discuss the embedding of the line bundles, the existence of the extension bundle, and a number of necessary conditions for the resulting bundle to be slope‐stable and thus supersymmetric. An explicit example is presented, where two line bundles are embedded into the factor of the maximal subgroup of the hidden sector E 8 gauge group, and then enhanced to a non‐Abelian bundle by extension. For this example, there are in fact six inequivalent extension branches, significantly generalizing that space of solutions compared with hidden sectors constructed from a single line bundle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modified gravitational wave propagation with higher modes and its degeneracies with lensing

Low-energy alternatives to General Relativity (GR) generically modify the phase of gravitational waves (GWs) during their propagation. As detector sensitivities increase, it becomes key to understand how these modifications affect the GW higher modes and to disentangle possible degeneracies with astrophysical phenomena. We apply a general formalism — the WKB approach — for solving analytically wave propagation in the spatial domain with a modified dispersion relation (MDR). We compare this WKB approach to applying a stationary phase approximation (SPA) in the temporal domain with time delays associated to the group or particle velocity. To this end, we extend the SPA to generic signals with higher modes, keeping careful track of reference phases and arrival times. We find that the WKB approach coincides with the SPA using the group velocity, in agreement with the principles of wave propagation. We then explore the degeneracies between a GW propagation with an MDR and a strongly-lensed GW in GR, since the latter can introduce a frequency-independent phase shift which is not degenerate with source parameters in the presence of higher modes. We find that for a particular MDR there is an exact degeneracy for wave propagation, unlike with the SPA for particle propagation. For the other cases, we search for the values of the MDR parameters that minimize the χ 2 and conclude that strongly-lensed GR GWs could be misinterpreted as GWs in modified gravity. As a result, future MDR constraints with higher mode GWs should include the possibility of frequency-independent phase shifts, allowing for the identification of modified gravity and strong lensing distortions at the same time.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Guiding Integration of Formal Verification in Assurance Cases

Assurance cases are being increasingly acknowledged as away to build trust in complex systems with autonomous capabilities. An assurance case is a comprehensive, defensible, and valid justification that a system will function as intended for a specific mission and operating environment. Formal verification is often reserved for the most critical components of such systems. However, formal verification tools are often complex, and their usage is subject to many constraints and contextual dependencies. This can raise challenges both for performing the verification as well as reflecting the verification results appropriately in the assurance case, especially for non-expert users of the verification tool. To address these challenges, we present a tool-supported methodology for integrating formal verification results in an assurance case by capturing key verification method information in a rigorously constructed assurance case. In particular, we capture the tool specification in terms of its inputs, outputs, and assurance constraints as assumptions over inputs and guarantees provided over its outputs. The tool specification is parametrized over the inputs and outputs to both guide the intended application of the tool, as well as to check that the tool has been applied following the stated assumptions and that the guarantees hold. We define a generic tool assurance argument pattern that enables integration of the verification results in the assurance case by allowing custom refinement and automated instantiation for each tool use. We demonstrate our methodology on two formal verification tools and their applications to the verification of neural network properties for the aircraft domain.

Assurance Cases↗

Oblate-Earth Effects on the Calculation of Ec During Spacecraft Reentry

The bulge in the Earth at its equator has been shown to lead to a clustering of natural decays biased to occur towards the equator and away from the orbit's extreme latitudes. Such clustering must be considered when predicting the Expectation of Casualty (Ec) during a natural decay because of the clustering of the human population in the same lower latitudes. This study expands upon prior work, and formalizes the correction that must be made to the calculation of the average exposed population density as a result of this effect. Although a generic equation can be derived from this work to approximate the effects of gravitational and atmospheric perturbations on a final decay, such an equation averages certain important subtleties in achieving a best fit over all conditions. The authors recommend that direct simulation be used to calculate the true Ec for any specific entry as a more accurate method. A generic equation is provided, represented as a function of ballistic number and inclination of the entering spacecraft over the credible range of ballistic numbers.

Bacon, John B.↗

Assessment of the Orion-SLS Interface Management Process in Achieving the EIA 731.1 Systems Engineering Capability Model Generic Practices Level 3 Criteria

NASA is currently developing the next generation crewed spacecraft and launch vehicle for exploration beyond earth orbit including returning to the Moon and making the transit to Mars. Managing the design integration of major hardware elements of a space transportation system is critical for overcoming both the technical and programmatic challenges in taking a complex system from concept to space operations. An established method of accomplishing this is formal interface management. In this paper we set forth an argument that the interface management process implemented by NASA between the Orion Multi-Purpose Crew Vehicle (MPCV) and the Space Launch System (SLS) achieves the Level 3 tier of the EIA 731.1 System Engineering Capability Model (SECM) for Generic Practices. We describe the relevant NASA systems and associated organizations, and define the EIA SECM Level 3 Generic Practices. We then provide evidence for our compliance with those practices. This evidence includes discussions of: NASA Systems Engineering Interface (SE) Management standard process and best practices; the tailoring of that process for implementation on the Orion to SLS interface; changes made over time to improve the tailored process, and; the opportunities to take the resulting lessons learned and propose improvements to our institutional processes and best practices. We compare this evidence against the practices to form the rationale for the declared SECM maturity level.

Jellicorse, John J.↗

Horocycle regulator: Exact cutoff-independence in AdS/CFT

While the entanglement entropy of a single subregion in quantum field theory is formally infinite and requires regularization, certain combinations of entropies are perfectly finite in the limit that the regulator is removed, the mutual information being a common example. For generic regulator schemes, such as a holographic calculation with a uniform radial cutoff, these quantities show nontrivial dependence on the regulator at finite values of the cutoff. We investigate a holographic regularization scheme defined in three-dimensional anti-de Sitter space constructed from , curves in two-dimensional hyperbolic space perpendicular to all geodesics approaching a single point on the boundary, that leads to finite information measures that are cutoff independent, even at finite values of the regulator. We describe a broad class of such information measures, and describe how the field theory dual to the horocycle regulator is inherently nonlocal. Published by the American Physical Society 2024

Agrawal, Sristy↗

Tactical Synthesis Of Efficient Global Search Algorithms

Algorithm synthesis transforms a formal specification into an efficient algorithm to solve a problem. Algorithm synthesis in Specware combines the formal specification of a problem with a high-level algorithm strategy. To derive an efficient algorithm, a developer must define operators that refine the algorithm by combining the generic operators in the algorithm with the details of the problem specification. This derivation requires skill and a deep understanding of the problem and the algorithmic strategy. In this paper we introduce two tactics to ease this process. The tactics serve a similar purpose to tactics used for determining indefinite integrals in calculus, that is suggesting possible ways to attack the problem.

Nedunuri, Srinivas↗

The Essence of Reactivity

Reactive programming, functional reactive programming, event-based programming, stream programming, and temporal logic all share an underlying commonality: values can vary over time. These languages differ in multiple ways, including the nature of time itself (e.g., continuous or discrete, dense or sparse, implicit or explicit), on how much of the past and future can be referenced, on the kinds of values that can be represented, as well as the mechanisms used to evaluate expressions or formulas. This paper presents a series of abstractions that capture the essence of different forms of time variance. By separating the aspects that differentiate each family of formalisms, we can better express the commonalities and differences between them. We demonstrate our work with a prototype in Haskell that allows us to write programs in terms of a generic interface that can be later instantiated to different abstractions depending on the desired target.

reactive programming↗

Versatile stochastic model for predictive KMC simulation of fcc metal nanostructure evolution with realistic kinetics

Stochastic lattice-gas models provide the natural framework for analysis of the surface diffusion-mediated evolution of crystalline metal nanostructures on the appropriate time scale (often 10 1 –10 4 s) and length scale. Model behavior can be precisely assessed by kinetic Monte Carlo simulation, typically incorporating a rejection-free algorithm to efficiently handle the broad range of Arrhenius rates for hopping of surface atoms. The model should realistically prescribe these rates, or the associated barriers, for a diversity of local surface environments. However, commonly used generic choices for barriers fail, even qualitatively, to simultaneously describe diffusion for different low-index facets, for terrace vs step edge diffusion, etc. We introduce an alternative Unconventional Interaction–Conventional Interaction formalism to prescribe these barriers, which, even with few parameters, can realistically capture most aspects of behavior. Here, the model is illustrated for single-component fcc metal systems, mainly for the case of Ag. It is quite versatile and can be applied to describe both the post-deposition evolution of 2D nanostructures in homoepitaxial thin films (e.g., reshaping and coalescence of 2D islands) and the post-synthesis evolution of 3D nanocrystals (e.g., reshaping of nanocrystals synthesized with various faceted non-equilibrium shapes back to 3D equilibrium Wulff shapes).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Probability of Failure and Risk Assessment of Propulsion Structural Components

Due to increasing need to account for the uncertainties in material properties, loading conditions, or geometries, a methodology was developed to determine structural reliability and the assess the risk associated with it. The methodology consists of a probabilistic structural analysis by a probabilistic finite element computer code Nonlinear Evaluation of Stochastic Structures Under Stress (NESSUS) and a generic probabilistic material properties model. The methodology is versatile and is equally applicable to high and cryogenic temperature structures. Results obtained demonstrate that the whole issue of structural reliability and risk can be formally evaluated using the methodology developed which is inclusive of uncertainties in material properties, structural parameters and loading conditions. The methodology is described in some detail with illustrative examples.

Shiao, Michael C.↗

New framework for extracting GPDs from exclusive photon electroproduction

Recently, a new framework for studying generic 2 → 3 hard exclusive reactions, referred to as single-diffractive hard exclusive processes, has been introduced to provide a cleaner separation of the underlying physical mechanisms. In this work, we expand this formalism to the case of exclusive real-photon electroproduction off a nucleon, 𝑒⁡(ℓ) +𝑁⁡(𝑝) →𝑒⁡(ℓ′) +𝑁⁡(𝑝′) + 𝛾⁡(𝑞′), which represents the classical channel for accessing generalized parton distributions (GPDs) in nucleons and nuclei. This extension enables a more systematic and physically transparent formulation of the reaction dynamics, paving the way for improved extractions of GPDs from experimental data as compared to existing approaches.

Qiu, Jian-Wei [Thomas Jefferson National Accelerat↗

Design review - A tool for all seasons.

The origins of design review are considered together with questions of definitions. The main characteristics which distinguish the concept of design review discussed from the basic master-apprentice relationship include competence, objectivity, formality, and a systematic approach. Preliminary, major, and final reviews are the steps used in the management of the design and development process in each company. It is shown that the design review is generically a systems engineering milestone review with certain unique characteristics.

Liberman, D. S.↗

Probability of failure and risk assessment of propulsion structural components

Because of the increasing need to account for the uncertainties in material properties, loading conditions, geometry, etc., a methodology was developed to determine structural reliability and to assess the associated risk. The methodology consists of a probabilistic structural analysis by a probabilistic finite element computer code, numerical evaluation of stochastic structures under stress (NESSUS), and a generic probabilistic material property model. The methodology is versatile and is equally applicable to structures operating at high and cryogenic temperature environments. Results obtained demonstrate that the issues of structural reliability and risk can be formally evaluated by using the methodology developed which is inclusive of the uncertainties in material properties, structural parameters, and loading conditions. The methodology is described in some detail with illustrative examples.

Shiao, Michael C.↗

Model Checking with Edge-Valued Decision Diagrams

We describe an algebra of Edge-Valued Decision Diagrams (EVMDDs) to encode arithmetic functions and its implementation in a model checking library. We provide efficient algorithms for manipulating EVMDDs and review the theoretical time complexity of these algorithms for all basic arithmetic and relational operators. We also demonstrate that the time complexity of the generic recursive algorithm for applying a binary operator on EVMDDs is no worse than that of Multi- Terminal Decision Diagrams. We have implemented a new symbolic model checker with the intention to represent in one formalism the best techniques available at the moment across a spectrum of existing tools. Compared to the CUDD package, our tool is several orders of magnitude faster

Roux, Pierre↗

Model-Checking with Edge-Valued Decision Diagrams

We describe an algebra of Edge-Valued Decision Diagrams (EVMDDs) to encode arithmetic functions and its implementation in a model checking library along with state-of-the-art algorithms for building the transition relation and the state space of discrete state systems. We provide efficient algorithms for manipulating EVMDDs and give upper bounds of the theoretical time complexity of these algorithms for all basic arithmetic and relational operators. We also demonstrate that the time complexity of the generic recursive algorithm for applying a binary operator on EVMDDs is no worse than that of Multi-Terminal Decision Diagrams. We have implemented a new symbolic model checker with the intention to represent in one formalism the best techniques available at the moment across a spectrum of existing tools: EVMDDs for encoding arithmetic expressions, identity-reduced MDDs for representing the transition relation, and the saturation algorithm for reachability analysis. We compare our new symbolic model checking EVMDD library with the widely used CUDD package and show that, in many cases, our tool is several orders of magnitude faster than CUDD.

Roux, Pierre↗