Proof Scores in the OTS/CafeOBJ method (2003)
| Venue: | In Proc. of The 6th IFIP WG6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS 2003), volume 2884 of LNCS |
| Citations: | 13 - 10 self |
BibTeX
@INPROCEEDINGS{Ogata03proofscores,
author = {Kazuhiro Ogata and Kokichi Futatsugi and Nec Software Hokuriku},
title = {Proof Scores in the OTS/CafeOBJ method},
booktitle = {In Proc. of The 6th IFIP WG6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS 2003), volume 2884 of LNCS},
year = {2003},
pages = {170--184},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several case studies. The way makes it possible to divide a formula stating an invariant property under discussion into reasonably small ones, each of which is proved by writing proof scores individually. This relieves the load to reduce logical formulas and can decrease the number of subcases into which the case is split in case analysis.
