A program ow analysis framework is proposed for parallelizing compilers. Within this framework, symbolic analysis is used as an abstract interpretation technique to solve many of the ow analysis problems in a uniied way. Some of these problems are constant propagation , global forward substitution, detection of loop invariant computations, and induction variable substitution. The solution space...

It is shown that by taking advantage of the superposition property of optical signals, one can further improve the performance of optical symbolic substitution processors.

Two types of symbolic summation formulas are reformulated using an extension of Mullin-Rota’s substitution rule in [1], and several applications involving various special formulas and identities are presented as illustrative examples.

We prove an extension of the well-known Pisot substitution conjecture to the S-adic symbolic setting on two letters. The proof relies on the use of Rauzy fractals and on the fact that strong coincidences hold in this framework.

We consider a substitutive version of the Arnoux-Yoccoz Interval Exchange Transformation (IET) related to the Tribonacci substitution. We construct the so-called stepped lines associated to the fixed points of the substitution in the Abelianisation (symbolic) space. We analyse various projections of the stepped line recovering the Rauzy Fractal, a Peano Curve related to the work of Arnoux [1], ...

The theory of substitution sequences and their higher-dimensional analogues is intimately connected with symbolic dynamics. By systematically studying the factors (in the sense of dynamical systems theory) of a substitution dynamical system, one can reach a better understanding of spectral and topological properties. We illustrate this point of view by means of some characteristic examples, inc...

1 Introduction We have designed a new method for performing partial evaluation. This method divides specialization into two phases: a polyvariant analysis phase and a code generation phase. The analysis phase does not diierentiate between unfolding and specializing. Symbolic execution is the sole operation performed during the analysis phase. Symbolic execution of an expression yields a charact...

Key substitution vulnerable signature schemes are signature schemes that permit an intruder, given a public verification key and a signed message, to compute a pair of signature and verification keys such that the message appears to be signed with the new signature key. Schemes vulnerable to this attack thus permit an active intruder to claim to be the issuer of a signed message. A digital sign...