Chapter

NASA Formal Methods

Volume 7226 of the series Lecture Notes in Computer Science pp 231-236

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

  • Yuhui LinAffiliated withSchool of Informatics, University of Edinburgh
  • , Alan BundyAffiliated withSchool of Informatics, University of Edinburgh
  • , Gudmund GrovAffiliated withSchool of Informatics, University of Edinburgh

* Final gross prices may vary according to local VAT.

Get Access

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.

Keywords

Event-B automated reasoning rippling lemma conjecture