Stack-based languages (e.g. Forth (Moore 1974), Postscript (Inc. 1999)) have been around for nearly four decades. They are particularly popular today for use as intermediate languages (e.g. CIL (ECMA 2002), JVML (Lindholm and Yellin 1999), (Morrisett et al. 1998)). This is for several reasons: they have good run-time performance characteristics, they resemble the machine level instructions on m...

Typed intermediate languages and typed assembly languages for optimizing compilers require types to describe stack-allocated data. Previous type systems for stack data were either undecidable or did not treat arguments passed by reference. This paper presents a simple, sound, decidable type system expressive enough to support the Micro-CLI source language, including by-reference arguments. This...

K-extended basic macro grammars are introduced, where K is any class of languages. The class B(K) of languages generated by such grammars is investigated, together with the class LB(K) of languages generated by the corresponding linear basic grammars. For any full semiAFL K, B(K) is a full AFL closed under iterated LB(K)-substitution, but not necessarily under substitution. For any machine type...

The notion of the homotopy type of a topological stack has been around in the literature for some time. The basic idea is that an atlas X → X of a stack determines a topological groupoid X with object space X. The homotopy type of X should be the classifying space BX. The choice of an atlas is not part of the data of a stack and hence it is not immediately clear why this construction of a homot...

We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness proofs and strongest analysis (principal type inference) algorithms. Specifically, we treat dead store instructions, load-pop pairs, duplicating load instructions, store-load pairs. The load-pop pairs and store-load p...

a typical iranians carbonate matrix block surrounded by an open fracture was modelled in order to understand the fracture-matrix interaction and how to model the interaction best. this was modelled by using a fine-scaled eclipse model in the single porosity mode . the model was extended to a stack of 6 matrix blocks to understand block-to-block interaction under gas injection scenarios. results...

Controlling resource usage is important for the reliability, efficiency and security of software systems. Automated analyses for bounding resource usage can be invaluable tools for ensuring these properties. Hofmann and Jost have developed an automated static analysis for finding linear heap space bounds in terms of the input size for programs in a simple functional programming language. Memory...

data types [LZ74, LSAS77, LAB+81, LG86] provide a more expressive mechanism for describing and manipulating data structures. An abstract data type abstracts away from a concrete data type by providing a set of operations (the interface) through which clients are to manipulate objects of the type. The abstract data type is implemented in terms of some lower-level data type (the representation), ...

We present a novel "linear combination of atomic orbitals"-type approximation, enabling accurate electronic structure calculations for systems up to 20 or more electronically coupled quantum dots. Using realistic single dot wavefunctions as basis expand the eigenstates heterostructure, our method shows excellent agreement with full 8-band $\boldsymbol{k}\cdot\boldsymbol{p}$ calculations, exempl...

We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA, OVPA and MPDA, which have all been defined and studied in the past. Multi-stack pushdown automata, MPDA, have ordered stacks with pop access restricted to the stack-top of the first non-empty stack. The membership fo...