SearcharxivSearch

arXiv subjects

Minh Ngo

Publications and source records attributed to Minh Ngo.

5 recordsLinked to original sources

Highly Tunable Phonon Polaritons via Metal Intercalation

Phonon polaritons in van der Waals crystals offer mid-infrared light confinement deep below the diffraction limit, making them promising for nanophotonics applications. However, the practical use of phonon polaritons remains limited, in part due to the lack of precise control over the phonon polariton dispersion, as crystal lattice vibrations are often inert to external stimuli. Here, we address this challenge by zerovalent metal intercalation of $\alpha$-MoO$_3$. Photo-induced force microscopy shows that introducing tin into the van der Waals gap modulates the phonon polariton dispersion by up to $38.5\pm0.5\%$, which is the highest amount of tunability among non-mechanical modulation approaches, to the best of our knowledge. Intercalation with various metal species preserves the phonon polariton lifetimes, while modulating the dielectric permittivity in agreement with the density functional theory and analytical calculations. Our results establish metal intercalation as a practical route to reconfigurable mid-infrared nanophotonics.

cond-mat.mtrl-sci

An algebra of alignment for relational verification

Relational verification encompasses information flow security, regression verification, translation validation for compilers, and more. Effective alignment of the programs and computations to be related facilitates use of simpler relational invariants and relational procedure specs, which in turn enables automation and modular reasoning. Alignment has been explored in terms of trace pairs, deductive rules of relational Hoare logics (RHL), and several forms of product automata. This article shows how a simple extension of Kleene Algebra with Tests (KAT), called BiKAT, subsumes prior formulations, including alignment witnesses for forall-exists properties, which brings to light new RHL-style rules for such properties. Alignments can be discovered algorithmically or devised manually but, in either case, their adequacy with respect to the original programs must be proved; an explicit algebra enables constructive proof by equational reasoning. Furthermore our approach inherits algorithmic benefits from existing KAT-based techniques and tools, which are applicable to a range of semantic models.

cs.LO

Type-based Declassification for Free

This work provides a study to demonstrate the potential of using off-the-shelf programming languages and their theories to build sound language-based-security tools. Our study focuses on information flow security encompassing declassification policies that allow us to express flexible security policies needed for practical requirements. We translate security policies, with declassification, into an interface for which an unmodified standard typechecker can be applied to a source program---if the program typechecks, it provably satisfies the policy. Our proof reduces security soundness---with declassification---to the mathematical foundation of data abstraction, Reynolds' abstraction theorem.

cs.CR

Whither Programs as Specifications

Unifying theories distil common features of programming languages and design methods by means of algebraic operators and their laws. Several practical concerns --- e.g., improvement of a program, conformance of code with design, correctness with respect to specified requirements --- are subsumed by the beautiful notion that programs and designs are special forms of specification and their relationships are instances of logical implication between specifications. Mathematical development of this idea has been fruitful but limited to an impoverished notion of specification: trace properties. Some mathematically precise properties of programs, dubbed hyperproperties, refer to traces collectively. For example, confidentiality involves knowledge of possible traces. This article reports on both obvious and surprising results about lifting algebras of programming to hyperproperties, especially in connection with loops, and suggests directions for further research. The technical results are: a compositional semantics, at the hyper level, of imperative programs with loops, and proof that this semantics coincides with the direct image of a standard semantics, for subset closed hyperproperties.

cs.LO

MAP-REDUCE Runtime Enforcement of Information Flow Policies

We propose a flexible framework that can be easily customized to enforce a large variety of information flow properties. Our framework combines the ideas of secure multi-execution and map-reduce computations. The information flow property of choice can be obtained by simply changes to a map (or reduce) program that control parallel executions. We present the architecture of the enforcement mechanism and its customizations for non-interference (NI) (from Devriese and Piessens) and some properties proposed by Mantel, such as removal of inputs (RI) and deletion of inputs (DI), and demonstrate formally soundness and precision of enforcement for these properties.

cs.CR