Browse > Article
http://dx.doi.org/10.9708/jksci.2012.17.7.023

Visualization of Verification Condition by GML file  

Hu, Hye-Lim (Dept. of Computer Science & Information Technology, Inha University)
Kim, Je-Min (Dept. of Computer Science & Information Technology, Inha University)
Park, Joon-Seok (Dept. of Computer Science & Information Technology, Inha University)
Yoo, Weon-Hee (Dept. of Computer Science & Information Technology, Inha University)
Abstract
There is a method which identifies validity of program by transforming program to verification condition to verify program. If program is verified by generating verification condition, verification condition must have enough and accurate information for verifying program. However, verification condition is consisting of logical formulas, so the user cannot easily identify the verification condition. In this paper, we implemented program that visualize the poorly readable verification conditions. By the program, the users can easily identify information, such as the relationship between logical formulas that represent verification condition.
Keywords
Verification Condition(VC); graph; visualization; unstructured program;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 GML: A portable Graph File Format http://www. lkn.ei.tum.de/arbeiten/faq/guidelines/gml-tr.html
2 SeonTae Kim, JeMin Kim, JoonSeok Park, WeonHee Yoo, "BIRS ; ByteCode Intermediate Representation With Specification" The 35th Conference of the KIPS, 18, 1, p.265-268 May 2011   과학기술학회마을
3 Andreas Gal. "Efficient Bytecode Verification and Compilation in a Virtual Machine." Ph.D. Dissertation. University of California at Irvine, Irvine, CA, USA. Advisor(s) Michael Franz. AAI3243940, 2006.
4 K. Rustan M. Leino, James B. Saxe, and Raymie Stata. "Checking Java Programs via Guarded commands." In Proceedings of the Workshop on Object-Oriented Technology, Ana M. D. Moreira and Serge Demeyer (Eds.). Springer-Verlag, London, UK, pp.110-111, 1999.
5 Mike Barnett, Bor-Yuh Evan Chang, Robert DeLine, Bart Jacobs, and K. Rustan M. Leino. "Boogie: A Modular Reusable Verifier for Object-Oriented Programs." In Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005
6 Jean-Christophe Filliatre, "Why : a multi-language multi-prover verification tool," LRI-CNRS UMR 8623, Universite Paris Sud, March 2003
7 The Coq Proof Assistant. http://coq.inria.fr/.
8 The PVS Specification and Verification System. http://pvs.csl.sri.com/.
9 John Harrison. HOL Light. http://www.cl.cam.ac.uk/users/jrh/hol-light/.
10 The Mizar project. http://mizar.uwb.edu.pl/.
11 The Simplicify decision procedure(part of ESC/Java). http://research.compaq.com/SRC/esc/simplify/.
12 Silvio Ranise and David Deharbe. The haRVey decision procedure. http://www.loria.fr/-ranise/haRVey/.
13 Lilian Burdy, Yoonsik Cheon, David R. Cok, Michael D. Ernst, Joseph R. Kiniry, Gary T. Leavens, K. Rustan M. Leino, and Erik Poll. "An overview of JML tools and applications." Int. J. Softw. Tools Technol. Transf. 7, 3, pp.212-232, June 2005.   DOI
14 Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. "Extended static checking for Java." SIGPLAN Not. 37, 5, pp.234-245, May 2002.   DOI
15 Greg Nelson. "A generalization of Dijkstra's calculus." ACM Trans. Program. Lang. Syst. 11, 4, pp.517-561, October 1989.   DOI
16 JeMin Kim, JoonSeok Park, WeonHee Yoo, "A Design of Verification Framework for Java Bytecode", The Korea Society of Digital Industry & Infromation Management , June 2011
17 K. Rustan M. Leino, Todd Millstein, and James B. Saxe. "Generating error traces from verification-condition counterexamples." Sci. Comput. Program. 55, 1-3, pp.209-226, March 2005.   DOI   ScienceOn
18 Edsger Wybe Dijkstra. "A Discipline of Programming (1st ed.)." Prentice Hall PTR, Upper Saddle River, NJ, USA, 1997.
19 Ralph-Johan J. Back, Abo Akademi, J. Von Wright. "Refinement Calculus: A Systematic Introduction (1st ed.)." F. B. Schneider and D. Gries (Eds.). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1998.
20 Cormac Flanagan and James B. Saxe. "Avoiding exponential explosion: generating compact verification conditions." In Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL '01). ACM, New York, NY, USA, pp.193-205, 2001.
21 Mike Barnett, K. Rustan M. Leino, " Weakest-precondition of unstructured programs", ACM SIGSOFT Software Engineering Notes, v.31 n.1, pp.82-87, January 2006   DOI