Skip to the content

Review of heuristics for generalisation

Tools

Vadera, S 1995, 'Review of heuristics for generalisation' , Software Engineering Journal, 10 (4) , pp. 118-123.

[img]
Preview
 PDF (Author prepared) - Accepted Version
Download (146kB) | Preview

    Abstract

    Proof by induction plays a central role in showing that recursive programs satisfy their specification. Sometimes a key step is to generalise a lemma so that its inductive proof is easier. Existing heuristics for generalisation for induction are examined. The applicability of heuristics for generalisation is also examined, and it is shown that the kind of examples on which some of the heuristics work best form a well defined class of problems. A class of generalisation problems is identified for which none of the methods work, and directions for future research are provided.

    Item Type: Article
    Uncontrolled Keywords: Formal Methods, VDM, Proof by induction
    Themes: Subjects / Themes > Q Science > QA Mathematics > QA075 Electronic computers. Computer science > QA076 Computer software
    Subjects outside of the University Themes
    Schools: Colleges and Schools > College of Science & Technology
    Colleges and Schools > College of Science & Technology > School of Computing, Science and Engineering
    Colleges and Schools > College of Science & Technology > School of Computing, Science and Engineering > Data Mining and Pattern Recognition Research Centre
    Journal or Publication Title: Software Engineering Journal
    Publisher: IEE
    Refereed: Yes
    ISSN: 0268-6961
    Depositing User: S Vadera
    Date Deposited: 16 Feb 2011 15:40
    Last Modified: 27 Sep 2011 12:32
    URI: http://usir.salford.ac.uk/id/eprint/12892

    Document Downloads

    More statistics for this item...

    Actions (login required)

    		 Edit record (repository staff only)