Constructor-Based Inductive Theorem Prover

  • Daniel Găină
  • Min Zhang
  • Yuki Chiba
  • Yasuhito Arimoto
Conference paper

DOI: 10.1007/978-3-642-40206-7_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8089)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Daniel Găină
    • 1
  • Min Zhang
    • 1
  • Yuki Chiba
    • 1
  • Yasuhito Arimoto
    • 1
  1. 1.Japan Advanced Institute of Science and Technology (JAIST)NomiJapan

Personalised recommendations