Deciding equivalence of finite tree automata
SIAM Journal on Computing
Operational reasoning for functions with local state
Higher order operational techniques in semantics
On full abstraction for PCF: I, II, and III
Information and Computation
Game Theoretic Analysis of Call-by-Value Computation
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Functions with local state: regularity and undecidability
Theoretical Computer Science
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
State-dependent representation independence
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Homer: A Higher-Order Observational Equivalence Model checkER
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
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
Idealized algol with ground recursion, and DPDA equivalence
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Block structure vs. scope extrusion: between innocence and omniscience
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Algorithmic games for full ground references
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
HECTOR: an equivalence checker for a higher-order fragment of ML
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Algorithmic probabilistic game semantics
Formal Methods in System Design
| Hi-index | 0.00 |
The simply-typed, call-by-value language, RML, may be viewed as a canonical restriction of Standard ML to ground-type references, augmented by a "bad variable" construct in the sense of Reynolds. By a short type, we mean a type of order at most 2 and arity at most 1. We consider the O-strict fragment of (finitary) RML, RMLO-Str, consisting of terms-in-context x1 : θ1, ..., xn : θn ⊢ M : θ such that θ is short, and every argument type of every θi is short. RMLO-Str is surprisingly expressive; it includes several instances of (in)equivalence in the literature that are challenging to prove using methods based on (state-based) logical relations. We show that it is decidable whether a given pair of RMLO-Str terms-in-context is observationally equivalent. Using the fully abstract game semantics of RML, our algorithm reduces the problem to the language equivalence of visibly pushdown automata. When restricted to terms in canonical form, the problem is EXPTIME-complete.