The Construction and Shiftability of Program Blocks for SCMPDS

Jing-Chao Chen

Shanghai Jiaotong University

Summary.

In this article, a program block is defined as a finite sequence of instructions stored consecutively on initial positions. Based on this definition,any program block with more than two instructions can be viewed as the combination of two smaller program blocks. To describe the computation of a program block by the result of its two sub-blocks, we introduce the notions of paraclosed, parahalting, valid, and shiftable, the meaning of which may be stated as follows: \begin{itemize} \item[-] a program is paraclosed if and only if any state containing it is closed, \item[-] a program is parahalting if and only if any state containing it is halting, \item[-] in a program block, a jumping instruction is valid if its jumping offset is valid, \item[-] a program block is shiftable if it does not contain any return and saveIC instructions, and each instruction in it is valid. \end{itemize} When a program block is shiftable, its computing result does not depend on its storage position.

This research is partially supported by the National Natural Science Foundation of China Grant No. 69873033.

MML Identifier: SCMPDS_4

Contents (PDF format)

1. Definition of a Program Block and its Basic Properties
2. Combining two Consecutive Blocks into One Program Block
3. Combining a Block and a Instruction into One Program Block
4. The Notions of Paraclosed, Parahalting and their Basic Properties
5. Shiftability of Program Blocks and Instructions

Bibliography

[1] Grzegorz Bancerek. Cardinal numbers. Journal of Formalized Mathematics, 1, 1989.

[2] Grzegorz Bancerek. The fundamental properties of natural numbers. Journal of Formalized Mathematics, 1, 1989.

[3] Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Journal of Formalized Mathematics, 8, 1996.

[4] Czeslaw Bylinski. Functions and their basic properties. Journal of Formalized Mathematics, 1, 1989.

[5] Czeslaw Bylinski. A classical first order language. Journal of Formalized Mathematics, 2, 1990.

[6] Czeslaw Bylinski. The modification of a function by a function and the iteration of the composition of a function. Journal of Formalized Mathematics, 2, 1990.

[7] Jing-Chao Chen. Computation and program shift in the SCMPDS computer. Journal of Formalized Mathematics, 11, 1999.

[8] Jing-Chao Chen. The SCMPDS computer and the basic semantics of its instructions. Journal of Formalized Mathematics, 11, 1999.

[9] Agata Darmochwal. Finite sets. Journal of Formalized Mathematics, 1, 1989.

[10] Yatsuka Nakamura and Andrzej Trybulec. A mathematical model of CPU. Journal of Formalized Mathematics, 4, 1992.

[11] Yatsuka Nakamura and Andrzej Trybulec. On a mathematical model of programs. Journal of Formalized Mathematics, 4, 1992.

[12] Yasushi Tanaka. On the decomposition of the states of SCM. Journal of Formalized Mathematics, 5, 1993.

[13] Andrzej Trybulec. Enumerated sets. Journal of Formalized Mathematics, 1, 1989.

[14] Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.

[15] Andrzej Trybulec. Subsets of real numbers. Journal of Formalized Mathematics, Addenda, 2003.

[16] Andrzej Trybulec and Yatsuka Nakamura. Some remarks on the simple concrete model of computer. Journal of Formalized Mathematics, 5, 1993.

[17] Andrzej Trybulec and Yatsuka Nakamura. Modifying addresses of instructions of \SCMFSA. Journal of Formalized Mathematics, 8, 1996.

[18] Michal J. Trybulec. Integers. Journal of Formalized Mathematics, 2, 1990.

[19] Wojciech A. Trybulec. Groups. Journal of Formalized Mathematics, 2, 1990.

[20] Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, 1, 1989.

[21] Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, 1, 1989.