COMBINE: a tool on combined formal methods for bindingly verification

  • Authors:
  • An N. Nguyen;Tho T. Quan;Phung H. Nguyen;Thang H. Bui

  • Affiliations:
  • Faculty of Computer Science and Engineering, Hochiminh City University of Technology, Vietnam;Faculty of Computer Science and Engineering, Hochiminh City University of Technology, Vietnam;Faculty of Computer Science and Engineering, Hochiminh City University of Technology, Vietnam;Faculty of Computer Science and Engineering, Hochiminh City University of Technology, Vietnam

  • Venue:
  • ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Theorem proving and model checking are two well-known formal methods emerging recently for software verification. Each of them has its own advantages and disadvantages. As an attempt to combine the verification capabilities of these two methods, in this paper we introduce a verification tool known as COMBINE (Combined fOrmal Methods for BINdingly vErification). Suggested by its name, COMBINE can verify imperative programs in a bindingly manner comprising of two phases: static verification and dynamic verification. In fact, COMBINE has been developed as a published Web-based system currently being used for teaching programming for students at Hochiminh City University of Technology (HCMUT), Vietnam.