Using encryption for authentication in large networks of computers
Communications of the ACM
Introduction to the Theory of Computation
Introduction to the Theory of Computation
A Lightweight Integration of Theorem Proving and Model Checking for System Verification
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Model Checking LTL Formulae in RAISE with FDR
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
A Specification Translation from Behavioral Specifications to Rewrite Specifications
IEICE - Transactions on Information and Systems
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way
FM '09 Proceedings of the 2nd World Congress on Formal Methods
QSIC '09 Proceedings of the 2009 Ninth International Conference on Quality Software
Validating Z specifications using the PROB animator and model checker
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
A combination of forward and backward reachability analysis methods
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
| Hi-index | 0.00 |
Specifications of state machines in CafeOBJ are called equational theory specifications (EQT Specs) which are based on equational logic, and in Maude are called rewrite theory specifications (RWT Specs) which are based on rewriting logic. The translation from EQT Specs to RWT Specs achieves the collaboration between CafeOBJ's theorem proving facilities and Maude's model checking facilities. However, translated specifications by existing strategies are of inefficiency and rarely used for model checking in practice. This paper defines a specific class of EQT Specs called EADS Specs, and proposes a strategy for the translation from EADS Specs to RWT Specs. It is proved that translated specifications by the strategy are more efficient than those by existing strategies.