Skip to main content
SpringerLink
Log in

Constructor-Based Inductive Theorem Prover

  • Conference paper
Algebra and Coalgebra in Computer Science (CALCO 2013)

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

Included in the following conference series:

Abstract

Constructor-based Theorem Prover (CITP) is a tool for proving inductive properties of software systems specified with constructor-based logics. CITP is equipped with a default proof strategy for the automated verification of Observational Transitional Systems (OTS), but the area of applications is not restricted to OTS. The proof strategy can be customised by the user, or the basic tactics can be applied step-by-step. The tool features are exhibited on concrete examples, showing how to perform verification with CITP.

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. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer (2004)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Găină, D., Futatsugi, K.: Initial Semantics in Logics with Constructors. J. Log. Comput. (2013), http://dx.doi.org/10.1093/logcom/exs044

  6. Găină, D., Lucanu, D., Ogata, K., Futatsugi, K.: On Automation of OTS/CafeOBJ method (submitted, 2013)

    Google Scholar 

  7. Găină, D.: Interpolation in logics with constructors. Theor. Comput. Sci. 474, 46–59 (2013)

    Article  MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Google Scholar 

  10. 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 

Download references

Author information

Authors and Affiliations

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

    Daniel Găină, Min Zhang, Yuki Chiba & Yasuhito Arimoto

Authors
  1. Daniel Găină
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Min Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuki Chiba
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yasuhito Arimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, LE1 7RH, Leicester, UK

    Reiko Heckel

  2. Lehrstuhl für Theoretische Informatik, Friedrich-Alexander Universität, 91058, Erlangen-Nürnberg, Germany

    Stefan Milius

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Găină, D., Zhang, M., Chiba, Y., Arimoto, Y. (2013). Constructor-Based Inductive Theorem Prover. In: Heckel, R., Milius, S. (eds) Algebra and Coalgebra in Computer Science. CALCO 2013. Lecture Notes in Computer Science, vol 8089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40206-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40206-7_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40205-0

  • Online ISBN: 978-3-642-40206-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation