Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On Automation of OTS/CafeOBJ Method

  • Chapter
Specification, Algebra, and Software

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8373))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bidoit, M., Hennicker, R.: Constructor-based observational logic. J. Log. Algebr. Program. 67(1-2), 3–51 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bidoit, M., Hennicker, R., Kurz, A.: Observational logic, constructor-based logic, and their duality. Theor. Comput. Sci. 3(298), 471–510 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Borzyszkowski, T.: Logical systems for structured specifications. Theor. Comput. Sci. 286(2), 197–245 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  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 

  6. Diaconescu, R., Futatsugi, K.: Logical foundations of CafeOBJ. Theor. Comput. Sci. 285(2), 289–318 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Futatsugi, K.: Verifying Specifications with Proof Scores in CafeOBJ. In: ASE, pp. 3–10. IEEE Computer Society (2006)

    Google Scholar 

  8. Futatsugi, K., Goguen, J.A., Ogata, K.: Verifying Design with Proof Scores. In: Meyer, B., Woodcock, J. (eds.) Verified Software. LNCS, vol. 4171, pp. 277–290. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Futatsugi, K., Găină, D., Ogata, K.: Principles of proof scores in CafeOBJ. Theor. Comput. Sci. 464, 90–112 (2012)

    Article  MathSciNet  MATH  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 

  13. Goguen, J.A., Burstall, R.: Institutions: Abstract Model Theory for Specification and Programming. Journal of the Association for Computing Machinery 39(1), 95–146 (1992)

    Article  MathSciNet  MATH  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 

  16. Goriac, E.-I., Lucanu, D., Roşu, G.: Automating Coinduction with Case Analysis. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol. 6447, pp. 220–236. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Găină, D., Futatsugi, K., Ogata, K.: Constructor-based Logics. J. UCS 18(16), 2204–2233 (2012)

    MathSciNet  MATH  Google Scholar 

  18. Hendrix, J.D.: Decision Procedures for Equationally Based Reasoning. Technical Report, UIUC (2008)

    Google Scholar 

  19. Lucanu, D., Goriac, E.-I., Caltais, G., Roşu, G.: CIRC: A Behavioral Verification Tool based on Circular Coinduction. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 433–442. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Meseguer, J.: Order-Sorted Parameterization and Induction. In: Palsberg, J. (ed.) Mosses Festschrift. LNCS, vol. 5700, pp. 43–80. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Ogata, K., Futatsugi, K.: Flaw and modification of the iKP electronic payment protocols. Inf. Process. Lett. 86(2), 57–62 (2003)

    Article  MathSciNet  Google Scholar 

  22. Ogata, K., Futatsugi, K.: Simulation-based Verification for Invariant Properties in the OTS/CafeOBJ Method. Electr. Notes Theor. Comput. Sci. 201, 127–154 (2008)

    Article  Google Scholar 

  23. Sannella, D., Tarlecki, A.: Specifications in an Arbitrary Institution. Inf. Comput. 76(2/3), 165–210 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Japan Advanced Institute of Science and Technology (JAIST), Japan

    Daniel Găină, Kazuhiro Ogata & Kokichi Futatsugi

  2. Alexandru Ioan Cuza University, Romania

    Dorel Lucanu

Authors
  1. Daniel Găină
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dorel Lucanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kazuhiro Ogata
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kokichi Futatsugi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Network and Information, Senshu University, 2-1-1 Higashi-mita, Tama-ku, 214-8580, Kawasaki, Kanagawa, Japan

    Shusaku Iida

  2. Department of Computer Science, Thomas M. Siebel Center for Computer Science, University of Illinois at Urbana-Champaign (UIUC), 201 N. Goodwin Avenue, MC 258, 61801, Urbana, IL, USA

    José Meseguer

  3. School of Information Science, Advanced Institute of Science and Technology (JAIST), 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan

    Kazuhiro Ogata

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Găină, D., Lucanu, D., Ogata, K., Futatsugi, K. (2014). On Automation of OTS/CafeOBJ Method. In: Iida, S., Meseguer, J., Ogata, K. (eds) Specification, Algebra, and Software. Lecture Notes in Computer Science, vol 8373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54624-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54624-2_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54623-5

  • Online ISBN: 978-3-642-54624-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation