On Automation of OTS/CafeOBJ Method
The proof scores method is an interactive verification method in algebraic specification that combines manual proof planning and reduction (automatic inference by rewriting). The proof score approach to software verification coordinates efficiently human intuition and machine automation. We are interested in applying these ideas to transition systems, more concretely, in developing the so-called OTS/CafeOBJ method, a modelling, specification, and verification method of observational transition systems. In this paper we propose a methodology that aims at developing automatically proof scores according to the rules of an entailment system. The proposed deduction rules include a set of generic rules, which can be found in other proof systems as well, together with a set of rules specific to our working context. The methodology is exhibited on the example of the alternating bit protocol, where the unreliability of channels is faithfully specified.
KeywordsProof Strategy Ground Term Proof Tree Proof Rule Entailment Relation
Unable to display preview. Download preview PDF.
- 5.Diaconescu, R., Futatsugi, K.: CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST Series in Computing, vol. 6. World Scientific (1998)Google Scholar
- 7.Futatsugi, K.: Verifying Specifications with Proof Scores in CafeOBJ. In: ASE, pp. 3–10. IEEE Computer Society (2006)Google Scholar
- 10.Găină, D., Futatsugi, K.: Initial Semnatics in Logics with Constructors. J. Log. Comput (2013), http://dx.doi.org/10.1093/logcom/exs044
- 11.Găină, D., Zhang, M., Chiba, Y., Arimoto, Y.: Constructor-based Inductive Theorem Prover. In: Heckel, R. (ed.) CALCO 2013. LNCS, vol. 8089, pp. 328–333. Springer, Heidelberg (2013)Google Scholar
- 12.Goguen, J.: Theorem Proving and Algebra (1994)Google Scholar
- 14.Goguen, J.A., Lin, K.: Behavioral Verification of Distributed Concurrent Systems with BOBJ. In: 3rd International Conference on Quality Software (QSIC), p. 216 (2003)Google Scholar
- 15.Goguen, J.A., Lin, K., Rosu, G.: Circular Coinductive Rewriting. In: ASE, pp. 123–132 (2000)Google Scholar
- 18.Hendrix, J.D.: Decision Procedures for Equationally Based Reasoning. Technical Report, UIUC (2008)Google Scholar