Toggle Main Menu Toggle Search

Open Access padlockePrints

A Model for Capturing and Replaying Proof Strategies

Lookup NU author(s): Dr Leo Freitas, Professor Cliff JonesORCiD, Dr Andrius Velykis, Dr Iain Whiteside


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


© Springer International Publishing Switzerland 2014.Modern theorem provers can discharge a significant proportion of Proof Obligation (POs) that arise in the use of Formal Method (FMs). Unfortunately, the residual POs require tedious manual guidance. On the positive side, these “difficult” POs tend to fall into families each of which requires only a few key ideas to unlock. This paper outlines a system that can lessen the burden of FM proofs by identifying and characterising ways of discharging POs of a family by tracking an interactive proof of one member of the family. This opens the possibility of capturing ideas — represented as proof strategies — from an expert and/or maximising reuse of ideas after changes to definitions. The proposed system has to store a wealth of meta-information about conjectures, which can be matched against previously learned strategies, or can be used to construct new strategies based on expert guidance.

Publication metadata

Author(s): Freitas L, Jones CB, Velykis A, Whiteside I

Editor(s): Giannakopoulou D., Kroening D.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: VSTTE 2014: Verified Software: Theories, Tools and Experiments

Year of Conference: 2014

Pages: 183-199

Online publication date: 18/07/2014

Acceptance date: 01/01/1900

Publisher: Springer, Cham


DOI: 10.1007/978-3-319-12154-3_12

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783319121536