Advertisement

ML and Extended Branching VASS

  • Conrad Cotton-BarrattEmail author
  • Andrzej S. Murawski
  • C. -H. Luke Ong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10201)

Abstract

We prove that the observational equivalence problem for a finitary fragment of ML is recursively equivalent to the reachability problem for extended branching vector addition systems with states (EBVASS). Our proof uses the fully abstract game semantics of the language. We introduce a new class of automata, VPCMA, as a representation of the game semantics. VPCMA are a version of class memory automata equipped with a visibly pushdown stack; they serve as a bridge enabling interreducibility of decision problems between the game semantics and EBVASS. The results of this paper complete our programme to give an automata classification of the ML types with respect to the observational equivalence problem for closed terms.

Keywords

Visibility Condition Closure Property Initial Move Reachability Problem Closed Term 
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.

Notes

Acknowledgments

We are grateful to the anonymous reviewers for numerous constructive suggestions and to Ranko Lazić for discussions on VASS.

References

  1. 1.
    Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163(2), 409–470 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for idealized Algol with active expressions. Electr. Notes Theor. Comput. Sci. 3, 2–14 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol. 1414, pp. 1–17. Springer, Heidelberg (1998). doi: 10.1007/BFb0028004 CrossRefGoogle Scholar
  4. 4.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211. ACM (2004)Google Scholar
  5. 5.
    Araki, T., Kasami, T.: Some decision problems related to the reachability problem for petri nets. Theor. Comput. Sci. 3(1), 85–104 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Björklund, H., Schwentick, T.: On notions of regularity for data languages. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 88–99. Springer, Heidelberg (2007). doi: 10.1007/978-3-540-74240-1_9 CrossRefGoogle Scholar
  7. 7.
    Björklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci. 411(4–5), 702–715 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Cotton-Barratt, C.: Using class memory automata in algorithmic game semantics. Ph.D. thesis, University of Oxford (submitted, 2016)Google Scholar
  9. 9.
    Cotton-Barratt, C., Hopkins, D., Murawski, A.S., Ong, C.-H.L.: Fragments of ML decidable by nested data class memory automata. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 249–263. Springer, Heidelberg (2015). doi: 10.1007/978-3-662-46678-0_16 CrossRefGoogle Scholar
  10. 10.
    Cotton-Barratt, C., Murawski, A.S., Ong, C.-H.L.: Weak and nested class memory automata. In: Dediu, A.-H., Formenti, E., Martín-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 188–199. Springer, Cham (2015). doi: 10.1007/978-3-319-15579-1_14 Google Scholar
  11. 11.
    de Groote, P., Guillaume, B., Salvati, S.: Vector addition tree automata. In: LICS, pp. 64–73. IEEE Computer Society (2004)Google Scholar
  12. 12.
    Godlin, B., Strichman, O.: Regression verification. In: DAC, pp. 466–471. ACM (2009)Google Scholar
  13. 13.
    Honda, K., Yoshida, N.: Game-theoretic analysis of call-by-value computation. Theor. Comput. Sci. 221(1–2), 393–456 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Hopkins, D.: Game semantics based equivalence checking of higher-order programs. Ph.D. thesis, Department of Computer Science, University of Oxford (2012)Google Scholar
  15. 15.
    Hopkins, D., Murawski, A.S., Ong, C.-H.L.: A fragment of ML decidable by visibly pushdown automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 149–161. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-22012-8_11 CrossRefGoogle Scholar
  16. 16.
    Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285–408 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Jacquemard, F., Segoufin, L., Dimino, J.: FO2(\(< +1, \sim \)) on data trees, data tree automata and branching vector addition systems. Logical Methods Comput. Sci. 12(2), 1–28 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Lazić, R., Murawski, A.S.: Contextual approximation and higher-order procedures. In: Jacobs, B., Löding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 162–179. Springer, Heidelberg (2016). doi: 10.1007/978-3-662-49630-5_10 CrossRefGoogle Scholar
  19. 19.
    Lazic, R., Schmitz, S.: Nonelementary complexities for branching VASS, MELL, and extensions. ACM Trans. Comput. Log. 16(3), 20:1–20:30 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Murawski, A.S.: Functions with local state: regularity and undecidability. Theor. Comput. Sci. 338(1/3), 315–349 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Murawski, A.S., Ong, C.-H.L., Walukiewicz, I.: Idealized Algol with ground recursion, and DPDA equivalence. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 917–929. Springer, Heidelberg (2005). doi: 10.1007/11523468_74 CrossRefGoogle Scholar
  22. 22.
    Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Game semantic analysis of equivalence in IMJ. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 411–428. Springer, Cham (2015). doi: 10.1007/978-3-319-24953-7_30 CrossRefGoogle Scholar
  23. 23.
    Murawski, A.S., Tzevelekos, N.: Full abstraction for reduced ML. In: Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 32–47. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-00596-1_4 CrossRefGoogle Scholar
  24. 24.
    Murawski, A.S., Tzevelekos, N.: Algorithmic nominal game semantics. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 419–438. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-19718-5_22 CrossRefGoogle Scholar
  25. 25.
    Murawski, A.S., Tzevelekos, N.: Algorithmic games for full ground references. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 312–324. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-31585-5_30 CrossRefGoogle Scholar
  26. 26.
    Pitts, A.M., Stark, I.D.B.: Operational reasoning for functions with local state. In: Higher Order Operational Techniques in Semantics, pp. 227–273. Cambridge University Press (1998)Google Scholar
  27. 27.
    Reynolds, J.C.: The essence of ALGOL. In: Proceedings of the International Symposium on Algorithmic Languages. Elsevier Science Inc. (1981)Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  • Conrad Cotton-Barratt
    • 1
    Email author
  • Andrzej S. Murawski
    • 2
  • C. -H. Luke Ong
    • 1
  1. 1.University of OxfordOxfordUK
  2. 2.University of WarwickCoventryUK

Personalised recommendations