## Customised induction rules for proving correctness of imperative programs (2004)

### Cached

### Download Links

- [www.cs.chalmers.se]
- [www.cs.chalmers.se]
- [www.cse.chalmers.se]
- DBLP

### Other Repositories/Bibliography

Citations: | 8 - 1 self |

### BibTeX

@MISC{Wallenburg04customisedinduction,

author = {Angela Wallenburg},

title = {Customised induction rules for proving correctness of imperative programs},

year = {2004}

}

### OpenURL

### Abstract

This thesis is aimed at simplifying the user-interaction in semi-interactive theorem proving for imperative programs. More specifically, we describe the creation of customised induction rules that are tailor-made for the specific program to verify and thus make the resulting proof simpler. The concern is in user interaction, rather than in proof strength. To achieve this, two different verification techniques are used. In the first approach, we develop an idea where a software testing technique, partition analysis, is used to compute a partition of the domain of the induction variable, based on the branch predicates in the program we wish to prove correct. Based on this partition we derive mechanically a partitioned induction rule, which then inherits the divide-and-conquer style of partition analysis, and (hopefully) is easier to use than the standard (Peano) induction rule. The second part of the thesis continues with a more thorough development of the method. Here the connection to software testing is completely removed