The Use of Rippling to Automate Event-B Invariant Preservation Proofs
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.
KeywordsEvent-B automated reasoning rippling lemma conjecture
Unable to display preview. Download preview PDF.
- 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
- 6.Bundy, A.: Rippling: meta-level guidance for mathematical reasoning, vol. 56. Cambridge Univ. Pr. (2005)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