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

  • Yuhui Lin
  • Alan Bundy
  • Gudmund Grov
Conference paper

DOI: 10.1007/978-3-642-28891-3_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7226)
Cite this paper as:
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

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yuhui Lin
    • 1
  • Alan Bundy
    • 1
  • Gudmund Grov
    • 1
  1. 1.School of InformaticsUniversity of EdinburghUK

Personalised recommendations