Search

What provides the highest level of assurance for correctness of execution within a programming language? One answer, and our solution in particular, to this problem is to provide a formalization for, if it exists, the denotational semantics of a programming language. Achieving such a formalization provides a gold standard for ensuring a programming language is correct-by-construction. In our effort on the DARPA V-SPELLS program, we worked to provide a foundation for the denotational semantics of a meta-language using a mathematical object known as an operad. This object has compositional properties which are vital to building languages from smaller pieces. In this paper, we discuss our formalization of an operad in the proof assistant Coq. Moreover, our definition within Coq is capable of providing proofs that objects specified within Coq are operads. This work within Coq provides a formal mathematical basis for our meta-language development within V-SPELLS. Our work also provides, to our knowledge, the first known formalization of operads within a proof assistant that has significant automation, as well as a model that can be replicated without knowledge of Homotopy Type Theory., Comment: Repository for code to follow shortly

We prove Cantor spectrum and almost-sure Anderson localization for quasiperiodic discrete Schr\"odinger operators $H = \varepsilon\Delta + V$ with potential $V$ sampled with Diophantine frequency $\alpha$ from an asymmetric, smooth, cosine-like function $v \in C^2(\mathbb{T},[-1,1])$ for sufficiently small interaction $\varepsilon \leq \varepsilon_0(v,\alpha)$. We prove this result via an inductive analysis on scales, whereby we show that locally the Rellich functions of Dirichlet restrictions of $H$ inherit the cosine-like structure of $v$ and are uniformly well-separated., Comment: 97 pages, 9 figures

We model an isothermal aggregation process of particles/atoms interacting according to the Lennard-Jones pair potential by mapping the energy landscapes of each cluster size $N$ onto stochastic networks, computing transition probabilities {from} the network for an $N$-particle cluster to the one for $N+1$, and connecting these networks into a single joint network. The attachment rate is a control parameter. The resulting network representing the aggregation of up to 14 particles contains {6427} vertices. It is not only time-irreversible but also reducible. To analyze its transient dynamics, we introduce the sequence of the expected initial and pre-attachment distributions and compute them for a wide range of attachment rates and three values of temperature. As a result, we find the {configurations most likely to be observed} in the process of aggregation for each cluster size. We examine the attachment process and conduct a structural analysis of the sets of local energy minima for every cluster size. We show that both processes taking place in the network, attachment and relaxation, lead to the dominance of icosahedral packing in small (up to 14 atom) clusters., Comment: 28 pages, 13 figures, 6 tables

Using the linearized DC power flow model, we study cascading failures and their spatial and temporal properties in the US Western Interconnect (USWI) power grid. We also introduce the preferential Degree And Distance Attachment (DADA) model, with similar degree distributions, resistances, and currents to the USWI. We investigate the behavior of both grids resulting from the failure of a single line. We find that the DADA model and the USWI model react very similarly to that failure, and that their blackout characteristics resemble each other. In many cases, the failure of a single line can cause cascading failures, which impact the entire grid. We characterize the resilience of the grid by three parameters, the most important of which is tolerance ${\alpha}$, which is the ratio of the maximal load a line can carry to its initial load. We characterize a blackout by its yield, which we define as the ratio of the final to the initial consumed currents. We find that if ${\alpha}\leq2$, the probability of a large blackout occurring is very small. By contrast, in a broad range of $1 < {\alpha} < 2$, the initial failure of a single line can result, with a high probability, in cascading failures leading to a massive blackout with final yield less than 80%. The yield has a bimodal distribution typical of a first-order transition, i.e., the failure of a randomly selected line leads either to an insignificant current reduction or to a major blackout. We find that there is a latent period in the development of major blackouts during which few lines are overloaded, and the yield remains high. The duration of this latent period is proportional to the tolerance. The existence of the latent period suggests that intervention during early time steps of a cascade can significantly reduce the risk of a major blackout., Comment: 42 pages, 15 figures