Discovery of Invariants through Automated Theory Formation

06/21/2011
by   Maria Teresa Llano, et al.
0

Refinement is a powerful mechanism for mastering the complexities that arise when formally modelling systems. Refinement also brings with it additional proof obligations -- requiring a developer to discover properties relating to their design decisions. With the goal of reducing this burden, we have investigated how a general purpose theory formation tool, HR, can be used to automate the discovery of such properties within the context of Event-B. Here we develop a heuristic approach to the automatic discovery of invariants and report upon a series of experiments that we undertook in order to evaluate our approach. The set of heuristics developed provides systematic guidance in tailoring HR for a given Event-B development. These heuristics are based upon proof-failure analysis, and have given rise to some promising results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2017

On the decidability of the existence of polyhedral invariants in transition systems

Automated program verification often proceeds by exhibiting inductive in...
research
12/05/2021

New Properties and Invariants of Harmonic Polygons

Via simulation, we discover and prove curious new Euclidean properties a...
research
08/25/2022

Electronic Appendix to "Input Invariants"

In this electronic appendix to our paper "Input Invariants," accepted at...
research
04/30/2013

Digenes: genetic algorithms to discover conjectures about directed and undirected graphs

We present Digenes, a new discovery system that aims to help researchers...
research
10/24/2018

The Unit-B Method --- Refinement Guided by Progress Concerns

We present Unit-B, a formal method inspired by Event-B and UNITY. Unit-B...
research
09/16/2019

Learning Invariants through Soft Unification

Human reasoning involves recognising common underlying principles across...

Please sign up or login with your details

Forgot password? Click here to reset