Skip to main content
SpringerLink
Log in
Book cover

Advances in Computer Science and Ubiquitous Computing pp 15–21Cite as

Proving Sufficient Completeness of Constructor-Based Algebraic Specifications

  • Conference paper
  • First Online:

  • 1806 Accesses

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 373))

Abstract

OBJ algebraic specification languages, for example, OBJ3, CafeOBJ and Maude, are formal specification languages which support several sophisticated functions to describe and verify large and complex specifications. Recently, the proof score method, which is an interactive formal verification method for OBJ languages, based on constructor-based algebras has been developed and several practical case studies have been reported. Sufficient completeness is one of the most important properties of constructor-based specifications, which guarantees the existence of initial models. In this study, we give a sufficient condition for sufficient completeness of constructor-based specifications based on the theory of term rewriting.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. CafeOBJ. http://cafeobj.org/

  2. Futatsugi, Kokichi, Gaina, Daniel, Ogata, Kazuhiro: Principles of proof scores in CafeOBJ. Theorem Computer Science 464, 90–112 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gaina, D., Futatsugi, K.: Initial semantics in logics with constructors. Journal of Logic and Computation 25(1), 95–116 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kapur, D., et al.: Sufficient-completeness, ground-reducibility and their complexity. Acta Informatica 28, 311–350 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Schernhammer, F., Meseguer, J.: Incremental checking of well-founded recursive specifications modulo axioms. In: Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 5–16 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Toyama Prefectural University, 5180 Kurokawa, Imizu, Toyama, 939-0398, Japan

    Masaki Nakamura

  2. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

    Daniel Gaina, Kazuhiro Ogata & Kokichi Futatsugi

Authors
  1. Masaki Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Gaina
    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

Corresponding author

Correspondence to Masaki Nakamura .

Editor information

Editors and Affiliations

  1. Department of Computer Software Engg..., Soonchunhyang University, Chungnam, Korea (Republic of)

    Doo-Soon Park

  2. I-Lan, Taiwan

    Han-Chieh Chao

  3. Dept. of Multimedia Eng., Dongguk University, Seoul, Korea (Republic of)

    Young-Sik Jeong

  4. Department of Computer Science and Engg., Seoul University of Science & Technology, Seoul, Korea (Republic of)

    James J. (Jong Hyuk) Park

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media Singapore

About this paper

Cite this paper

Nakamura, M., Gaina, D., Ogata, K., Futatsugi, K. (2015). Proving Sufficient Completeness of Constructor-Based Algebraic Specifications. In: Park, DS., Chao, HC., Jeong, YS., Park, J. (eds) Advances in Computer Science and Ubiquitous Computing. Lecture Notes in Electrical Engineering, vol 373. Springer, Singapore. https://doi.org/10.1007/978-981-10-0281-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0281-6_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0280-9

  • Online ISBN: 978-981-10-0281-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation