Context-dependent extensible syntax-oriented verifier with recursive verification

  • Authors:
  • Nhor Sok Lang;Quan Liang Chen;Takao Shimomura;Kenji Ikeda

  • Affiliations:
  • University of Tokushima, Course of Info Sci. & Intel. Syst., Tokushima, Japan;University of Tokushima, Course of Info Sci. & Intel. Syst., Tokushima, Japan;University of Tokushima, Course of Info Sci. & Intel. Syst., Tokushima, Japan;University of Tokushima, Course of Info Sci. & Intel. Syst., Tokushima, Japan

  • Venue:
  • WSEAS Transactions on Information Science and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to develop Web applications of high quality, it is important to apply efficient frameworks to standardize the process of development in projects, or apply useful design patterns to produce the program code that can easily be enhanced. However, it is not enough. In addition to these efforts, we have to check the programs to see whether they keep various kinds of rules such as verification items for security which are common for all kinds of Web applications, and verification items for coding styles or code conventions which are pertain to each project. This paper proposes a verification method for the syntax-oriented verifier, and describes the implementation of its prototype system, SyntaxVerifier. SyntaxVerifier makes it possible to detect syntactical objects based on their syntactic contexts. It realizes a recursive verification which makes it easy to dynamically trace a syntax tree in a verification process itself.