Third-order Idealized Algol with iteration is decidable

Theoretical Computer Science

Volumn 390, Issue 2-3, 2008, Pages 214-229

  Murawski, Andrzej S ^a   Walukiewicz, Igor ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Computational complexity; Game semantics; Program analysis

Indexed keywords

ALGOL (PROGRAMMING LANGUAGE); APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; PROBLEM SOLVING; SEMANTICS;

GAME SEMANTICS; LANGUAGE THEORY; PROGRAM ANALYSIS; THIRD ORDER IDEALIZED ALGOL (PROGRAMMING LANGUAGE);

GAME THEORY;

EID: 37749005820     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.09.022     Document Type: Article

References (12)

1. Reynolds J.C. The essence of Algol. In: de Bakker J.W., and van Vliet J. (Eds). Algorithmic Languages (1978), North Holland 345-372
2. Abramsky S., Ghica D.R., Murawski A.S., and Ong C.-H.L. Applying game semantics to compositional software modelling and verification. Proceedings of TACAS. Lecture Notes in Computer Science vol. 2988 (2004), Springer-Verlag 421-435
3. R. Alur, P. Madhusudan, Visibly pushdown languages, in: Proceedings of STOC'04, 2004, pp. 202-211
4. Ghica D.R., and McCusker G. Reasoning about Idealized Algol using regular expressions. Proceedings of ICALP. Lecture Notes in Computer Science vol. 1853 (2000), Springer-Verlag 103-115
5. Ong C.-H.L. Observational equivalence of 3rd-order Idealized Algol is decidable. Proceedings of IEEE Symposium on Logic in Computer Science (2002), Computer Society Press 245-256
6. Murawski A.S. Games for complexity of second-order call-by-name programs. Theoretical Computer Science 343 1/2 (2005) 207-236
7. Murawski A.S. On program equivalence in languages with ground-type references. Proceedings of IEEE Symposium on Logic in Computer Science (2003), Computer Society Press 108-117
8. Murawski A.S., Ong C.-H.L., and Walukiewicz I. Idealized Algol with ground recursion and DPDA equivalence. Proceedings of ICALP. Lecture Notes in Computer Science vol. 3580 (2005), Springer 917-929
9. Abramsky S., and McCusker G. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: O'Hearn P.W., and Tennent R.D. (Eds). Algol-like languages (1997), Birkhaüser 297-329
10. Hyland J.M.E., and Ong C.-H.L. On Full Abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Information and Computation 163 2 (2000) 285-408
11. Seidl H. Deciding equivalence of finite tree automata. SIAM Journal of Computation 19 3 (1990) 424-437
12. Fortune S., Leivant D., and O'Donnell M. The expressiveness of simple and second-order type structures. Journal of the ACM 30 1 (1983) 151-185