Advertisement

Modular Bisimulation Theory for Computations and Values

  • Martin Churchill
  • Peter D. Mosses
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7794)

Abstract

For structural operational semantics (SOS) of process algebras, various notions of bisimulation have been studied, together with rule formats ensuring that bisimilarity is a congruence. For programming languages, however, SOS generally involves auxiliary entities (e.g. stores) and computed values, and the standard bisimulation and rule formats are not directly applicable.

Here, we first introduce a notion of bisimulation based on the distinction between computations and values, with a corresponding liberal congruence format. We then provide metatheory for a modular variant of SOS (MSOS) which provides a systematic treatment of auxiliary entities. This is based on a higher order form of bisimulation, and we formulate an appropriate congruence format. Finally, we show how algebraic laws can be proved sound for bisimulation with reference only to the (M)SOS rules defining the programming constructs involved in them. Such laws remain sound for languages that involve further constructs.

Keywords

structural operational semantics programming languages congruence formats Modular SOS higher-order bisimulation 

References

  1. 1.
    Bernstein, K.L.: A congruence theorem for structured operational semantics of higher-order languages. In: 13th Annual IEEE Symposium on Logic in Computer Science, pp. 153–164. IEEE (1998)Google Scholar
  2. 2.
    Fokkink, W.: The Tyft/Tyxt Format Reduces to Tree Rules. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 440–453. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  3. 3.
    Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. Inf. and Comput. 100(2), 202–260 (1992)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Howe, D.J.: Equality in lazy computation systems. In: Fourth Annual IEEE Symposium on Logic in Computer Science, pp. 198–203. IEEE (1989)Google Scholar
  5. 5.
    Leroy, X.: The Caml Light system, documentation and user’s guide (1997), http://caml.inria.fr/pub/docs/manual-caml-light/
  6. 6.
    Levy, P.B.: Call-by-Push-Value: A Subsuming Paradigm. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 228–243. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  7. 7.
    Milner, R.: A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980)Google Scholar
  8. 8.
    Mosses, P.D.: Modular structural operational semantics. J. Log. Algebr. Program. 60-61, 195–228 (2004)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Mosses, P.D.: Component-based semantics. In: Huisman, M. (ed.) Eighth Intl. Workshop on Specification and Verification of Component-Based Systems, pp. 3–10. ACM, New York (2009)CrossRefGoogle Scholar
  10. 10.
    Mosses, P.D., Mousavi, M.R., Reniers, M.A.: Robustness of equations under operational extensions. In: Fröschle, S., Valencia, F.D. (eds.) 17th International Workshop on Expressiveness in Concurrency. EPTCS, arXiv, vol. 41, pp. 106–120 (2010)Google Scholar
  11. 11.
    Mosses, P.D., New, M.J.: Implicit propagation in structural operational semantics. In: Hennessy, M., Klin, B. (eds.) Fifth Workshop on Structural Operational Semantics. Electr. Notes Theor. Comput. Sci., vol. 229(4), pp. 49–66. Elsevier, Amsterdam (2009)Google Scholar
  12. 12.
    Mousavi, M.R., Gabbay, M., Reniers, M.: SOS for Higher Order Processes. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 308–322. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Mousavi, M.R., Reniers, M.A., Groote, J.F.: Notions of bisimulation and congruence formats for SOS with data. Inf. and Comput. 200(1), 107–147 (2005)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theor. Comput. Sci. 373(3), 238–272 (2007)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Park, D.: Concurrency and Automata on Infinite Sequences. In: Proc. 5th GI-Conference on Theoretical Computer Science, pp. 167–183. Springer, London (1981)CrossRefGoogle Scholar
  16. 16.
    Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program. 60-61, 17–139 (2004); Originally Tech. Rep. DAIMI FN-19, Dept. of Computer Science, Univ. Aarhus (1981)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Martin Churchill
    • 1
  • Peter D. Mosses
    • 1
  1. 1.Department of Computer ScienceSwansea UniversitySwanseaUK

Personalised recommendations