The use of rippling to automate event-b invariant preservation proofs

Authors:
Yuhui Lin;Alan Bundy;Gudmund Grov
Affiliations:
School of Informatics, University of Edinburgh, UK;School of Informatics, University of Edinburgh, UK;School of Informatics, University of Edinburgh, UK
Venue:
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Year:
2012

Citing 7
Cited 0

Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm

Automated Software Engineering
A Science of Reasoning: Extended Abstract

Proceedings of the 10th International Conference on Automated Deduction
Rippling: meta-level guidance for mathematical reasoning

Rippling: meta-level guidance for mathematical reasoning
Formal methods in industry: achievements, problems, future

Proceedings of the 28th international conference on Software engineering
Modeling in Event-B: System and Software Engineering

Modeling in Event-B: System and Software Engineering
Rodin: an open toolset for modelling and reasoning in Event-B

International Journal on Software Tools for Technology Transfer (STTT) - Special Section on VSTTE 2008
Scheme-based synthesis of inductive theories

MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I

Quantified Score

Hi-index	0.00

Visualization

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.