A Tree of Execution of a Macroinstruction

Journal of Formalized Mathematics
Volume 15, 2003
University of Bialystok
Copyright (c) 2003 Association of Mizar Users

A Tree of Execution of a Macroinstruction

Artur Kornilowicz: University of Bialystok, Poland

Summary.

A tree of execution of a macroinstruction has been defined. It is a tree decorated by the instruction locations of a computer. Successors of each vertex are determined by the set of all possible values of the instruction counter after execution of the instruction placed in the location indicated by given vertex.

The paper was written during author's post-doctoral fellowship granted by Shinshu University, Japan.

MML Identifier: AMISTD_3

The terminology and notation used in this paper have been introduced in the following articles [21] [12] [25] [15] [1] [22] [3] [4] [16] [26] [9] [11] [10] [5] [6] [20] [13] [8] [14] [2] [7] [18] [23] [19] [24] [17]

Contents (PDF format)

Acknowledgments

The author wishes to thank Andrzej Trybulec and Grzegorz Bancerek for their very useful comments during writing this article.

Bibliography

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

[2] Grzegorz Bancerek. Introduction to trees. Journal of Formalized Mathematics, 1, 1989.

[3] Grzegorz Bancerek. The ordinal numbers. Journal of Formalized Mathematics, 1, 1989.

[4] Grzegorz Bancerek. Sequences of ordinal numbers. Journal of Formalized Mathematics, 1, 1989.

[5] Grzegorz Bancerek. The well ordering relations. Journal of Formalized Mathematics, 1, 1989.

[6] Grzegorz Bancerek. Zermelo theorem and axiom of choice. Journal of Formalized Mathematics, 1, 1989.

[7] Grzegorz Bancerek. K\"onig's Lemma. Journal of Formalized Mathematics, 3, 1991.

[8] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Journal of Formalized Mathematics, 1, 1989.

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

[10] Czeslaw Bylinski. Functions from a set to a set. Journal of Formalized Mathematics, 1, 1989.

[11] Czeslaw Bylinski. Partial functions. Journal of Formalized Mathematics, 1, 1989.

[12] Czeslaw Bylinski. Some basic properties of sets. Journal of Formalized Mathematics, 1, 1989.

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

[14] Czeslaw Bylinski. Finite sequences and tuples of elements of a non-empty sets. Journal of Formalized Mathematics, 2, 1990.

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

[16] Agata Darmochwal and Andrzej Trybulec. Similarity of formulae. Journal of Formalized Mathematics, 3, 1991.

[17] Artur Kornilowicz. On the composition of macro instructions of standard computers. Journal of Formalized Mathematics, 12, 2000.

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

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

[20] Andrzej Trybulec. Binary operations applied to functions. Journal of Formalized Mathematics, 1, 1989.

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

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

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

[24] Andrzej Trybulec, Piotr Rudnicki, and Artur Kornilowicz. Standard ordering of instruction locations. Journal of Formalized Mathematics, 12, 2000.

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

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

Received December 10, 2003

[ Download a postscript version, MML identifier index, Mizar home page]