The Equivalence Problem for Computational Models: Decidable and Undecidable Cases

Authors:
Vladimir A. Zakharov
Affiliations:
-
Venue:
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Year:
2001

Citing 26
Cited 4

Trace theory

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
HDTOL matching of computations of multitape automata

Acta Informatica
New techniques for proving the decidability of equivalence problems

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
An algorithm deciding functional equivalence in a new class of program schemes

Theoretical Computer Science - Special issue on the Second French-Soviet Workshop on Methods of Compilation and Program Construction, Nice, France, Feb. 1988
The equivalence problem of multitape finite automata

Theoretical Computer Science
The extended equivalence problem for a class of non-real-time deterministic pushdown automata

Acta Informatica
Decidability results in automata and process theory

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
From logic programming to Prolog

From logic programming to Prolog
On Ianov's Program Schemata

Journal of the ACM (JACM)
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
Decidable Properties of Monadic Functional Schemas

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata and Computability

Automata and Computability
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics

Proceedings on Algorithms in Modern Mathematics and Computer Science
Decision problems in computational models

Proceedings of ACM conference on Proving assertions about programs
Semantical consideration on floyo-hoare logic

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
A new decidable problem, with applications

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Finite automata and their decision problems

IBM Journal of Research and Development
Deterministic one-counter automata

Journal of Computer and System Sciences
On formalised computer programs

Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages

Journal of Computer and System Sciences
The equivalence problem for deterministic two-tape automata

Journal of Computer and System Sciences
On program schemata equivalence

Journal of Computer and System Sciences

A.A. Lyapunov and A.P. Ershov in the Theory of Program Schemes and the Development of Its Logic Concepts

PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs

ISC '01 Proceedings of the 4th International Conference on Information Security
On the equivalence-checking problem for a model of programs related with multi-tape automata

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On the equivalence problem for programs with mode switching

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a survey of fundamental concepts and main results in studying the equivalence problem for computer programs. We introduce some of the most-used models of computer programs, give a brief overview of the attempts to refine the boarder between decidable and undecidable cases of the equivalence problem for these models, and discuss the techniques for proving the decidability of the equivalence problem.