Building Tools for LOTOS Symbolic Semantics in Maude

We describe a formal tool based on a symbolic semantics for Full LOTOS, where specifications without restrictions in their data types can be executed. The reflective feature of rewriting logic and the metalanguage capabilities of Maude make it possible to implement the whole tool in the same semantic framework, and have allowed us to implement the LOTOS operational semantics, to integrate it with ACT ONE specifications, and to build an entire environment with parsing, pretty printing, and input/output processing of LOTOS specifications. Our aim has been to implement a formal tool that can be used by everyone without knowledge of the concrete implementation, but where the semantics representation is at so high level that can be understood and modified by everyone that knows about operational semantics.

[1]  Savi Maharaj,et al.  An Adequate Logic for Full LOTOS , 2001, FME.

[2]  Patrick Lincoln,et al.  Maude as a metalanguage , 1998, WRLA.

[3]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

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

[5]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

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

[7]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1: Equations and Initial Semantics , 1985 .

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Kenneth J. Turner,et al.  Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL , 1993 .

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

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

[12]  Tommaso Bolognesi,et al.  LOTOSphere: Software Development with LOTOS , 1995, Springer US.

[13]  Carron Shankland,et al.  Implementing a Modal Logic over Data and Processes using XTL , 2001, FORTE.

[14]  José Alberto Verdejo López.  LOTOS Symbolic Semantics in Maude , 2002 .

[15]  Narciso Martí-Oliet,et al.  Towards Maude 2.0 , 2000, WRLA.

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

[17]  Henk Eertink,et al.  Executing Lotos specifications: The Smile Tool , 1995 .

[18]  Editors , 1986, Brain Research Bulletin.

[19]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

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

[21]  Alberto Verdejo.  A tool for Full LOTOS in Maude , 2002 .

[22]  José Nuno Oliveira,et al.  FME 2001: Formal Methods for Increasing Software Productivity , 2001, Lecture Notes in Computer Science.

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

[24]  Carron Shankland,et al.  A Symbolic Semantics and Bisimulation for Full LOTOS , 2001, FORTE.

[25]  Rance Cleaveland,et al.  Generic tools for verifying concurrent systems , 2002, Sci. Comput. Program..

[26]  Luigi Logrippo,et al.  A Validation Environment for LOTOS , 1993, PSTV.

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

[28]  J. Meseguer.  Research Directions in Rewriting Logic , 1999 .

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

[30]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..