We present Mapped Separation Logic, an instance of Separation Logic for reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover and it allows reasoning on properties about page tables, direct physical memory access, virtual memory access, and shared memory. Mapped Separation Logic fully supports all rules of abstract Separation Logic, including the frame rule....

The purpose of this paper is to study properties of mapped shuffled Fibonacci languages F(afi) and F^vy Let X — {a?6} be an alphabet and let X* be the free monoid generated by X. Let 1 be the empty word and let X+ — X* \ {1}. The length of a word u is denoted by lg(w). Every subset of X* is called a language. For two words u, v E X + ? we consider the following type of Fibonacci sequence of words:

For the classical family of languages recognized by Place-Transitions Petri Nets (or, equivalently, by Greibach’s quasirealtime partially blind counter machines), we propose a new implementation by means of matching finite-state computations, within the model of consensually regular languages (introduced by the authors). A Petri Net computation is mapped on multiple finite-states computations t...

Starting from a general, microscopic fermion-to-boson mapping that preserves Hermitian conjugation, we discuss truncations of the boson Fock space basis. We give conditions under which the exact boson images of finite fermion operators are also finite (e.g., a 1+2-body fermion Hamiltonian is mapped to a 1+2-body boson Hamiltonian) in the truncated basis. For the most general case, where the ima...

We consider a pushdown automaton as a word-rewriting system with labelled rules applied only in a prefix way. The notion of pushdown transition graph is then extended to the notion of prefix transition graph generated by a word-rewriting system and accessible from a given axiom. Such accessible prefix transition graphs are context-free graphs in the sense of Muller and Schupp (1985), and we sho...

This paper introduces displacement mapped billboard clouds (DMBBC), a new image-based rendering primitive for the fast display of geometrically complex objects at medium to far distances. The representation is based on the well-known billboard cloud (BBC) technique, which represents an object as several textured rectangles in order to dramatically reduce its geometric complexity. Our new method...

A color-mapped image or indexed image manages the color information by maintaining a table with a limited number of colors [1], [2]. The information stored in each pixel is the relative index to a color in that table (Figure 1). Using indexed colors usually greatly reduces size of image files (as each pixel uses only a few bits to refer to a space in the color table, rather than many bits to re...

We present alternative ways of looking at vector elds that complement existing ow visualization methods. These techniques are based on bump mapping and are simple, easy to compute and fast to render. For example, in one of the techniques a surface from the vector eld is extracted and the directions of the vector values on the surface are normalized and used as surface normals. The shading of th...