transparent gif


Ej inloggad.

Göteborgs universitets publikationer

Using a Software Testing Technique to Improve Theorem Proving

Författare och institution:
Angela Wallenburg (Institutionen för data- och informationsteknik, datavetenskap (GU)); Reiner Hähnle (Institutionen för datavetenskap, Formella metoder, Chalmers & Institutionen för datavetenskap, Chalmers)
Publicerad i:
Formal Approaches to Software Testing, LNCS 2931 s. 30-41
Konferensbidrag, refereegranskat
Sammanfattning (abstract):
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.
Ämne (baseras på Högskoleverkets indelning av forskningsämnen):
Data- och informationsvetenskap ->
Datavetenskap (datalogi) ->
program verification, software testing, partition analysis, interactive theorem proving, mathematical induction
Postens nummer:
Posten skapad:
2006-09-28 10:16
Posten ändrad:
2010-02-23 16:49

Visa i Endnote-format

Göteborgs universitet • Tel. 031-786 0000
© Göteborgs universitet 2007