Translation of State Machines from Equational Theories into Rewrite Theories with Tool Support

This paper presents a strategy together with tool support for the translation of state machines from equational theories into rewrite theories, aiming at automatically generating rewrite theory specifications. Duplicate effort can be saved on specifying state machines both in equational theories and rewrite theories, when we incorporate the theorem proving facilities of CafeOBJ with the model checking facilities of Maude. Experimental results show that efficiencies of the generated specifications by the proposed strategy are significantly improved, compared with those that are generated by three other existing translation strategies.

[1]  Michael Leuschel,et al.  Validating Z Specifications Using the ProBAnimator and Model Checker , 2007, IFM.

[2]  Kazuhiro Ogata,et al.  Modular Implementation of a Translator from Behavioral Specifications to Rewrite Theory Specifications , 2009, 2009 Ninth International Conference on Quality Software.

[3]  Natarajan Shankar,et al.  An Integration of Model Checking with Automated Proof Checking , 1995, CAV.

[4]  Ichiro Suzuki,et al.  A distributed mutual exclusion algorithm , 1985, TOCS.

[5]  Francisco Durán,et al.  Maude as a Formal Meta-tool , 1999, World Congress on Formal Methods.

[6]  Ashish Tiwari,et al.  Sal 2 , 2004, CAV.

[7]  Kazuhiro Ogata,et al.  A lightweight integration of theorem proving and model checking for system verification , 2005, 12th Asia-Pacific Software Engineering Conference (APSEC'05).

[8]  Kazuhiro Ogata,et al.  Induction-Guided Falsification , 2006, ICFEM.

[9]  Kazuhiro Ogata,et al.  A Specification Translation from Behavioral Specifications to Rewrite Specifications , 2008, IEICE Trans. Inf. Syst..

[10]  Kazuhiro Ogata,et al.  Chocolat/SMV: A Translator from CafeOBJ into SMV , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[11]  Peter Csaba Ölveczky,et al.  A Guide to Extending Full Maude Illustrated with the Implementation of Real-Time Maude , 2008, WRLA.

[12]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[13]  Kazuhiro Ogata,et al.  Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method , 2006, Essays Dedicated to Joseph A. Goguen.

[14]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[15]  Kazuhiro Ogata,et al.  Specification Translation of State Machines from Equational Theories into Rewrite Theories , 2010, ICFEM.

[16]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[17]  Kazuhiro Ogata,et al.  Proof Scores in the OTS/CafeOBJ Method , 2003, FMOODS.