On the equivalence problem for programs with mode switching

Authors:
Rimma I. Podlovchenko;Dmitry M. Rusakov;Vladimir A. Zakharov
Affiliations:
Lomonosov Moscow State University, Moscow State University, Moscow, Russia;Lomonosov Moscow State University, Moscow State University, Moscow, Russia;Lomonosov Moscow State University, Moscow State University, Moscow, Russia
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 3
Cited 2

Hard Sets Method and Semilinear Reservoir Method with Applications

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Lower bounds for natural proof systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Inclusion problem in algebraic models of programs with constants

Programming and Computing Software
Program equivalence checking by two-tape automata

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a formal model of imperative sequential programs and focus on the equivalence problem for some class of programs with mode switching whose runs can be divided into two stages. In the first stage a program selects an appropriate mode of computation. Several modes may be tried (switched) in turn before making the ultimate choice. Every time when the next mode is put to a test, the program brings data to some predefined state. In the second stage of the run, once a definite mode is fixed, the final result of computation is produced. We develop a new technique for simulating the behavior of such programs by means of finite automata and demonstrate that the equivalence problem for programs with mode switching is decidable within a polynomial space. By revealing a close relationships between the equivalence problem for this class of programs and the intersection emptiness problem for deterministic finite automata we show that the the former is PSPACE-complete.