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.