Search NASA⌕ Search

SEARCH · Search NASA

Results for “formal specifications”

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 19 records

Formally Verified ZTA Requirements for OT/ICS Environments with Isabelle/HOL

The clean energy transformation includes the integration of distributed energy resources with the power grid, which has led to a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Power grids infrastructure represents an operational technology environment that has become a system of systems, integrating heterogeneous devices which are both software-and hardware-intensive; as a result, there are increasing demands to exploit advances in the commodity of software-hardware infrastructures to improve energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, which leads to vulnerabilities and undesirable outcomes. The use of formal methods to characterize and prove system requirements removes ambiguity, increases automation, and provides high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system-level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.

formal methods↗

Fortran mimetic abstraction language (Formal) v0.1.

The Fortran mimetic abstraction language ("Formal") is a domain-specific language (DSL) embedded in Fortran 202Y [1]. Formal provides novel software abstractions for simulating phenomena governed by the partial differential equations (PDEs) of vector and tensor calculus. Such equations model an extremely broad set of physical phenomena, ranging from atmospheric winds to light propagation. Formal's data structures and algorithms mimic in form and behavior continuous functions and operators. Formal supports these mathematical constructs using mimetic discretizations that define a discrete calculus satisfying various tensor calculus theorems, thereby ensuring high-fidelity representations of the physics being modeled. [2] Formal 0.1.0 also lays a foundation for the future use of Fortran 202Y type-safe templates to facilitate the formal verification of tensor contractions in computational physics and artificial intelligence [3]. [1] "Fortran 202Y" is Fortran standard committee's informal designation for the next Fortran revision, which will likely be "Fortran 2028". [2] Corbino, J. and Castillo, J. (2020) Journal of Computational and Applied Mathematics, https://doi.org/10.1016/j.cam.2019.06.042. [3] Haveraaen, M., Järvi, J., & Rouson, D. (2019). Reflecting on Generics for Fortran. https://j3-fortran.org/doc/year/19/19-188.pdf.

Rouson, Damian [Lawrence Berkeley National Laborat↗

Multi-Rigor Agile Verification and Rapid Prototyping for Formally Verified Software

We propose a novel approach to developing formally verified systems through Multi-rigor Agile Verification. Multi-rigor Agile Verification is rooted in the hypothesis of Rigor Independence, that a system’s specification and verification architecture depend primarily on the system requirements to be verified, and they depend very little on the rigor level of the methods used to verify those requirements. Due to its iterative nature, Multi-rigor Agile Verification promises to mitigate many of the high upfront design costs experienced by formally verified systems and to deliver a better-architected, and thus better-trusted, system in the end. We then discuss the tooling needed to perform Multi-rigor Agile Verification and go in depth to build one of those tools, which directly generates executable prototype code from declarative formal specifications using the Maude rewrite-logic framework.

97 MATHEMATICS AND COMPUTING↗

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗

I Can’t Read All That! Improving the Usability of Semantic Models Using Concise, Ontology-Agnostic, Building-Specific Schemas

Semantic ontologies have enabled the creation of formalized, machine-readable descriptions of heterogenous building systems by providing dictionaries of well defined concepts that can be applied to model them. Within a semantic model of a particular building, a subset of an ontology's concepts may be applied in different ways to represent a particular perspective of the building's systems. How the concepts were applied can only be understood by examining the large amount of instance data within a semantic model, which leads to usability challenges. We propose a concise, ontology-agnostic method for defining building-specific schema (b-schema) graphs that summarize the structure and content of a semantic model. This approach provides a queryable and concise representation of the model's contents, separate from the instance data within a model, that can mitigate the challenges posed by the size and complexity of semantic models in processes such as visualization, querying, validation, and the use of large language models (LLMs). We validate our approach on semantic models based on the Brick and ASHRAE S223 ontologies. Results demonstrate that b-schemas significantly reduce the complexity of visual interpretation, accelerate SPARQL queries and SHACL validation, and improve LLM-based knowledge graph question answering.

Paul, Lazlo [Lawrence Berkeley National Laboratory↗

Thermodynamics of Liquid Uranium from Atomistic and Ab Initio Modeling

We present thermodynamic properties for liquid uranium obtained from classical molecular dynamics (MD) simulations and the first-principles theory. The coexisting phases method incorporated within MD modeling defines the melting temperature of uranium in good agreement with the experiment. The calculated melting enthalpy is in agreement with the experimental range. Classical MD simulations show that ionic contribution to the total specific heat of uranium does not depend on temperature. The density of states at the Fermi level, which is a crucial parameter in the determination of the electronic contribution to the total specific heat of liquid uranium, is calculated by ab initio all electron density functional theory (DFT) formalism applied to the atomic configurations generated by classical MD. The calculated specific heat of liquid uranium is compared with the previously calculated specific heat of solid γ-uranium at high temperatures. The liquid uranium cannot be supercooled below T sc ≈ 800 K or approximately about 645 K below the calculated melting point, although, the self-diffusion coefficient approaches zero at T D ≈ 700 K. Uranium metal can be supercooled about 1.5 times more than it can be overheated. The features of the temperature hysteresis are discussed.

36 MATERIALS SCIENCE↗

The Essence of Cryptol: A Denotational Cryptol Interpreter in Coq for Foundational Assurances for Quantum Resistant Cryptosystems

Systems of the utmost consequence need a means to establish authenticity of software and data. Cryptosystems implement authentication, but can be vulnerable to cryptographic and implementation attacks. With the threat of quantum cryptographic attacks, “post-quantum” cryptosystems (PQCs) must be henceforth used in these systems. However, the new cryptography needs new ways to, rigorously and machine-checkably, prove systems free of vulnerabilities. We propose a retargetable capability to rapidly instantiate proven correct postquantum cryptosystems through novel proof-carrying synthesis and proof-automation technique, extending those proven successful on existing systems. This capability is crucial to meeting the cryptographic requirements for future high-consequence systems. Since specifications for high consequence cryptography are presently captured in a domain specific language known as Cryptol. While this can enable convenient fully automated reasoning about Cryptol specificaitons and implementations via the Software Analysis Workbench (SAW), Cryptol has expressivity gaps, so that cryptosystems with probabilistic programming features like Falcon cannot be fully expressed in the language. Moreover, SAW’s automation fails for programs and specificaitons with inductive and recursive structure, as in the Sphincs+ PQC. Finally, Cryptol and SAW together represent some 200,000 lines of unverified Haskell, so that the any guarantees about high consequence cryptography are presently contingent on a large, unverified, yet trusted computing base. The first step of the larger project of agile, assured crpytography is therefore to provide a formal, mechanized semantics for Cryptol, so that the specifications expressed by cryptographers in Cryptol can be reasoned about and compiled into performant implementations with a foundational, machine checkable certificate of correctness. This report describes our work on this first step, culminating in the design of a certified denotational interpreter, in Coq, for core Cryptol.

97 MATHEMATICS AND COMPUTING↗

Real-Time Protocol Engineering with the B Language

It is an invariant that critical cyberphysical systems should not fail. Mission assurance requires systems to behave with predictability, especially in their ability to satisfy real-time constraints. The NIST standard for Engineering Trustworthy Secure Systems, National Institute of Standards and Technology (NIST) Special Publication (SP) 800-160v1r1 states that formal methods are the highest level for meeting assurance requirements. There is a tension between the formal method software development process (Figure 1), which does not introduce time specificity until the latter stages of the development process (concrete model), and the need to gain confidence that time constraints will be satisfied. This paper formalizes the practical application of temporal entities e.g. Propositional Temporal Logic (PTL), Temporal Logic of Actions Plus (TLA+), etc. to critical systems.

97 MATHEMATICS AND COMPUTING↗

ROSE Castor

ROSE Castor is a tool enabling automated verification of C++, built off of the ROSE compiler framework and the Why3 framework. Castor defines a verification language for providing specifications of C++ code, letting users perform automated functional formal verification of their C++ code. Castor is designed to target C++17, and supports a subset of the language, including classes, functions, templates, integers and booleans, pointers and references, and single inheritance. Castor currently does not support multiple or virtual inheritance, virtual functions, floating-point, threading, lambda functions, or the C++ STL, though some of these are planned in future updates. Castor ships with an in-house parser for parsing verification conditions.

Lane, PhillipA [Lawrence Livermore National Labora↗

Resilience Through Data-Driven, Intelligent Designed Control: A Formal Methods Approach

The PNNL and GTRI team developed a strategy to integrate temporal logic rule specification for detection of cyber-intrusion in the source code and control algorithms of CPS using advanced cyber-data. The GTRI team utilized its capabilities in rule synthesis and temporal logic specifications for software assurance and verification to detect and predict impact of cyber-intrusions and malware in the computational and control algorithms of cyber-physical systems. The team also developed a testing and verification approach that could be used to validate the suggested approach against a realistic use-case CPS showcasing improvements in system impact prediction performance. Temporal logic offers a compact expression of events in absolute and relative time and has a formalized translation to state machines. As such, temporal logic rules can feasibly be synthesized to any system as a rule engine, with the process being formally verified to be correct. The goal here is to utilize temporal logic rules to detect cyber-attacks and manipulations in the computational algorithms and provide real-time software assurance and verification guarantees.

97 MATHEMATICS AND COMPUTING↗

Machine-learning based model reduction for partial differential equations

We develop a novel synergistic approach between model reduction and machine learning. The specific goal of this project is to aid in the construction of reduced order models for basis functions that are custom-made to represent the solution of partial differential equations. Partial differential equations (PDEs) are one of the main mathematical tools for describing physical phenomena. However, due to either efficiency or necessity, for many real-world problems, we are interested in constructing reduced order models (ROMs) which focus only on the explicit computation of subsets of the active spatio-temporal scales in the problem, while treating the interaction with the rest of the scales approximately. The task of accurate representation of such interactions (usually called memory terms) constitutes a vast area of research known as model reduction. PI Stinis has significant expertise in the construction of ROMs for complex systems. In addition, in recent work with the project key participant Qadeer, they have utilized machine learning to acquire custom-made basis functions (CBFs) to expand the solutions of PDEs. In the proposed work, we will merge the two concepts by constructing ROMs for subsets of the CBFs needed to represent the solution of a PDE. Specifically, we will use the Mori-Zwanzig model reduction formalism to construct ROMs for subsets of CBFs for nonlinear PDEs of various complexity, as well as investigate the usage of CBFs in the spectral vanishing viscosity method for problems that can form shocks in finite time. The outcome of the research is aimed to be proof-of-concept about a novel synergistic approach between model reduction and machine learning, thus advancing the field of scientific machine learning. Such a capability will benefit the efficient modeling of physical systems appearing in various areas of interest to the DOE.

97 MATHEMATICS AND COMPUTING↗

The structural basis for the broad aldehyde specificity of the aminoaldehyde dehydrogenase PauC from the human pathogen Pseudomonas aeruginosa

Abstract Despite significant differences in size and formal charge, the aldehyde dehydrogenasePaPauC (PA5312) fromPseudomonas aeruginosaPAO1 efficiently catalyzes the NAD + ‐dependent oxidation of the aminoaldehydes formed in polyamines degradation. We report here thatPaPauC also oxidizes 4‐guanidinebutyraldehyde, formed in one arginine degradation pathway, trimethylaminobutyraldehyde, of unknown metabolic origin, and indole‐3‐acetaldehyde, a precursor of the plant growth‐promoting hormone indoleacetic acid.PaPauC has been proposed as a potential target for combatingP. aeruginosa. However, understanding its structure–function relationships, crucial for developing specific inhibitors, is lacking. Using X‐ray crystallography, we identified the structural characteristics that determinePaPauC broad aldehyde specificity: a spacious aldehyde‐entrance tunnel and six active‐site residues. Docking simulations, site‐directed mutagenesis, and kinetic analyses support the interactions of Lys479 with glutamylated aminoaldehydes; Phe169, Trp176, and Phe467 with amino and guanidinium groups through cation–π interactions and with the indole group via NH–π and CH–π interactions; Asp459 with amino and indole groups; and Thr303 with amide and guanidinium groups. Exploiting the distinctive structural features of thePaPauC active site could aid in developing specific inhibitors to combatP. aeruginosainfections in humans and animals, as well as in preventing its colonization of plants, which are abundantP. aeruginosareservoirs and, therefore, a significant source of human infections.

Biochemistry & Molecular Biology↗

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↗

Highly Anisotropic Quasi‐Direct Organic Metal Halide Hybrids: A Platform for Polarization‐Sensitive Optoelectronics

Low-dimensional organic–inorganic metal halide hybrids (OMHHs) exhibit remarkable optical properties and enhanced environmental stability. We investigate a 1D OMHH with formula C 4 N 2 H 14 PbBr 4 , consisting of Pb–Br chains separated by organic cations, which shows a large Stokes shift (0.83 eV) and broadband emission. Through first-principles calculations and polarized Raman spectroscopy, we characterize the material's vibrational properties and identify the specific phonon modes that drive exciton self-trapping. Our novel GW/Bethe-Salpeter equation force formalism reveals that low-frequency phonons (∼ 100 cm −1 , primarily involving Pb–Br motions) couple strongly with excitons, with a remarkably high Huang-Rhys factor of 137 ± 4, and gives a pathway for ultrafast structural analysis during the absorption process. This phonon-exciton coupling mechanism explains the material's broadband emission and provides a pathway for controlling optical properties through vibrations and for tuning vibrations through optical excitations. The material also exhibits highly anisotropic optical properties and electronic transport, with bands that are dispersive along the Pb–Br chains but nearly flat in perpendicular directions, resulting in direction-dependent electrical conductivity that is calculated to be an order of magnitude higher along the chain direction and consistent with measurements. These combined properties make this system an excellent platform for polarization-sensitive optoelectronic devices.

36 MATERIALS SCIENCE↗

Towards Provable Security in Industrial Control Systems Via Dynamic Protocol Attestation

Industrial control systems (ICSs) increasingly rely on digital technologies vulnerable to cyber attacks. Cyber attackers can infiltrate ICSs and execute malicious actions. Individually, each action seems innocuous. But taken together, they cause the system to enter an unsafe state. These attacks have resulted in dramatic consequences such as physical damage, economic loss, and environmental catastrophes. This paper introduces a methodology that restricts actions using protocols. These protocols only allow safe actions to execute. Protocols are written in a domain specific language we have embedded in an interactive theorem prover (ITP). The ITP enables formal, machine-checked proofs to ensure protocols maintain safety properties. We use dynamic attestation to ensure ICSs conform to their protocol even if an adversary compromises a component. Since protocol conformance prevents unsafe actions, the previously mentioned cyber attacks become impossible. We demonstrate the effectiveness of our methodology using an example from the Fischertechnik Industry 4.0 platform. We measure dynamic attestation's impact on latency and throughput. Our approach is a starting point for studying how to combine formal methods and protocol design to thwart attacks intended to cripple ICSs.

97 MATHEMATICS AND COMPUTING↗

Vidyut3d: A GPU accelerated fluid solver for non-equilibrium plasmas on adaptive grids

We present the numerical methods, programming methodology, verification, and performance assessment of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures, in this work. Our plasma fluid model solves the coupled conservation equations for species transport, electrostatic Poisson and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive-grid/particle management library, AMReX, and is portable over widely available vendor specific GPU architectures. We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth-order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on capacitive discharges and atmospheric pressure streamer propagation. We demonstrate the use of our solver on two 3D simulation cases: an atmospheric streamer propagation in Ar-H2 mixtures and a low pressure three-electrode radio frequency reactor. Our performance studies on three different CPU+GPU architectures indicate ~ 150-400X speed-up using AMD and NVIDIA GPUs per time step compared to a single CPU core for a 4 million cell simulation with 15 species.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Vidyut3d: A Gpu Accelerated Fluid Solver for Non-Equilibrium Plasmas on Adaptive Grids

We present the numerical methods, programming methodology, verification, and performance assessment of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures, in this work. Our plasma fluid model solves the coupled conservation equations for species transport, electrostatic Poisson and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive-grid/particle management library, AMReX, and is portable over widely available vendor specific GPU architectures. We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth-order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on capacitive discharges and atmospheric pressure streamer propagation. We demonstrate the use of our solver on two 3D simulation cases: an atmospheric streamer propagation in Ar-H2 mixtures and a low pressure twin electrode radio frequency reactor. Our performance studies on three different CPU+GPU architectures indicate approximately 150-400X speed-up using AMD and NVIDIA GPUs per time step compared to a single CPU core for a 4 million cell simulation with 15 species.

Sitaraman, Hariswaran↗

Importance of finite-size corrections for accurate ab initio modeling of carrier capture at semiconductor defects: A case study of substitutional C N in GaN

In ab initio studies of carrier-capture processes in defective semiconductor materials, the single-effective-mode formalism and the static-coupling approximation have become the predominant theoretical approaches for determining carrier-capture coefficients. The single-mode formalism relies on accurate nonequilibrium defect energies obtained from density-functional theory (DFT), where required inputs are a series of configurationally displaced, defect-containing supercells obtained using an interpolative ansatz, and where the DFT outputs are corresponding total energies that have traditionally been postprocessed using a long-established ground-state formulation of finite-size corrections and defect-formation energies. This formulation remains commonly used even though the defects that form a configuration-coordinate (CC) diagram typically exist as structures that are displaced from the ground state. To remedy this inconsistency, Kumagai has recently proposed novel methods for implementing finite-size corrections specifically intended for DFT calculations of the defect energies used to construct CC diagrams and implement the single-mode formalism [Y. Kumagai, Phys. Rev. B 107, L220101 (2023)]. Kumagai's approach builds on the latest finite-size-correction methods introduced to describe vertical charge-state transitions for charge-localizing point defects in semiconductors and insulators [T. Gake et al., Phys. Rev. B 101, 020102 (2020); S. Falletta et al., Phys. Rev. B 102, 041115 (2020)]. The newly identified finite-size artifact treated in these studies is the polarization charge induced on a configurationally frozen defect and its subsequent interaction with a vertical transition in charge state. In this work, we evaluate Kumagai's proposed methodology by applying it in a high-precision DFT study of carrier capture by substitutional C N in GaN, a well-characterized and technologically relevant defect and material. We have rigorously calculated C N defect energies across various supercell sizes for each defect configuration and charge state on the hole-capture CC diagram of C N (𝑞=−1), enabling a direct comparison of the slopes of the defect energies versus inverse cell size with those predicted by Kumagai. The most consequential prediction of Kumagai's method is that these slopes distinctly vary as the square of the linear-interpolation parameter used to construct the nonequilibrium defect configurations. Our results quantitatively support this prediction. Moreover, with these new finite-size corrections and multiple-cell-size DFT calculations in place, we find that the classical energy barrier for hole capture by C N (𝑞=−1) in GaN decreases to 0.092–0.127 eV. This finding confirms the recent ≈ 0.1 eV prediction of Reshchikov based on the weak temperature dependence for hole capture observed in photoluminescence experiments [M. A. Reshchikov, J. Appl. Phys. 129, 121101 (2021)]. These results stand in stark contrast to previously calculated barriers of 0.486 and 0.73 eV, which also used the single-mode formalism but were obtained by instead using ground-state-based finite-size corrections. Our reduced classical barrier for capture increases the temperature-dependent hole-capture coefficient of a C N (𝑞=−1) defect by more than two to four orders of magnitude for temperatures of 100–600 K, compared to the previous 0.486 eV results. While other defects may not be as dramatically affected as here, we suggest that incorporating proper finite-size corrections for the vertical-transition-like states embedded within CC diagrams is an essential, yet previously unrecognized, component of accurate modeling of carrier-capture when using the single-effective-mode formalism.

dielectric properties↗