Abstract
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA \(^*_{3}\)). They are approached via a combination of game semantics and language theory. It is shown that for each (IA \(^{*}_{3}\))-term one can construct a pushdown automaton recognizing a representation of the strategy induced by the term. The automata have some additional properties ensuring that the associated equivalence and inclusion problems are solvable in Ptime. This gives an Exptime decision procedure for contextual equivalence and approximation for β-normal terms. Exptime-hardness is also shown in this case, even in the absence of iteration.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Reynolds, J.C.: The essence of Algol. In: Algorithmic Languages, pp. 345–372. North-Holland, Amsterdam (1981)
Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.-H.L.: Applying game semantics to compositional software modelling and verification. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 421–435. Springer, Heidelberg (2004)
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of STOC, pp. 202–211 (2004)
Ghica, D.R., McCusker, G.: Reasoning about Idealized Algol using regular expressions. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 103–115. Springer, Heidelberg (2000)
Ong, C.-H.L.: Observational equivalence of 3rd-order Idealized Algol is decidable. In: Proc. of LICS, pp. 245–256 (2002)
Murawski, A.S.: On program equivalence in languages with ground-type references. In: Proc. of LICS, pp. 108–117 (2003)
Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: Algol-like languages, pp. 297–329. Birkhaüser, Basel (1997)
Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF. Information and Computation 163(2), 285–408 (2000)
Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput. 19(3), 424–437 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murawski, A.S., Walukiewicz, I. (2005). Third-Order Idealized Algol with Iteration Is Decidable. In: Sassone, V. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2005. Lecture Notes in Computer Science, vol 3441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31982-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-31982-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25388-4
Online ISBN: 978-3-540-31982-5
eBook Packages: Computer ScienceComputer Science (R0)