An algorithm deciding functional equivalence in a new class of program schemes

Authors:
Victor K. Sabelfeld
Affiliations:
USSR Academy of Sciences, Novosibirsk, Russia
Venue:
Theoretical Computer Science - Special issue on the Second French-Soviet Workshop on Methods of Compilation and Program Construction, Nice, France, Feb. 1988
Year:
1990

Citing 0
Cited 6

Equivalence of conservative, free, linear program schemas is decidable

Theoretical Computer Science
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
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

Theoretical Computer Science
On the computational complexity of dynamic slicing problems for program schemas

Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Complexity of Data Dependence Problems for Program Schemas with Concurrency

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract