On the equivalence and transformation of program schemes
Communications of the ACM
Communications of the ACM
Retrospective: a preliminary architecture for a basic data flow processor
25 years of the international symposia on Computer architecture (selected papers)
Properties of Programs and the First-Order Predicate Calculus
Journal of the ACM (JACM)
Decidable Properties of Monadic Functional Schemas
Journal of the ACM (JACM)
An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
On the automatic simplification of computer programs
Communications of the ACM
Synchronous schemes and their decision problems
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Transformations on straight line programs - (Preliminary Version)
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Programming with(out) the GOTO
ACM '72 Proceedings of the ACM annual conference - Volume 2
Decision problems in computational models
Proceedings of ACM conference on Proving assertions about programs
A boundary between decidability and undecidability for parallel program schemata (Extended Abstract)
Proceedings of ACM conference on Proving assertions about programs
A formal approach to code optimization
Proceedings of a symposium on Compiler optimization
Some thoughts on graduate education in computer science
ACM SIGCSE Bulletin
Programming with(out) the GOTO
ACM SIGPLAN Notices - Special issue on control structures in programming languages
Record of the Project MAC conference on concurrent systems and parallel computation
A Comparison of Some Theoretical Models of Parallel Computation
IEEE Transactions on Computers
Program schemata as automata. I
Journal of Computer and System Sciences
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On formalised computer programs
Journal of Computer and System Sciences
On program schemata equivalence
Journal of Computer and System Sciences
On the computational complexity of dynamic slicing problems for program schemas
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Survey: A survey of state vectors
Computer Science Review
Hi-index | 0.02 |
Ianov has defined a formal abstraction of the notion of program which represents the sequential and control properties of a program but suppresses the details of the operations. For these schemata he defines a notion corresponding to computation and defines equivalence of schemata in terms of it. He then gives a decision procedure for equivalence of schemata, and a deductive formalism for generating schemata equivalent to a given one. The present paper is intended, first as an exposition of Ianov's results and simplification of his method, and second to point out certain generalizations and extensions of it. We define a somewhat generalized version of the notion of schema, in a language similar to that used in finite automata theory, and present a simple algorithm for the equivalence problem solved by Ianov. We also point out that the same problem for an extended notion of schema, considered rather briefly by Ianov, is just the equivalence problem for finite automata, which has been solved, although the decision procedure is rather long for practical use. A simple procedure for generating all schemata equivalent to a given schema is also indicated.