论文信息 - Memory Handling for SCM FSA 1

Memory Handling for SCM FSA 1

Summary. We introduce some terminology for reasoning about memory used in programs in general and in macro instructions (introduced in [26]) in particular. The usage of integer locations and of finite sequence locations by a program is treated separately. We define some functors for selecting memory locations needed for local (temporary) variables in macro instructions. Some semantic properties of the introduced notions are given in terms of executions of macro instructions.

Piotr Rudnicki | Andrzej Trybulec | P. Rudnicki | A. Trybulec

[1] G. Bancerek. The Fundamental Properties of Natural Numbers , 1990 .

[2] A. Trybulec. Tarski Grothendieck Set Theory , 1990 .

[3] Czesław Bylí. Products and Coproducts in Categories , 1992 .

[4] Grzegorz Zwara,et al. The Divisibility of Integers and Integer Relatively Primes 1 , 1990 .

[5] Yatsuka Nakamura,et al. On the Compositions of Macro Instructions. Part I , 1997 .

[6] Zinaida Trybulec,et al. Boolean Properties of Sets , 1990 .

[7] Czesław Bylí,et al. A Classical First Order Language , 1990 .

[8] Grzegorz Bancerek,et al. Segments of Natural Numbers and Finite Sequences , 1990 .

[9] G. Bancerek. Konig's Theorem , 1990 .

[10] Czesław Bylí. Finite Sequences and Tuples of Elements of a Non-empty Sets , 1990 .

[11] Yasushi Tanaka,et al. On the Decomposition of the States of SCM , 1996 .

[12] Yatsuka Nakamura,et al. A Mathematical Model of CPU , 1992 .

[13] Andrzej Trybulec,et al. Miscellaneous Facts about Functions , 1996 .

[14] Andrzej Trybulec,et al. Semilattice Operations on Finite Subsets , 1990 .

[15] Wojciech A. Trybulec. Pigeon Hole Principle , 1990 .

[16] Kenneth Halpern August. The Cardinal Numbers , 1888, Nature.

[17] Andrzej Ne ' dzusiak. Fields and Probability , 1990 .