loading...
Verifying Java Programs By Theorem Prover HOL
Chicago, Illinois September 17-September 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/COMPSAC.2006.8530th Annual International Computer So ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Anduo Wang, Tsinghua University, China
He Fei, Tsinghua University, China
Ming Gu, Tsinghua University, China
Xiaoyu Song, Portland State University, USA
Program verification plays an important role in assuring the reliability of software systems. This paper presents a novel verification methodology for Java programs based on the higher-order logic theorem proving system HOL. The soundness of a Java program in accordance with its specification in annotation is established in HOL4. A Hoare-logic based verification methodology (WHY) guides the verification process. As a case study, a Java program with four methods is specified in JML annotation and proved in HOL. The flexible manipulation of pure method call in annotation is presented in the HOL proof mechanism. This work may constitute the first attempt on using the proving system HOL for Java programs. The experience demonstrates the effectiveness and the promising results of the approach.
Citation:
Anduo Wang, He Fei, Ming Gu, Xiaoyu Song, "Verifying Java Programs By Theorem Prover HOL," compsac, vol. 1, pp.139-142, 30th Annual International Computer Software and Applications Conference (COMPSAC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions