Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems – a tree rewrite system where each node is labelled by the configuration of an annotated pushdown automaton. This allows the modelling of fork and join constructs ...

This memo is a digest of the user network interface specification of NTT Communications’ dual stack ADSL access service, which provide a IPv6/IPv4 dual stack services to home users. In order to simplify user setup, these services have a mechanism to configure IPv6 specific parameters automatically. The memo focuses on two basic parameters: the prefix assigned to the user and the addresses of IP...

Assignment stack shrinking is a technique that is intended to speed up the performance of modern complete SAT solvers. Shrinking was shown to be efficient in SAT’04 competition winners Jerusat and Chaff. However, existing studies lack the details of the shrinking algorithm. In addition, shrinking’s performance was not tested in conjunction with the most modern techniques. This paper provides a ...

We prove Artin’s axioms for algebraicity of a stack are compatible with composition of 1-morphisms. Consequently, some natural stacks are algebraic. One of these is a common generalization of Vistoli’s Hilbert stack and the stack of branchvarieties defined by Alexeev and Knutson.

Analytical electron microscopy techniques are used to investigate elemental distributions across a high-k dielectric stack with a metal gate. Electron energy-loss spectroscopy results from a Si(100)/SiO2/HfO2/TiN/a-Si gate stack confirm the presence of an oxide interfacial phase at the TiN/a-Si interface prior to activation of the stack.

The common storage stack as found in most operating systems has remained unchanged for several decades. In this stack, the RAID layer operates under the file system layer, at the block abstraction level. We argue that this arrangement of layers has fatal flaws. In this paper, we highlight its main problems, and present a new storage stack arrangement that solves these problems.

Allocating objects on the stack rather than the heap reduces the overhead of garbage collection and permits further optimizations. This paper presents a simple and fast algorithm for stack allocating a significant fraction of objects for Java programs. Our implementation in an optimizing batch Java compiler demonstrates the benefit of stack allocation by achieving speed improvements of up to 11...

The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's λ µ, does not admit the Böhm Theorem, typical of the λ-calculus. We present a simple extension of stack calculus which is for the stack calculus what Saurin's Λµ is for λ µ.

For a smooth Deligne-Mumford stack over C, we define its associated Kodaira-Spencer differential graded Lie algebra and show that the deformation functor of the stack is isomorphic to the deformation functor of the Kodaira-Spencer algebra if the stack is proper over C.