Idealized algol with ground recursion, and DPDA equivalence

Authors:
A. S. Murawski;C. -H. L. Ong;I. Walukiewicz
Affiliations:
Computing Laboratory, Oxford University, Oxford, UK;Computing Laboratory, Oxford University, Oxford, UK;CNRS, Université Bordeaux-1, Talence, France
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 7
Cited 7

L(A) = L(B)? decidability results from complete formal systems

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Deciding DPDA Equivalence Is Primitive Recursive

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Observational Equivalence of 3rd-Order Idealized Algol is Decidable

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On Program Equivalence in Languages with Ground-Type References

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Games for complexity of second-order call-by-name programs

Theoretical Computer Science - Game theory meets theoretical computer science
Third-order idealized algol with iteration is decidable

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Third-order Idealized Algol with iteration is decidable

Theoretical Computer Science
Game Semantics for Access Control

Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of higher-order computation: a game-semantic approach

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Algorithmic nominal game semantics

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
A fragment of ML decidable by visibly pushdown automata

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Hierarchies of infinite structures generated by pushdown automata and recursion schemes

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
LALBLC a program testing the equivalence of dpda's

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that observational equivalence of IA3+Y0 (3rd-order Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable. This completes the classification of decidable fragments of Idealized Algol. We also prove that observational approximation of IA1+Y0 is undecidable by reducing the DPDA Containment Problem to it.