Proof by analogy in mural

Vadera, S ORCID: 1995, 'Proof by analogy in mural' , Formal Aspects of Computing, 7 (2) , pp. 183-206.

PDF - Accepted Version
Download (407kB) | Preview


One of the most important advantages of using a formal method of developing software is that one can prove that development steps are correct with respect to their specification. Conducting proofs by hand, however,can be time consuming to the extent that designers have to judge whether a proof of a particular obligation is worth conducting. Even if hand proofs are worth conducting, how do we know that they are correct? One approach to overcoming this problem is to use an automatic theorem proving system to develop and check our proofs. However, in order to enable present day theorem provers to check proofs, one has to conduct them in much more detail than hand proofs. Carrying out more detailed proofs is of course more time consuming. This paper describes the use of proof by analogy in an attempt to reduce the time spent on proofs. We develop and implement a proof follower based on analogy and present two examples to illustrate its characteristics. One example illustrates the successful use of the proof follower. The other example illustrates that the follower's failure can provide a hint that enables the user to complete a proof.

Item Type: Article
Themes: Subjects / Themes > Q Science > QA Mathematics > QA075 Electronic computers. Computer science
Subjects outside of the University Themes
Schools: Schools > School of Computing, Science and Engineering
Schools > School of Computing, Science and Engineering > Salford Innovation Research Centre
Journal or Publication Title: Formal Aspects of Computing
Publisher: Springer
Refereed: Yes
ISSN: 0934-5043
Depositing User: S Vadera
Date Deposited: 23 Jun 2010 10:03
Last Modified: 16 Feb 2022 09:22

Actions (login required)

Edit record (repository staff only) Edit record (repository staff only)


Downloads per month over past year