Prototyping SOS Meta-theory in Maude

We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formulae, deduction rules and transition system specifications) in Maude. Besides the basic definitions, we implement methods for checking the premises of some SOS meta-theorems (e.g., GSOS congruence meta-theorem) in this framework. Furthermore, we define a generic strategy for animating programs and models for semantic specifications in our meta-language. The general goal of this line of research is to develop a general-purpose tool that assists language designers by checking useful properties about the language under definition and by providing a rapid prototyping environment for scrutinizing the actual behavior of programs according to the defined semantics.

[1]  Narciso Martí-Oliet,et al.  The Maude System , 1999, RTA.

[2]  Peter D. Mosses,et al.  Modular structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[3]  José Alberto Verdejo López,et al.  Executable Structural Operational Semantics in Maude , 2003 .

[4]  José Meseguer,et al.  Mapping Modular SOS to Rewriting Logic , 2002, LOPSTR.

[5]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[6]  José Meseguer,et al.  Maude Action Tool: Using Reflection to Map Action Semantics to Rewriting Logic , 2000, AMAST.

[7]  J. Meseguer,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[8]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[9]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[10]  Alberto Verdejo,et al.  Two Case Studies of Semantics Execution in Maude: CCS and LOTOS , 2005, Formal Methods Syst. Des..

[11]  Mohammad Reza Mousavi,et al.  SOS for Higher Order Processes , 2005, CONCUR.

[12]  Peter D. Mosses.  Exploiting labels in Structural Operational Semantics , 2004, SAC '04.

[13]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

[14]  Pieter H. Hartel,et al.  LETOS – a lightweight execution tool for operational semantics , 1999, Softw. Pract. Exp..

[15]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

[16]  Alberto Verdejo,et al.  Executable structural operational semantics in Maude , 2006, J. Log. Algebraic Methods Program..

[17]  Christiano Braga,et al.  Rewriting Logic as a Semantic Framework for Modular Structural Op-erational Semantics , 2001 .

[18]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[19]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[20]  Wan Fokkink,et al.  A Conservative Look at Operational Semantics with Variable Binding , 1998, Inf. Comput..

[21]  Narciso Martí-Oliet,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[22]  Alberto Verdejo,et al.  Implementing CCS in Maude , 2000, FORTE.

[23]  Fabio Gadducci,et al.  A causal semantics for CCS via rewriting logic , 2002, Theor. Comput. Sci..

[24]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[25]  Jan Friso Groote,et al.  The meaning of negative premises in transition system specifications , 1991, JACM.

[26]  Alberto Verdejo,et al.  Building Tools for LOTOS Symbolic Semantics in Maude , 2002, FORTE.

[27]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[28]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[29]  José Meseguer,et al.  Modular Rewriting Semantics of Programming Languages , 2004, AMAST.