Method verifying the correctness of code refactoring program
The program after code refactoring, probably because a number of coding errors were introduced in the process of reconstruction, and could not properly achieve the function of origi-nal program, and therefore it was necessary to verify its correctness. But currently, it's difficult to prove the...
Uloženo v:
| Vydáno v: | Tongxin Xuebao Ročník 32; číslo 11A; s. 152 - 157 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | čínština |
| Vydáno: |
01.11.2011
|
| Témata: | |
| ISSN: | 1000-436X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The program after code refactoring, probably because a number of coding errors were introduced in the process of reconstruction, and could not properly achieve the function of origi-nal program, and therefore it was necessary to verify its correctness. But currently, it's difficult to prove the correctness of program directly; the view of transforming the verification of program correctness into the verification of program equivalence, and proposed a theorem proving technology based on synthesis method to verify the equivalence. The technology could not only avoid the difficulties by directly verifying the correctness of the program, but also could make full use of existing theorem proving tools to improve the level of automation, reducing the difficulty of proof. the principle of the method was presented, the basic assumption and proving environment, and then sum up the key strategies for the formal specification. Finally the equivalence of RC4 algorithm was verified with the presented method, and the experi |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1000-436X |