Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Theoretical Computer Science
Distributed Algorithms
Communication and Concurrency
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Equational Approach to Formal Analysis of TLS
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Verifying Specifications with Proof Scores in CafeOBJ
ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
Formal analysis of the iKP electronic payment protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Algebraic approaches to formal analysis of the Mondex electronic purse system
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
An Algebraic Specification for the MPEG-2 Encoding Algorithm
SEEFM '09 Proceedings of the 2009 Fourth South-East European Workshop on Formal Methods
Formal modeling and verification of sensor network encryption protocol in the OTS/CafeOBJ method
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Fostering proof scores in CafeOBJ
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Embedding domain-specific modelling languages in Maude specifications
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
The OTS/CafeOBJ method is a formal method to model systems, specify models and verify that models satisfy properties. We propose a way to verify that a state machine S satisfies invariant properties based on a simulation from S to another state machine, which is more abstract than S, in the OTS/CafeOBJ method. Three communication protocols are used as examples to demonstrate the proposed method.