Skip to main content
SpringerLink
Log in

SPIKE: a system for automatic inductive proofs

  • Refereed Contributions
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 936))

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Adel Bouhoula and Michaël Rusinowitch. Automatic case analysis in proof by induction. In Ruzena Bajcsy, editor, Proceedings 13th International Joint Conference on Artificial Intelligence, Chambéry (France), volume 1, pages 88–94. Morgan Kaufmann, August 1993.

    Google Scholar 

  2. Adel Bouhoula and Michaël Rusinowitch. Implicit induction in conditional theories, 1994. Accepted for publication by Journal of Automated Reasoning, to appear. Also available as INRIA report 2045, 1993.

    Google Scholar 

  3. Adel Bouhoula, Emmanuel Kounalis, and Michaël Rusinowitch. Automated mathematical induction. 1995. Accepted for publication by Journal of Logic and Computation, to appear. Also available as INRIA report 1636, 1992.

    Google Scholar 

  4. Adel Bouhoula. The challenge of mutual recursion and mutual simplification in implicit induction. Invited talk at the International Workshop on the Automation of Proof by Mathematical Induction, Nancy (France), June 1994.

    Google Scholar 

  5. Adel Bouhoula. Preuves Automatiques par Récurrence dans les Théories Conditionnelles. PhD thesis, Université de Nancy I, Mars 1994.

    Google Scholar 

  6. Adel Bouhoula. Spike: a system for sufficient completeness and parameterized inductive proof. In A. Bundy, editor, Proceedings 12th International Conference on Automated Deduction, Nancy (France), volume 814 of Lecture Notes in Artificial Intelligence, pages 836–840. Springer-Verlag, June 1994.

    Google Scholar 

  7. Adel Bouhoula. Sufficient completeness and parameterized proofs by induction. In Proceedings Fourth International Conference on Algebraic and Logic Programming, Madrid (Spain), volume 850 of Lecture Notes in Computer Science, pages 23–40. Springer-Verlag, September 1994.

    Google Scholar 

  8. Adel Bouhoula. Fundamental Results on Automated Theorem Proving by Test Set Induction. Technical Report 2478, INRIA, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-Lorraine & CRIN, BP 101, 54600, Villers-lès-Nancy, France

    Adel Bouhoula & Michaël Rusinowitch

Authors
  1. Adel Bouhoula
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michaël Rusinowitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. S. Alagar Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouhoula, A., Rusinowitch, M. (1995). SPIKE: a system for automatic inductive proofs. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_79

Download citation

  • DOI: https://doi.org/10.1007/3-540-60043-4_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60043-5

  • Online ISBN: 978-3-540-49410-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation