Skip to main content

The Use of Rippling to Automate Event-B Invariant Preservation Proofs

  • Conference paper
NASA Formal Methods (NFM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7226))

Included in the following conference series:

Abstract

Proof automation is a common bottleneck for industrial adoption of formal methods. In Event-B, a significant proportion of proof obligations which require human interaction fall into a family called invariant preservation. In this paper we show that a rewriting technique called rippling can increase the automation of proofs in this family, and extend this technique by combining two existing approaches.

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

Access this chapter

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. Abrial, J.R.: Formal methods in industry: achievements, problems, future. In: Proceedings of the 28th International Conference on Software Engineering, pp. 761–768. ACM (2006)

    Google Scholar 

  2. Abrial, J.R.: Modeling in Event-B - System and Software Engineering. Cambridge University Press (2010)

    Google Scholar 

  3. Abrial, J.R., Butler, M.J., Hallerstede, S., Hoang, T.S., Mehta, F., Voisin, L.: Rodin: an open toolset for modelling and reasoning in event-B. STTT 12(6), 447–466 (2010)

    Article  Google Scholar 

  4. Armando, A., Smaill, A., Green, I.: Automatic synthesis of recursive programs: The proof-planning paradigm. Autom. Softw. Eng. 6(4), 329–356 (1999)

    Article  Google Scholar 

  5. Bundy, A.: A Science of Reasoning. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 633–640. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  6. Bundy, A.: Rippling: meta-level guidance for mathematical reasoning, vol. 56. Cambridge Univ. Pr. (2005)

    Google Scholar 

  7. Ireland, A.: Productive use of failure in inductive proof. Journal of Automated Reasoning 16(1-2), 79–111 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jones, C.B., Grov, G., Bundy, A.: Ideas for a high-level proof strategy language. Tech. Rep. CS-TR-1210, School of Computing Science, Newcastle University (2010)

    Google Scholar 

  9. Kraan, I., Basin, D., Bundy, A.: Middle-out reasoning for synthesis and induction. Journal of Automated Reasoning 16(1), 113–145 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. Montano-Rivas, O., McCasland, R.L., Dixon, L., Bundy, A.: Scheme-Based Synthesis of Inductive Theories. In: Sidorov, G., Hernández Aguirre, A., Reyes García, C.A. (eds.) MICAI 2010, Part I. LNCS, vol. 6437, pp. 348–361. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, Y., Bundy, A., Grov, G. (2012). The Use of Rippling to Automate Event-B Invariant Preservation Proofs. In: Goodloe, A.E., Person, S. (eds) NASA Formal Methods. NFM 2012. Lecture Notes in Computer Science, vol 7226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28891-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28891-3_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28890-6

  • Online ISBN: 978-3-642-28891-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics