Modular Rewriting Semantics in Practice

We present a general method to achieve modularity of semantic definitions of programming languages specified as rewrite theories, so that semantic rules do not have to be redefined in language extensions. We illustrate the practical use of this method by means of two language case studies: two different semantics for CCS, and three different semantics for the GNU bc language.

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

[2]  Koushik Sen,et al.  An Executable Specification of Asynchronous Pi-Calculus Semantics and May Testing in Maude 2.0 , 2002, Electron. Notes Theor. Comput. Sci..

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

[4]  José Meseguer,et al.  Formal Analysis of Java Programs in JavaFAN , 2004, CAV.

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

[6]  Gul Agha,et al.  Research directions in concurrent object-oriented programming , 1993 .

[7]  M. Clavel.  Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications , 2000 .

[8]  José Meseguer,et al.  Membership algebra as a logical framework for equational specification , 1997, WADT.

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

[10]  José Meseguer,et al.  Formal JVM Code Analysis in JavaFAN , 2004, AMAST.

[11]  Grigore Rosu,et al.  Rule-Based Analysis of Dimensional Safety , 2003, RTA.

[12]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[13]  Roberto Bruni,et al.  Generalized Rewrite Theories , 2003, ICALP.

[14]  Carolyn L. Talcott,et al.  Plan in Maude: Specifying an Active Network Programming Language , 2004, WRLA.

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

[16]  José Meseguer,et al.  Reflection and strategies in rewriting logic , 1996, WRLA.

[17]  Grigore Rosu,et al.  Certifying Optimality of State Estimation Programs , 2003, CAV.

[18]  J. Meseguer,et al.  Building Equational Proving Tools by Reflection in Rewriting Logic , 2000 .

[19]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

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

[21]  José Meseguer,et al.  Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic , 2004, WRLA.

[22]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[23]  Joseph A. Goguen,et al.  Algebraic semantics of imperative programs , 1996, Foundations of computing series.

[24]  Joseph A. Goguen,et al.  Algebraic Denotational Semantics Using Parameterized Abstract Modules , 1981, ICFPC.

[25]  Claude Kirchner,et al.  ELAN from a rewriting logic point of view , 2002, Theor. Comput. Sci..

[26]  Alberto Verdejo,et al.  Implementing CCS in Maude 2 , 2002, Electron. Notes Theor. Comput. Sci..

[27]  José Meseguer,et al.  Rewriting logic: roadmap and bibliography , 2002, Theor. Comput. Sci..

[28]  Peter D. Mosses,et al.  Pragmatics of Modular SOS , 2002, AMAST.

[29]  José Meseguer,et al.  Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools , 2004, IJCAR.

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

[31]  Manfred Broy,et al.  Models, algebras and logic of engineering software , 2003 .

[32]  José Meseguer,et al.  A logical theory of concurrent objects and its realization in the Maude language , 1993 .

[33]  Peter D. Mosses.  Foundations of Modular SOS , 1999, MFCS.

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

[35]  Peter D. Mosses.  Unified Algebras and Action Semantics , 1989, STACS.

[36]  Mitchell Wand,et al.  First-order identities as a defining language , 1980, Acta Informatica.

[37]  Manfred Broy,et al.  On the algebraic definition of programming languages , 1987, TOPL.