✦ LIBER ✦

On program schemata equivalence

✍ Scribed by V.E. Itkin; V.E. Itkin; Z. Zwinogrodzki

Book ID: 104148091
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 584 KB
Volume: 6
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(72)80041-2

No coin nor oath required. For personal study only.

✦ Synopsis

Some problems related to the class of program schemata introduced by R. M. Karp and R. M. Miller in paper [1] are solved in this paper.

The method of the proof implemented in the paper allows us to obtain a negative solution of the existence problem of an algorithm for equivalence recognition for a wide class of program schemata which can be reduced to the above class, and for a wide class of equivalence definitions.

📜 SIMILAR VOLUMES

Equivalence of free program schemata

✍ V. É. Itkin 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 1009 KB

Problems of inclusion and equivalence fo

Problems of inclusion and equivalence for program schemata and formal languages

✍ L. P. Lisovik 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 750 KB

Program Development Schemata as Derived

Program Development Schemata as Derived Rules

✍ Penny Anderson; David Basin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 431 KB

We show how the formalization and application of schemata for program development can be reduced to the formalization and application of derived rules of inference. We formalize and derive schemata as rules in theories that axiomatize program data and programs themselves. We reduce schema-based prog

Equivalences on program schemes

✍ R. Milner 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 654 KB

A program scheme may be informally described as a program with the interpretation (i.e., the meaning of the basic instructions or standard functions) left unspecified. This paper studies the equivalence of program schemes under different classes of interpretations, with emphasis on those in which th

Yanov operator schemata with a finite eq

Yanov operator schemata with a finite equivalence relation

✍ É. L. Gorel' 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 128 KB

Program schemata vs. automata for decida

Program schemata vs. automata for decidability of program logics

✍ N.V. Shilov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 922 KB

A new technique for decidability of program logics is introduced. This technique is applied to the most expressive propositional program logic -mu-calculus. 0. Introduction We would like to present program scheme technique (PST) for decidability of program and polymodal propositional logics. This te