Formal support for e-government system design with transparency consideration
Proceedings of the 1st international conference on Theory and practice of electronic governance
Simulation-based Verification for Invariant Properties in the OTS/CafeOBJ Method
Electronic Notes in Theoretical Computer Science (ENTCS)
From ASN.1 into CafeOBJ: Some First Steps
SEEFM '09 Proceedings of the 2009 Fourth South-East European Workshop on Formal Methods
Order-sorted parameterization and induction
Semantics and algebraic specification
Combining theorem proving and narrowing for rewriting-logic specifications
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Fostering proof scores in CafeOBJ
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Principles of proof scores in CafeOBJ
Theoretical Computer Science
| Hi-index | 0.00 |
Verifying specifications is still one of the most important undeveloped reseach topics in software engineering. It is important because quite a few critical bugs are caused at the level of domains, requirements, and/or designs. It is also important for the cases where no program codes are generated and specifications are analyzed and verified only for justifying models of problems in real world. This paper gives a survey of our research activities in verifying specifications with Proof Scores in CafeOBJ . After explaining fundamental issues and importance of verifying specifications, an overview of CafeOBJ language, the proof score approach in CafeOBJ including its applications to several areas are given. This paper is based on our already published books or papers as [6, 12, 16], and refers to many of our related publications. Interested readers are invited to look into them.