Search NASA⌕ Search

Engineering topics

Singh, Amrinder

Publications and source records attributed to Singh, Amrinder.

The smallest functional antibody fragment: Ultralong CDR H3 antibody knob regions potently neutralize SARS-CoV-2

Cows produce antibodies with a disulfide-bonded antigen-binding domain embedded within ultralong heavy chain third complementarity determining regions. This “knob” domain is analogous to natural cysteine-rich peptides such as knottins in that it is small and stable but can accommodate diverse loops and disulfide bonding patterns. We immunized cattle with SARS-CoV-2 spike and found ultralong CDR H3 antibodies that could neutralize several viral variants at picomolar IC 50 potencies in vitro and could protect from disease in vivo. The independent CDR H3 peptide knobs were expressed and maintained the properties of the parent antibodies. The knob interaction with SARS-CoV-2 spike was revealed by electron microscopy, X-ray crystallography, NMR spectroscopy, and mass spectrometry and established ultralong CDR H3-derived knobs as the smallest known recombinant independent antigen-binding fragment. Unlike other vertebrate antibody fragments, these knobs are not reliant on the immunoglobulin domain and have potential as a new class of therapeutics.

60 APPLIED LIFE SCIENCES↗

Proving Correctness for Pointer Programs in a Verifying Compiler

This research describes a component-based approach to proving the correctness of programs involving pointer behavior. The approach supports modular reasoning and is designed to be used within the larger context of a verifying compiler. The approach consists of two parts. When a system component requires the direct manipulation of pointer operations in its implementation, we implement it using a built-in component specifically designed to capture the functional and performance behavior of pointers. When a system component requires pointer behavior via a linked data structure, we ensure that the complexities of the pointer operations are encapsulated within the data structure and are hidden to the client component. In this way, programs that rely on pointers can be verified modularly, without requiring special rules for pointers. The ultimate objective of a verifying compiler is to prove-with as little human intervention as possible-that proposed program code is correct with respect to a full behavioral specification. Full verification for software is especially important for an agency like NASA that is routinely involved in the development of mission critical systems.

Kulczycki, Gregory↗