CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Using a Software Testing Technique to Improve Theorem Proving

Angela Wallenburg ; Reiner Hähnle (Institutionen för datavetenskap, Formella metoder ; Institutionen för datavetenskap)
Formal Approaches to Software Testing Vol. LNCS 2931 (2004), p. 30-41.
[Konferensbidrag, refereegranskat]

Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we take the reverse viewpoint and show how the technique of partition testing can be used to improve a formal proof technique (induction for correctness of loops). We first compute a partition of the domain of the induction variable, based on the branch predicates in the program code of the loop we wish to prove. Based on this partition we derive a partitioned induction rule, which is (hopefully) easier to use than the standard induction rule. In particular, with an induction rule that is tailored to the program to be verified, less user interaction can be expected to be required in the proof. We demonstrate with a number of examples the practical efficiency of our method.

Nyckelord: program verification, software testing, partition analysis, interactive theorem proving, mathematical induction



Denna post skapades 2006-09-28. Senast ändrad 2010-02-23.
CPL Pubid: 12537

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, datavetenskap (GU) (GU)
Institutionen för datavetenskap, Formella metoder (2002-2004)
Institutionen för datavetenskap (2002-2004)

Ämnesområden

Datalogi

Chalmers infrastruktur