Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...
The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...
Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...
Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...
We model, via classical molecular dynamics simulations, the plastic phase of ice VII across a wide range of the phase diagram of interest for planetary investigations. Although structural and dynamical properties of plastic ice VII are mostly independent o ...
A Finite Element Model is developed to represent the mechanical behavior of WC-10 wt.% Co in compression tests. In this research, realistic three-dimensional model is obtained by slicing a sample by Focused Ion Beam and reconstituting it, resulting in two ...
Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...
This thesis is motivated by recent experiments on systems described by extensions of the one-dimensional transverse-field Ising (TFI) model where (1) finite-size properties of Ising-ordered phases -- specifically, ground state level crossings -- were obser ...
Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...
A system for measuring synchrony between two or more regions, or within a single region, of a subject's brain. The system can include a signal conditioning module in communication with a phase extraction module. The signal conditioning module can receive a ...
